Cut-free sequent calculi for some tense logics
From MaRDI portal
Publication:1317905
DOI10.1007/BF01053026zbMath0813.03012OpenAlexW1996723544MaRDI QIDQ1317905
Publication date: 22 March 1994
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01053026
Related Items
Power and Limits of Structural Display Rules, A linear logic framework for multimodal logics, Deep sequent systems for modal logic, MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description), A formally verified cut-elimination procedure for linear nested sequents for tense logic, Nested sequents for intuitionistic modal logics via structural refinement, Algebra, Proof Theory and Applications for a Logic of Propositions, Actions and Adjoint Modal Operators, A pure view of ecumenical modalities, Hypersequent rules with restricted contexts for propositional modal logics, LINEAR TIME IN HYPERSEQUENT FRAMEWORK, Provability multilattice logic, Mechanising Gödel-Löb provability logic in HOL light, An ecumenical notion of entailment, Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach, Focus-style proofs for the two-way alternation-free \(\mu \)-calculus, Nested sequents for intermediate logics: the case of Gödel-Dummett logics, Nested sequents for intuitionistic logics, The Proof Theory of Common Knowledge, On Height and Happiness, Through an Inference Rule, Darkly, Proofs and countermodels in non-classical logics, Hypersequent and display calculi -- a unified perspective, A survey of nonstandard sequent calculi, POSITIVE LOGIC WITH ADJOINT MODALITIES: PROOF THEORY, SEMANTICS, AND REASONING ABOUT INFORMATION, Syntactic cut-elimination for a fragment of the modal mu-calculus, Unnamed Item, Display calculi and other modal calculi: a comparison, The Method of Tree-Hypersequents for Modal Propositional Logic, Unnamed Item, Multicomponent proof-theoretic method for proving interpolation properties, Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information, Focused and Synthetic Nested Sequents, Inducing Syntactic Cut-Elimination for Indexed Nested Sequents, Deep Inference in Bi-intuitionistic Logic, Syntactic cut-elimination for common knowledge, Syntactic Cut-elimination for Common Knowledge, A general proof certification framework for modal logic, A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY
Cites Work
