Maslov's inverse method and decidable classes
From MaRDI portal
DOI10.1016/0168-0072(89)90053-5zbMATH Open0692.03009OpenAlexW1986341459MaRDI QIDQ583187FDOQ583187
Authors: Nail Zamov
Publication date: 1989
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(89)90053-5
Recommendations
resolutionMaslov's inverse methodunificationdecidable classesdeducibilityextension of the clash rule
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)
Cites Work
- The Specialization of Programs by Theorem Proving
- On a bound for the complexity of terms in the resolution method
- The inverse method for establishing deducibility for logical calculi
- Title not available (Why is that?)
- Resolution Strategies as Decision Procedures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Two decidable classes of formulas of the modal logic S5
- Condensed detachment is complete for relevance logic: A computer-aided proof
- Decidable fragments of first-order modal logics
- What is the inverse method?
- Using resolution for deciding solvable classes and building finite models
- History and prospects for first-order automated deduction
- Decidability of the class E by Maslov's inverse method
This page was built for publication: Maslov's inverse method and decidable classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583187)