Amalgamation of Ortholattices

It was proved by Maksimova in 1977 that exactly eight varieties of Heyting algebras have the amalgamation property, and hence exactly eight axiomatic extensions of intuitionistic propositional logic have the deductive interpolation property. The prevalence of the deductive interpolation property for axiomatic extensions of substructural logics and the amalgamation property for varieties of pointed residuated lattices, their equivalent algebraic semantics, is far less well understood, however. Taking as our starting point a formulation of intuitionistic propositional logic as the full Lambek calculus with exchange, weakening, and contraction, we investigate the role of the exchange rule--algebraically, the commutativity law--in determining the scope of these properties. First, we show that there are continuum-many varieties of idempotent semilinear residuated lattices that have the amalgamation property and contain non-commutative members, and hence continuum-many axiomatic extensions of the corresponding logic that have the deductive interpolation property in which exchange is not derivable. We then show that, in contrast, exactly sixty varieties of commutative idempotent semilinear residuated lattices have the amalgamation property, and hence exactly sixty axiomatic extensions of the corresponding logic with exchange have the deductive interpolation property. From this latter result, it follows also that there are exactly sixty varieties of commutative idempotent semilinear residuated lattices whose first-order theories have a model completion.

We prove a lemma which, under restrictive conditions, shows that epimorphisms inV are surjective if this is true for epimorphisms from irreducible members of V. This lemma is applied to varieties of orthomodular lattices which are generated by orthomodular lattices of bounded height, and to varieties of orthomodular lattices which are generated by orthomodular lattices which are the horizontal sum of their blocks. The lemma can also be applied to obtain known results for discriminator varieties. Mathematics Subject Classifications ( 2000): 06C15, 03G12, 08B25.

This paper presents a proof that Boolean algebras have the strong amalgamation property which does not use any choice principle, based on a feature of their binary coproducts which is derived by means of a construction from pointfree topology.

For any amalgam ( S , T ; U ) (S,\,T;\,U) of inverse semigroups, it is shown that the natural partial order on S ∗ U T S{{\ast }_U}T , the (inverse semigroup) free product of S S and T T amalgamating U U , has a simple form on S ∪ T S \cup T . In particular, it follows that the semilattice of S ∗ U T S{{\ast }_U}T is a bundled semilattice of the corresponding semilattice amalgam ( E ( S ) , E ( T ) ; E ( U ) ) (E(S),\,E(T);\,E(U)) ; taken jointly with a result of Teruo Imaoka, this gives that the class of generalized inverse semigroups has the strong amalgamation property. Preserving finiteness is also considered.

This paper describes a computational approach to studying certain aspects of small finite orthomodular lattices (OML’s). The program has two main parts: one, to construct a representation of an OML L, and to perform some simple analyses on L; and two, to construct at least a portion of S 0 (L), the Foulis semigroup (or Baer *-semigroup) of the Sasaki projection functions on L. The representation is constructed from an input which represents the Greechie diagram of L. Such a diagram depicts an orthoposet as a collection of maximal Boolean subalgebras, and if an input does not represent a lattice, the program indicates why not. While the operations of the program are not asserted to be optimal, extensive efforts have been made to use information about the problem area to find efficient methods of performing the various tasks of the program. The methods used and some results are described, and some remarks about possible future work are also given.

Introduction. Every orthomodular lattice (abbreviated : OML) is the union of its maximal Boolean subalgebras (blocks). The question thus arises how conversely Boolean algebras can be amalgamated in order to obtain an OML of which the given Boolean algebras are the blocks. This question we deal with in the present paper.The problem was first investigated by Greechie [6, 7, 8, 9]. His technique of pasting [6] will also play an important role in this paper. A case solved completely by Greechie [9] is the case that any two blocks intersect either in the bounds only or have the bounds, an atom and its complement in common. This is, of course, a very special situation. The more surprising it is that Greechie's methods, if skillfully applied, yield considerable insight into the structure of OMLs and provide a seemingly unexhaustible source for counter-examples.

Equational bases for some varieties of orthomodular lattices related to states

For any finitely based variety of orthomodular lattices, we determine the sizes of all equational bases that are both irredundant and self-dual.

We prove the preservation theorems for NATP; many of them extend the previously established preservation results for other model-theoretic tree properties. Using them, we also furnish proper examples of NATP theories which are simultaneously TP2 and SOP. First, we show that NATP is preserved by the parametrization and sum of the theories of Fraïssé limits of Fraïssé classes satisfying strong amalgamation property. Second, the preservation of NATP for two kinds of dense/co-dense expansions, i.e. the theories of lovely pairs and of H-structures for geometric theories, and dense/co-dense expansion on vector spaces is proved. Next, we prove the preservation of NATP for the generic predicate expansion and the pair of an algebraically closed field and its distinguished subfield; for the latter, not only NATP, but also the preservation of NTP1 and NTP2 is considered. Finally, we present some proper examples of NATP theories using the results proved in this paper, including the parametrization of DLO and the expansion of an algebraically closed field by adding a generic linear order. In particular, we show that the model companion of the theory of algebraically closed fields with circular orders (ACFO) is NATP.

POLYNOMIAL NORMAL FORMS AND THE EMBEDDING OF POLYNOMIAL ALGEBRAS