A proof theoretic tool for first-order modal logic
From MaRDI portal
Recommendations
- A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs
- A short and readable proof of cut elimination for two first-order modal logics
- On the proof-theory of two formalisations of modal first-order logic
- On modal systems having arithmetical interpretations
- On the proof-theory of a first-order extension of GL
Cited in
(13)- Tools and techniques in modal logic
- A short and readable proof of cut elimination for two first-order modal logics
- HOL Based First-Order Modal Logic Provers
- A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs
- scientific article; zbMATH DE number 3924750 (Why is no real title available?)
- A first approach to abstract modal logics
- scientific article; zbMATH DE number 1341605 (Why is no real title available?)
- scientific article; zbMATH DE number 1354137 (Why is no real title available?)
- scientific article; zbMATH DE number 1507194 (Why is no real title available?)
- scientific article; zbMATH DE number 1761887 (Why is no real title available?)
- On the proof-theory of a first-order extension of GL
- An Arithmetically Complete Predicate Modal Logic
- On the proof-theory of two formalisations of modal first-order logic
This page was built for publication: A proof theoretic tool for first-order modal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5413353)