A solution of the uniform word problem for ortholattices

DOI10.1017/S0960129510000125zbMath1210.06003MaRDI QIDQ3583025

Andrea Meinander

Publication date: 26 August 2010

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

decidabilityproof searchortholatticeuniform word problem

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complemented lattices, orthocomplemented lattices and posets (06C15) Free lattices, projective lattices, word problems (06B25)

Related Items

The intensional side of algebraic-topological representation theorems ⋮ Computer proof of monotonicity of operations on orthomodular lattices

Cites Work

• Unnamed Item
• Cut elimination and word problems for varieties of lattices
• The word and generator problems for lattices
• From basic logic to quantum logics with cut-elimination
• Proof theory for minimal quantum logic. I
• Proof theory for minimal quantum logic. II
• Semantic analysis of orthologic
• Permutability of rules in lattice theory.
• The logic of quantum mechanics
• Proof systems for lattice theory
• Polynomial Time Uniform Word Problems