Decision problem for orthomodular lattices
Copyright policy )Decision problem for orthomodular lattices
The author partially solves the problem of H. P. Sankappanavar and S. Burris whether the theory of orthomodular lattices is recursively inseparable and which varieties of orthomodular lattices are finitely decidable. Results: -- The variety of orthomodular lattices has a finitely inseparable first order theory. -- The variety of modular ortholattices is finitely decidable. -- The variety generated by the unique \(2n+2\) element modular ortholattice with \(2n\) atoms is finitely decidable. -- The variety generated by horizontal sums of Boolean algebras is finitely decidable.
- University of Gdańsk Poland
ortholattice, Complemented lattices, orthocomplemented lattices and posets, Decidability of theories and sets of sentences, finite decidability, Lattices of varieties, orthomodular lattice, inseparability
ortholattice, Complemented lattices, orthocomplemented lattices and posets, Decidability of theories and sets of sentences, finite decidability, Lattices of varieties, orthomodular lattice, inseparability
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!