Derivation rules as anti-axioms in modal logic
From MaRDI portal
Publication:4276034
DOI10.2307/2275109zbMath0793.03017OpenAlexW2061003582WikidataQ114589018 ScholiaQ114589018MaRDI QIDQ4276034
Publication date: 30 August 1994
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.545.2468
Related Items
Rectangular games, Hyperboolean Algebras and Hyperboolean Modal Logic, Modal logic for other-world agnostics: Neutrality and Halldén incompleteness, The logic of Peirce algebras, Dynamic extensions of arrow logic, Notes on logics of metric spaces, Existential definability of modal frame classes, Branching-time logic with quantification over branches: The point of view of modal logic, Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse, Second-order propositional modal logic: expressiveness and completeness results, ON FORMALIZING CAUSATION BASED ON CONSTANT CONJUNCTION THEORY, Local properties in modal logic, Axiomatizing the logical core of XPath 2.0, Some characterization and preservation theorems in modal logic, Elementary canonical formulae: extending Sahlqvist's theorem, Temporal Logics with Reference Pointers and Computation Tree Logics, A system of dynamic modal logic, PDL with intersection of programs: a complete axiomatization, Hybrid Tableaux for the Difference Modality, Modal Logics for Parallelism, Orthogonality, and Affine Geometries, A strict implication calculus for compact Hausdorff spaces, Admissibility of \(\Pi_2\)-inference rules: interpolation, model completion, and contact algebras, Topological Perspective on the Hybrid Proof Rules, Proof-theoretic functional completeness for the hybrid logics of everywhere and elsewhere
Cites Work
- Unnamed Item
- On the strength of temporal proofs
- Handbook of philosophical logic. Volume II: Extensions of classical logic
- PDL with data constants
- A finite axiomatization of the set of strongly valid Ockhamist formulas
- The domino relation: Flattening a two-dimensional logic
- Decidability for branching time
- Language in action
- Temporal logics need their clocks
- Algebraization of quantifier logics, an introductory overview
- An axiomatization for until and since over the reals without the IRR rule
- Is ``Some-other-time sometimes better than ``Sometime for proving partial correctness of programs?
- Axiomatization of `Peircean' branching-time logic
- Expressiveness and completeness of an interval tense logic
- Varieties of complex algebras
- A Modal Logic for Chopping Intervals
- An Axiomatization of the Temporal Logic with Until and Since over the Real Numbers
- A new proof of Sahlqvist's theorem on modal definability and completeness
