scientific article; zbMATH DE number 3499717

zbMath0319.02018MaRDI QIDQ4081211

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Modal logic (including the logic of norms) (03B45) Categoricity and completeness of theories (03C35)

Related Items (74)

From axioms to synthetic inference rules via focusing ⋮ On the Decidability of Elementary Modal Logics ⋮ On the canonicity of Sahlqvist identities ⋮ Exploring the Power of Converse Events ⋮ $\aleph_1$ and the modal $\mu$-calculus ⋮ A pure view of ecumenical modalities ⋮ Weighted modal logic in epistemic and deontic contexts ⋮ On Artemov and Protopopescu's intuitionistic epistemic logic expanded with distributed knowledge ⋮ Topology and duality in modal logic ⋮ Constructive canonicity in non-classical logics ⋮ Algebraic modal correspondence: Sahlqvist and beyond ⋮ Multi-dimensional semantics for modal logics ⋮ Definability in the class of all -frames – computability and complexity ⋮ Critical notice to: D. M. Gabbay's Investigations in modal and tense logics with applications to problems in philosophy and linguistics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Disentangling structural connectives or life without display property ⋮ Algorithmic correspondence and canonicity for distributive modal logic ⋮ A polynomial space construction of tree-like models for logics with local chains of modal connectives ⋮ Temporal logic of surjective bounded morphisms between finite linear processes ⋮ Topological duality and algebraic completions ⋮ Squares in fork arrow logic ⋮ Non-transitive correspondence analysis ⋮ The Ackermann approach for modal logic, correspondence theory and second-order reduction ⋮ AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX ⋮ Positive modal logic beyond distributivity ⋮ Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA ⋮ Modal frame correspondences and fixed-points ⋮ Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} ⋮ From DEL to EDL: Exploring the Power of Converse Events ⋮ A dynamic deontic logic for complex contracts ⋮ Together we know how to achieve: an epistemic logic of know-how ⋮ Algebraic and relational semantics for tense logics ⋮ A dynamic logic of agency. II: Deterministic ${\mathcal{DLA}}$, coalition logic, and game theory ⋮ Mathematical modal logic: A view of its evolution ⋮ Modal MTL-algebras ⋮ A propositional dynamic logic with qualitative probabilities ⋮ EVERYONE KNOWS THAT SOMEONE KNOWS: QUANTIFIERS OVER EPISTEMIC AGENTS ⋮ On canonicity of poset expansions ⋮ The disjunction property of intermediate propositional logics ⋮ MacNeille completions and canonical extensions ⋮ Price of privacy ⋮ Logic of confidence ⋮ Epistemic logic meets epistemic game theory: a comparison between multi-agent Kripke models and type spaces ⋮ Maximal Kripke-type semantics for modal and superintuitionistic predicate logics ⋮ Unnamed Item ⋮ Expressive power and incompleteness of propositional logics ⋮ Two-dimensional modal logic ⋮ Bounded lattice expansions ⋮ Interpolation and preservation in ${\mathcal{ML}}_{\omega_1}$ ⋮ A Sahlqvist theorem for distributive modal logic ⋮ Interactions between knowledge, action and commitment within agent dynamic logic ⋮ A dynamic logic of agency. I: STIT, capabilities and powers ⋮ Algorithmic correspondence and canonicity for non-distributive logics ⋮ Elementary canonical formulae: extending Sahlqvist's theorem ⋮ Distributed Relation Logic ⋮ Canonical extensions and ultraproducts of polarities ⋮ On combinations of propositional dynamic logic and doxastic modal logics ⋮ Solving the \$100 modal logic challenge ⋮ Finite-Chain Graded Modal Logic ⋮ Supervenience, Dependence, Disjunction ⋮ Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis ⋮ Unnamed Item ⋮ Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations ⋮ Modal correspondence for models ⋮ KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS ⋮ The price of universality ⋮ Towards incorporating background theories into quantifier elimination ⋮ A Catalog ofWeak Many-Valued Modal Axioms and their Corresponding Frame Classes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Modal logic with names ⋮ Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$ ⋮ A theory of hypermodal logics: Mode shifting in modal logic

This page was built for publication: