Undecidability of relatively free Hilbert algebras

DOI10.1007/BF01229957zbMath0646.03006OpenAlexW178447142MaRDI QIDQ1103604

Paweł M. Idziak

Publication date: 1988

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

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

zbMATH Keywords

implication algebrashereditarily undecidablefinite partition latticesvariety of Hilbert algebras

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Free algebras (08B20) Equational classes, universal algebra in model theory (03C05)

Related Items

The decision problem for finite algebras from arithmetical varieties with equationally definable principal congruences ⋮ Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties ⋮ Bibliography on quantum logics and related structures ⋮ On Tarski algebras with a finite set of free generators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algebraic approach to non-classical logics
• Lattice-theoretic decision problems in universal algebra
• Density and closure in implicative semi-lattices
• Decidability and Boolean representations
• Meet-Irreducible Elements in Implicative Lattices
• On direct products of theories
• Concatenation as a basis for arithmetic