Methods for Automated Theorem Proving in Nonclassical Logics

DOI10.1109/TC.1976.1674704zbMATH Open0329.68074OpenAlexW2035490172MaRDI QIDQ4095908FDOQ4095908

Authors: Charles G. Morgan 

Publication date: 1976

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1976.1674704

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Many-valued logic (03B50) Intermediate logics (03B55)

Cited In (10)

• Identity in modal logic theorem proving
• Theory matrices (for modal logics) using alphabetical monotonicity
• The recursive resolution method for modal logic
• Separation logics and modalities: a survey
• Deciding regular grammar logics with converse through first-order logic
• Uniform and non uniform strategies for tableaux calculi for modal logics
• Two-Variable Separation Logic and Its Inner Circle
• Condensed detachment as a rule of inference
• Automated reasoning and nonclassical logics: Introduction
• 3-SAT = SAT for a class of normal modal logics

This page was built for publication: Methods for Automated Theorem Proving in Nonclassical Logics

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