Using the Universal Modality: Gains and Questions
From MaRDI portal
Publication:4007156
DOI10.1093/logcom/2.1.5zbMath0774.03003OpenAlexW2164389533MaRDI QIDQ4007156
Solomon Passy, Valentin F. Goranko
Publication date: 27 September 1992
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7af6a99dac9829ab0c2eeef55e8f106441584452
minimal extensionKripke semanticsmodal definabilityuniversal modalityindependent jointransfer of property
Related Items
« Everywhere » and « here », MEREOLOGICAL BIMODAL LOGICS, Expressive power of ``now and ``then operators, A Modal-Layered Resolution Calculus for K, Pooling modalities and pointwise intersection: semantics, expressivity, and dynamics, A Logic of Knowing How, Modal logic for other-world agnostics: Neutrality and Halldén incompleteness, Hybrid languages, BISIMULATIONS FOR KNOWING HOW LOGICS, Tree models and (labeled) categorial grammar, Reasoning with Global Assumptions in Arithmetic Modal Logics, Separation logics and modalities: a survey, Unification in epistemic logics, NEIGHBOURHOOD CANONICITY FOR EK, ECK, AND RELATIVES: A CONSTRUCTIVE PROOF, FMP-ensuring logics, RA-ensuring logics and FA-ensuring logics in NExtK4.3, The modal logic of inequality, Existential definability of modal frame classes, A polynomial space construction of tree-like models for logics with local chains of modal connectives, THE BAIRE CLOSURE AND ITS LOGIC, Non-monotonic reasoning via dynamic consequence, Coinductive models and normal forms for modal logics (or how we learned to stop worrying and love coinduction), Unification and Finite Model Property for Linear Step-Like Temporal Multi-Agent Logic with the Universal Modality, The d-logic of the rational numbers: a fruitful construction, The universal modality, the center of a Heyting algebra, and the Blok-Esakia theorem, On the Strong Completeness of Åqvist’s Dyadic Deontic Logic G, ``That will do: logics of deontic necessity and sufficiency, Completeness and decidability of tense logics closely related to logics above K4, Free choice in modal inquisitive logic, Tableaux methods for access control in distributed systems, Unnamed Item, Unnamed Item, Unnamed Item, A logic of goal-directed knowing how, Modal logics of some geometrical structures, Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms, Characterization, definability and separation via saturated models, The many faces of counts-as: A formal analysis of constitutive rules, Completeness in hybrid type theory, Topological Subset Space Models for Public Announcements, Expressing discrete spatial relations under granularity, Temporal interaction of information and belief, Linear temporal logic with until and next, logical consecutions, A simple tableau system for the logic of elsewhere, Arthur Prior and `now', On the modal logic of subset and superset: tense logic over Medvedev frames, Completeness of S4 with respect to the real line: revisited, Some characterization and preservation theorems in modal logic, Characterising modal definability of team-based logics via the universal modality, Unnamed Item, STABLE CANONICAL RULES, LOGICS FOR PROPOSITIONAL DETERMINACY AND INDEPENDENCE, An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning, An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning, Announcement as effort on topological spaces, \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments, : A Resolution-Based Prover for Multimodal K, Justified Belief and the Topology of Evidence, Characterizing Relative Frame Definability in Team Semantics via the Universal Modality, Complexity of the universal theory of modal algebras, The price of universality, Decidability: theorems and admissible rules, Completeness and Complexity of Multi-modal CTL, Axiomatic characterization of the AGM theory of belief revision in a temporal logic, PDL with negation of atomic programs, A ModalWalk Through Space, Modal Logics for Parallelism, Orthogonality, and Affine Geometries, Axiomatizing Distance Logics, Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids, On Characterization, Definability and ω-Saturated Models, Sequent calculi for global modal consequence relations, A strict implication calculus for compact Hausdorff spaces, Deciding regular grammar logics with converse through first-order logic, Fibred semantics and the weaving of logics. Part 1: Modal and intuitionistic logics, NP reasoning in the monotone \(\mu\)-calculus, On the Blok-Esakia Theorem, Modal Satisfiability via SMT Solving, Monadic <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Σ</mml:mi><mml:mn>1</mml:mn><mml:mn>1</mml:mn></mml:msubsup></mml:math> and Modal Logic with Quantified Binary Relations, Modal logic with names, On the Semilattice of Modal Operators and Decompositions of the Discriminator, A modal perspective on the computational complexity of attribute value grammar, Generalized quantifiers and modal logic, An essay in combinatory dynamic logic, DYNAMIC HYPERINTENSIONAL BELIEF REVISION, A simple modal logic for belief revision, Existential second-order logic and modal logic with quantified accessibility relations, LOGICS FOR PROPOSITIONAL CONTINGENTISM, Proof-theoretic functional completeness for the hybrid logics of everywhere and elsewhere
