Turning decision procedures into disprovers

DOI10.1002/malq.200710083zbMath1171.03039OpenAlexW2155580690MaRDI QIDQ5505144

André Rognes

Publication date: 23 January 2009

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200710083

zbMATH Keywords

algebraic logicEntscheidungsproblemmany-sorted polyadic algebrapolyadic set algebra

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Cylindric and polyadic algebras; relation algebras (03G15)

Uses Software

• MONA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions of density that imply representability in algebraic logic
• Remarks on Berger's paper on the domino problem
• Turing-machines and the Entscheidungsproblem
• MONA IMPLEMENTATION SECRETS
• The first order properties of products of algebraic systems
• ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
• Tensor products of polyadic algebras
• The undecidability of the domino problem

This page was built for publication: Turning decision procedures into disprovers