Permutability of rules in lattice theory.

DOI10.1007/s000120200012zbMath1060.06013OpenAlexW2148186563MaRDI QIDQ1771961

Sara Negri, Jan von Plato

Publication date: 19 April 2005

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000120200012

zbMATH Keywords

lattice theorydecidabilityproof analysisderivability of universal formulas

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Structure of proofs (03F07) Free lattices, projective lattices, word problems (06B25)

Related Items

The intensional side of algebraic-topological representation theorems, Combinatorial analysis of proofs in projective and affine geometry, In the Shadows of the Löwenheim-Skolem Theorem: Early Combinatorial Analyses of Mathematical Proofs, A solution of the uniform word problem for ortholattices

Uses Software

• Pesca