Uniform Interpolation and Propositional Quantifiers in Modal Logics
- 1 February 2007
- journal article
- research article
- Published by Springer Science and Business Media LLC in Studia Logica
- Vol. 85 (1), 1-31
- https://doi.org/10.1007/s11225-007-9021-5
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Modal LogicPublished by Cambridge University Press (CUP) ,2001
- Structural Proof TheoryPublished by Cambridge University Press (CUP) ,2001
- On the complexity of propositional quantification in intuitionistic logicThe Journal of Symbolic Logic, 1997
- Efficient loop-check for backward proof search in some non-classical propositional logicsLecture Notes in Computer Science, 1996
- A sheaf representation and duality for finitely presented Heyting algebrasThe Journal of Symbolic Logic, 1995
- Undefinability of propositional quantifiers in the modal system S4Studia Logica, 1995
- QUANTIFYING OVER PROPOSITIONS IN RELEVANCE LOGIC - NONAXIOMATISABILITY OF PRIMARY INTERPRETATIONS OF FOR-ALL-P AND THERE-EXISTS-PThe Journal of Symbolic Logic, 1993
- The Computational Complexity of Provability in Systems of Modal Propositional LogicSIAM Journal on Computing, 1977
- Propositional quantifiers in modal logic1Theoria, 1970
- On modal logic with propositional quantifiersThe Journal of Symbolic Logic, 1969