A completeness theorem in modal logic
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Public and private communication are different: Results on relative expressivity
- Dynamic topological S5
- Reasoning about knowledge of unawareness
- Interpreting network formalisms
- Carnapian extensions of S5
- Where gamma fails
- Some kinds of modal completeness
- A Hintikka possible worlds model for certainty levels in medical decision making
- Classical relevant logics. I
- Classical relevant logics. II
- Normal modal model theory
- Investigations into quantified modal logic. I
- Five faces of minimality
- A logical query language for hypermedia systems
- Towards automating duality
- Completeness results for intuitionistic and modal logic in a categorical setting
- \textit{De re} language, \textit{de re} eliminability, and the essential limits of both
- Propositional quantification in the topological semantics for S4
- Squares in fork arrow logic
- Dynamic reasoning with qualified syllogisms
- Mathematical modal logic: A view of its evolution
- Shortest axiomatizations of implicational S4 and S5
- The genesis of possible worlds semantics
- The broadest necessity
- Order-dual relational semantics for non-distributive propositional logics: a general framework
- On the decision problem for MELL
- Common belief of weak-dominance rationality in strategic-form games: a qualitative analysis
- Actuality, tableaux, and two-dimensional modal logics
- Key notions of Tarski's methodology of deductive systems
- A strong completeness theorem in intuitionistic quantified modal logic
- Three dual ontologies
- Reasoning-based introspection
- Quantified multimodal logics in simple type theory
- Opacity and the double life of singular propositions
- Logical characterizations of regular equivalence in weighted social networks
- A simplicial complex model for dynamic epistemic logic to study distributed task computability
- Back to the actual future
- Propositional quantification in bimodal S5
- Efficient multi-agent epistemic planning: teaching planners about nested belief
- The personal wealth importance to the intertemporal choice
- Counterpart semantics at work: independence and incompleteness results in quantified modal logic
- On Kripke completeness of modal predicate logics around quantified \textbf{K5}
- Introducing H, an institution-based formal specification and verification language
- On the logic of belief and propositional quantification
- Reprint of: Reasoning about knowledge of unawareness revisited
- Conservative extension in relevant implication
- Paraconsistency and the need for infinite semantics
- A note on algebraic semantics for \(\mathsf {S5}\) with propositional quantifiers
- Labelled tableau systems for some subintuitionistic logics
- Soundness and completeness proofs by coinductive methods
- Twenty-five basic theorems in situation and world theory
- Ultraproducts and possible worlds semantics in institutions
- Higher-order contingentism. I: Closure and generation
- Max-flow min-cut theorems on dispersion and entropy measures for communication networks
- On fork arrow logic and its expressive power
- New foundations for counterfactuals
- Quelques remarques sur les `tableaux de Beth'
- Random models of logical systems. III. Models of quantified logics
- Modal logic with subjunctive conditionals and dispositional predicates
- Provability as a deontic notion
- Validity and necessity
- A defense the Kripkean account of logical truth in first-order modal logic
- Deontic logic and possible worlds semantics: A historical sketch
- From intuitionism to many-valued logics through Kripke models
- Current trends in substructural logics
- New representations of modal functions
- Counterpart theories for everyone
- Modal logic S5 in answer set programming with lazy creation of worlds
- Computing distributed knowledge as the greatest lower bound of knowledge
- Category theory, logic and formal linguistics: some connections, old and new
- Embedding an analytic equivalence relation in the transitive closure of a Borel relation
- Complete abstractions and subclassical modal logics
- Quantified temporal alethic-deontic logic
- Hauptsatz for higher-order modal logic
- Introduction to model checking
- Temporal logic and fair discrete systems
- Dialetheic conditional modal logic
- Automating Leibniz's theory of concepts
- Assignment calculus: a pure imperative language
- Infinitary combinatorics and modal logic
- European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium '88), Padova, 1988
- From Philosophical to Industrial Logics
- A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems
- Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
- Back and forth constructions in modal logic: An interpolation theorem for a family of modal logics
- Does the deduction theorem fail for modal logic?
- Intentional identity interpreted: A case study of the relations among quantifiers, pronouns, and propositional attitudes
- Undecidability of modal and intermediate first-order logics with two individual variables
- Kripke modelling and verification of temporal specifications of a multiple UAV system
- Separation logics and modalities: a survey
- CAN MODALITIES SAVE NAIVE SET THEORY?
- Second-order propositional modal logic and monadic alternation hierarchies
- The fundamental theorem of world theory
- CIFOL: case-intensional first order logic. I: Toward a theory of sorts
- Abduction in economics: a conceptual framework and its model
- On a derivation of the necessity of identity
- A Sahlqvist theorem for substructural logic
- Standard state space models of unawareness (extended abstract)
- Modal logic S5 satisfiability in answer set programming
- Interpretations of weak positive modal logics
This page was built for publication: A completeness theorem in modal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3265659)