Now showing items 1-5 of 5

    • Young, William Joseph (2013-04-15)
      Department: Mathematics
      Residuated lattices, which generalize Boolean algebras and lattice-ordered groups, have been useful in the study of algebraic logic, particularly as an algebraic semantics for substructural logics. By equipping a residuated ...
    • Smedberg, Matthew Raine (2014-04-04)
      Department: Mathematics
      We show that several kinds of local behavior in a finite algebra A present obstructions to the decidability of the first-order theory of the finite members of HSP(A). In particular, we show that every solvable congruence ...
    • Wires, Alexander Duane (2013-05-28)
      Department: Mathematics
      In the first part, we explore definability in the substructure relation. Let U denote either the universal class of irreflexive symmetric digraphs or equivalence relations. We analyze first-order definability in the ordered ...
    • Jackson, Ethan Kerry (2007-08-16)
      Department: Computer Science
      This thesis presents a systemic study of the structural semantics of model-based design. Structural semantics have a long history in computer science, and were studied early on under the moniker of language syntax. This ...
    • Galatos, Nikolaos (2003-04-14)
      Department: Mathematics
      A residuated lattice is an algebraic structure that has a lattice and a monoid reduct, such that multiplication is residuated with respect to the order. Residuated lattices generalize many well studied algebras including ...