Expressive power of propositionally quantified modal logics on variable domain structures with accessibility
From MaRDI portal
Cites work
- A completeness theorem in modal logic
- A modal perspective on monadic second-order alternation hierarchies
- A note on algebraic semantics for \(\mathsf {S5}\) with propositional quantifiers
- A simple embedding of T into double S5
- Classical recursion theory. The theory of functions and sets of natural numbers
- Completeness of second-order propositional S4 and H in topological semantics
- Creative sets
- Decidability of quantified propositional intuitionistic logic and S4 on trees of height and arity \(\leq \omega\)
- Existential import revisited
- Expressivity of second order propositional modal logic
- scientific article; zbMATH DE number 3941493 (Why is no real title available?)
- scientific article; zbMATH DE number 3728252 (Why is no real title available?)
- scientific article; zbMATH DE number 755666 (Why is no real title available?)
- scientific article; zbMATH DE number 3212004 (Why is no real title available?)
- Logics for propositional contingentism
- Modal logic
- Modal Logic as Metaphysics
- Montague Type Semantics for Modal Logics with Propositional Quantifiers
- On modal logic with propositional quantifiers
- On the complexity of propositional quantification in intuitionistic logic
- On the logic of belief and propositional quantification
- On the logics with propositional quantifiers extending \textsf{S5}\(\Pi\)
- One modal logic to rule them all?
- Propositional contingentism
- Propositional quantifiers
- Propositional quantifiers in modal logic1
- Quantifying over propositions in relevance logic: nonaxiomatisability of primary interpretations of ∀p and ∃p
- Recursively enumerable sets of positive integers and their decision problems
- Representability in second-order propositional poly-modal logic
- Second-order propositional modal logic and monadic alternation hierarchies
- Second-order propositional modal logic: expressiveness and completeness results
- Symbolic logic.
- The broadest necessity
- The expressive power of second-order propositional modal logic
- Undefinability of propositional quantifiers in the modal system S4
- Why propositional quantification makes modal logics on trees robustly hard?
This page was built for publication: Expressive power of propositionally quantified modal logics on variable domain structures with accessibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6845927)