A Decidable Class of Nested Iterated Schemata

DOI10.1007/978-3-642-14203-1_25zbMath1291.03014OpenAlexW1541001066MaRDI QIDQ5747768

Nicolas Peltier, Vincent Aravantinos, Ricardo Caferra

Publication date: 14 September 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-14203-1_25

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05)

Related Items (4)

On deciding satisfiability by theorem proving with speculative inferences ⋮ A Decidable Class of Nested Iterated Schemata ⋮ RegSTAB: A SAT Solver for Propositional Schemata ⋮ A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite-model theory -- A personal perspective
• Proof schemata in Hilbert-type axiomatic theories
• Schemata: The Concept of Schema in the History of Logic
• A Schemata Calculus for Propositional Logic
• A machine program for theorem-proving
• A Decidable Class of Nested Iterated Schemata

This page was built for publication: A Decidable Class of Nested Iterated Schemata