Decidability of the Class E by Maslov’s Inverse Method

DOI10.1007/978-3-642-15025-8_26zbMath1287.03028OpenAlexW1600630910MaRDI QIDQ3586019

Grigori Mints

Publication date: 3 September 2010

Published in: Fields of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15025-8_26

zbMATH Keywords

inverse methoddecidable classesautomated deduction

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Related Items (1)

Theorem prover for intuitionistic logic based on the inverse method

Cites Work

• Decidable classes reducing to a one-quantifier class
• Modal languages and bounded fragments of predicate logic
• Eigenvariables, bracketing and the decidability of positive minimal predicate logic
• Sovability of the problem of deducibility in LJ for a class of formulas not containing negative occurrences of quantifiers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidability of the Class E by Maslov’s Inverse Method