Undefinability of propositional quantifiers in the modal system S4

From MaRDI portal
Publication:1902553

DOI10.1007/BF01061237zbMath0831.03008OpenAlexW2071786581MaRDI QIDQ1902553

Silvio Ghilardi, Marek W. Zawadowski

Publication date: 7 February 1996

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01061237




Related Items (25)

Positive Formulas in Intuitionistic and Minimal LogicUniform Lyndon interpolation for basic non-normal modal logicsUniform interpolation via nested sequentsUniform interpolation and propositional quantifiers in modal logicsPropositional quantification in the topological semantics for \(\mathbf S4\)UNIFORM INTERPOLATION IN SUBSTRUCTURAL LOGICSInseparability and Conservative Extensions of Description Logic Ontologies: A SurveyUniform interpolation and sequent calculi in modal logicThe Logical Difference Problem for Description Logic TerminologiesUniform interpolation and coherenceOn the logic of belief and propositional quantificationPitts' quantifiers are not topological quantificationSubstitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmeticModel completeness, uniform interpolants and superposition calculus. (With applications to verification of data-aware processes)Formal Properties of ModularisationMathematical Logic for Life Science OntologiesInterpolation in non-classical logicsμ-programs, uniform interpolation and bisimulation quantifiers for modal logics ★Forgetting in multi-agent modal logicsUniform interpolation and the existence of sequent calculiUniform Lyndon interpolation property in propositional modal logicsKnowledge forgetting: properties and applicationsCombination of uniform interpolants via Beth definabilitySome Formal Semantics for Epistemic ModestyCombined covers and Beth definability



Cites Work


This page was built for publication: Undefinability of propositional quantifiers in the modal system S4