Deciding simple infinity axiom sets with one binary relation by means of superpostulates

DOI10.1007/978-3-030-51074-9_12OpenAlexW3040284829MaRDI QIDQ2096446

Timm Lampert, Anderson Nakano

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-51074-9_12

zbMATH Keywords

first-order logicdecision problemcomplete theoriesreduction classesinfinity axiomsdyadic logic

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

The 10th IJCAR automated theorem proving system competition – CASC-J10

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automated inference of finite unsatisfiability
• Finite axiomatizability and theories with trivial algebraic closure
• Computability and Logic
• Minimizing disjunctive normal forms of pure first-order logic
• Henry M. Sheffer and Notational Relativity
• On first-order sentences without finite models
• The classical decision problem.

This page was built for publication: Deciding simple infinity axiom sets with one binary relation by means of superpostulates