Methods for Automated Theorem Proving in Nonclassical Logics
From MaRDI portal
Publication:4095908
DOI10.1109/TC.1976.1674704zbMath0329.68074OpenAlexW2035490172MaRDI QIDQ4095908
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
The recursive resolution method for modal logic ⋮ Uniform and non uniform strategies for tableaux calculi for modal logics ⋮ Separation logics and modalities: a survey ⋮ Two-Variable Separation Logic and Its Inner Circle ⋮ 3-SAT = SAT for a class of normal modal logics ⋮ Theory matrices (for modal logics) using alphabetical monotonicity ⋮ Identity in modal logic theorem proving ⋮ Deciding regular grammar logics with converse through first-order logic ⋮ Condensed detachment as a rule of inference ⋮ Automated reasoning and nonclassical logics: Introduction
This page was built for publication: Methods for Automated Theorem Proving in Nonclassical Logics
