Decidability of the class E by Maslov's inverse method

DOI10.1007/978-3-642-15025-8_26zbMATH Open1287.03028OpenAlexW1600630910MaRDI QIDQ3586019FDOQ3586019

Authors: G. E. 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

Recommendations

• Maslov's inverse method and decidable classes
• Two decidable classes of formulas of the modal logic S5
• scientific article; zbMATH DE number 4170865
• Random models and the Maslov class
• The inverse method application for non-classical logics

zbMATH Keywords

automated deductioninverse methoddecidable classes

Mathematics Subject Classification ID

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

Cites Work

• Modal languages and bounded fragments of predicate logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• The inverse method
• Decidable classes reducing to a one-quantifier class
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Two decidable classes of formulas of the modal logic S5
• Theorem prover for intuitionistic logic based on the inverse method
• Title not available (Why is that?)
• Maslov's inverse method and decidable classes
• What is the inverse method?
• Title not available (Why is that?)

This page was built for publication: Decidability of the class E by Maslov's inverse method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586019)