The Ackermann constant theorem: A computer-assisted investigation

DOI10.1007/BF01880324zbMath0743.03015MaRDI QIDQ1181706

John K. Slaney

Publication date: 27 June 1992

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

algorithmsconstraint satisfactionfinite algebrassentential constantsAckermann constant

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Related Items

Varieties of De Morgan monoids: minimality and irreducible algebras

Cites Work

• On the structure of De Morgan monoids with corollaries on relevant logic and theories
• 3088 varieties: A solution to the Ackermann constant problem
• Solution to the P − W problem
• Unnamed Item
• Unnamed Item
• Unnamed Item