On the public citation graph

Cut-free sequent calculi for some tense logics

https://doi.org/10.1007/bf01053026
0 signed · 110 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19920380107openalex-snapshot
CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT
inferredcites →https://doi.org/10.1007/978-3-7091-7664-1openalex-snapshot
Temporal Logic
inferredcites →https://doi.org/10.2977/prims/1195189814openalex-snapshot
A Study of Kripke-type Models for Some Modal Logics by Gentzen's Sequential Method

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10722086_26openalex-snapshot
The Mosaic Method for Temporal Logics
inferred← citeshttps://doi.org/10.1007/978-1-4020-9084-4_3openalex-snapshot
The Method of Tree-Hypersequents for Modal Propositional Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-20447-1_10openalex-snapshot
Through an Inference Rule, Darkly
inferred← citeshttps://doi.org/10.1007/978-3-030-29007-8_16openalex-snapshot
Two Is Enough – Bisequent Calculus for S5
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_10openalex-snapshot
A Hypersequent Calculus with Clusters for Data Logic over Ordinals
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_11openalex-snapshot
Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_12openalex-snapshot
Combining Monotone and Normal Modal Logic in Nested Sequents – with Countermodels
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_9openalex-snapshot
Sequentialising Nested Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-36755-8_12openalex-snapshot
On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-51054-1_25openalex-snapshot
MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description)
inferred← citeshttps://doi.org/10.1007/978-3-030-86059-2_17openalex-snapshot
A Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-86059-2_24openalex-snapshot
Nested Sequents for Intuitionistic Modal Logics via Structural Refinement
inferred← citeshttps://doi.org/10.1007/978-3-030-88853-4_24openalex-snapshot
A Pure View of Ecumenical Modalities
inferred← citeshttps://doi.org/10.1007/978-3-031-39784-4_20openalex-snapshot
Focus-Style Proofs for the Two-Way Alternation-Free $$\mu $$-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_24openalex-snapshot
Nested Sequents for Quantified Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-031-57635-5_11openalex-snapshot
Nested Sequents or Tree-Hypersequents—A Survey
inferred← citeshttps://doi.org/10.1007/978-3-032-06085-3_13openalex-snapshot
Improved Decision Procedures for Multi-modal Tense Logic Using CEGAR-Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-032-06085-3_21openalex-snapshot
Justification Logic for Intuitionistic Modal Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_39openalex-snapshot
NESCOND: An Implementation of Nested Sequent Calculi for Conditional Logics
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_29openalex-snapshot
Inducing Syntactic Cut-Elimination for Indexed Nested Sequents
inferred← citeshttps://doi.org/10.1007/978-3-319-47843-2_13openalex-snapshot
On Height and Happiness
inferred← citeshttps://doi.org/10.1007/978-3-319-62864-6_18openalex-snapshot
The Proof Theory of Common Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-319-66902-1_5openalex-snapshot
Proof Theory for Indexed Nested Sequents
inferred← citeshttps://doi.org/10.1007/978-3-319-72056-2_8openalex-snapshot
From Display to Labelled Proofs for Tense Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-02261-6_26openalex-snapshot
Deep Inference in Bi-intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-02716-1_12openalex-snapshot
Modular Sequent Systems for Modal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-02716-1_15openalex-snapshot
Taming Displayed Tense Logics Using Nested Sequents with Deep Inference
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_13openalex-snapshot
How to Universally Close the Existential Rule
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_14openalex-snapshot
Cut Elimination in Nested Sequents for Intuitionistic Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-662-44602-7_20openalex-snapshot
From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_23openalex-snapshot
Focused and Synthetic Nested Sequents
inferred← citeshttps://doi.org/10.1007/978-3-662-55665-8_16openalex-snapshot
Axiomatizing Epistemic Logic of Friendship via Tree Sequent Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_2openalex-snapshot
An Infinitary Treatment of Full Mu-Calculus
inferred← citeshttps://doi.org/10.1007/978-90-481-8785-0_7openalex-snapshot
Beyond Basic Logics and Standard Systems
inferred← citeshttps://doi.org/10.1007/978-90-481-8785-0_9openalex-snapshot
Logics of Linear Frames
inferred← citeshttps://doi.org/10.1007/978-90-481-9670-8_6openalex-snapshot
On the Tree-Hypersequent Calculi
inferred← citeshttps://doi.org/10.1007/978-94-010-0387-2_2openalex-snapshot
Sequent Systems for Modal Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-0454-0_2openalex-snapshot
Advanced Modal Logic
inferred← citeshttps://doi.org/10.1007/s00153-009-0137-3openalex-snapshot
Deep sequent systems for modal logic
inferred← citeshttps://doi.org/10.1007/s10670-024-00823-6openalex-snapshot
Beyond Semantic Pollution: Towards a Practice-Based Philosophical Analysis of Labelled Calculi
inferred← citeshttps://doi.org/10.1007/s10817-023-09677-zopenalex-snapshot
Mechanising Gödel–Löb Provability Logic in HOL Light
inferred← citeshttps://doi.org/10.1007/s10992-021-09639-zopenalex-snapshot
Higher-level Inferences in the Strong-Kleene Setting: A Proof-theoretic Approach
inferred← citeshttps://doi.org/10.1007/s10992-026-09838-6openalex-snapshot
Metainferences, Invalidities and Contraction-Free Sequent Calculi for S5 and Carnap’s C
inferred← citeshttps://doi.org/10.1007/s10992-026-09853-7openalex-snapshot
A Formal Characterization of Semantic Pollution of Modal Proof Systems
inferred← citeshttps://doi.org/10.1007/s11225-014-9566-zopenalex-snapshot
Hypersequent and Display Calculi – a Unified Perspective
inferred← citeshttps://doi.org/10.1007/s11225-014-9567-yopenalex-snapshot
A Survey of Nonstandard Sequent Calculi
inferred← citeshttps://doi.org/10.1007/s11229-008-9425-4openalex-snapshot
Display calculi and other modal calculi: a comparison
inferred← citeshttps://doi.org/10.1007/s11229-019-02226-5openalex-snapshot
An ecumenical notion of entailment
inferred← citeshttps://doi.org/10.1007/s11787-014-0097-1openalex-snapshot
Proofs and Countermodels in Non-Classical Logics
inferred← citeshttps://doi.org/10.1016/j.apal.2009.01.014openalex-snapshot
Syntactic cut-elimination for common knowledge
inferred← citeshttps://doi.org/10.1016/j.apal.2012.04.006openalex-snapshot
Syntactic cut-elimination for a fragment of the modal mu-calculus
inferred← citeshttps://doi.org/10.1016/j.apal.2018.08.007openalex-snapshot
Multicomponent proof-theoretic method for proving interpolation properties
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.038openalex-snapshot
Syntactic Cut-elimination for Common Knowledge
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.102openalex-snapshot
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.08.011openalex-snapshot
Algebra, Proof Theory and Applications for a Logic of Propositions, Actions and Adjoint Modal Operators
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.10.004openalex-snapshot
Hypersequent rules with restricted contexts for propositional modal logics
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80014-0openalex-snapshot
11 Temporal logic
inferred← citeshttps://doi.org/10.1017/bsl.2016.2openalex-snapshot
LINEAR TIME IN HYPERSEQUENT FRAMEWORK
inferred← citeshttps://doi.org/10.1017/s0960129518000440openalex-snapshot
A general proof certification framework for modal logic
inferred← citeshttps://doi.org/10.1017/s0960129522000366openalex-snapshot
A linear logic framework for multimodal logics
inferred← citeshttps://doi.org/10.1017/s1755020309990244openalex-snapshot
A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY
inferred← citeshttps://doi.org/10.1017/s1755020310000134openalex-snapshot
POSITIVE LOGIC WITH ADJOINT MODALITIES: PROOF THEORY, SEMANTICS, AND REASONING ABOUT INFORMATION
inferred← citeshttps://doi.org/10.1023/b:stud.0000009565.98020.9bopenalex-snapshot
A Labelled Natural Deduction System for Linear Temporal Logic
inferred← citeshttps://doi.org/10.1080/11663081.2023.2178780openalex-snapshot
Provability multilattice logic
inferred← citeshttps://doi.org/10.1080/11663081.2023.2233346openalex-snapshot
Nested sequents for intermediate logics: the case of Gödel-Dummett logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzv029openalex-snapshot
Nested sequents for provability logic GLP: FIG. 1.
inferred← citeshttps://doi.org/10.1093/logcom/exaa078openalex-snapshot
On the correspondence between nested calculi and semantic systems for intuitionistic logics
inferred← citeshttps://doi.org/10.1093/logcom/exab020openalex-snapshot
A fully labelled proof system for intuitionistic modal logics
inferred← citeshttps://doi.org/10.1093/logcom/exae058openalex-snapshot
Separability and harmony in ecumenical systems
inferred← citeshttps://doi.org/10.1093/logcom/exm026openalex-snapshot
Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5
inferred← citeshttps://doi.org/10.1093/logcom/exm076openalex-snapshot
Editorial and call for papers
inferred← citeshttps://doi.org/10.1093/logcom/exu061openalex-snapshot
Embedding the hypersequent calculus in the display calculus
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00019openalex-snapshot
Interpolation for the two-way modal μ-calculus
inferred← citeshttps://doi.org/10.1111/j.1747-9991.2011.00418.xopenalex-snapshot
Proof Theory for Modal Logic
inferred← citeshttps://doi.org/10.1145/2429069.2429095openalex-snapshot
A theorem prover for Boolean BI
inferred← citeshttps://doi.org/10.1145/2480359.2429095openalex-snapshot
A theorem prover for Boolean BI
inferred← citeshttps://doi.org/10.1145/2536740.2536742openalex-snapshot
Algebra, proof theory and applications for an intuitionistic logic of propositions, actions and adjoint modal operators
inferred← citeshttps://doi.org/10.1145/2874775openalex-snapshot
Power and Limits of Structural Display Rules
inferred← citeshttps://doi.org/10.1145/3288757openalex-snapshot
Modularisation of Sequent Calculi for Normal and Non-normal Modalities
inferred← citeshttps://doi.org/10.1145/3460492openalex-snapshot
Display to Labeled Proofs and Back Again for Tense Logics
inferred← citeshttps://doi.org/10.1215/00294527-2377869openalex-snapshot
Nested Sequents for Intuitionistic Logics
inferred← citeshttps://doi.org/10.12775/llp.2025.009openalex-snapshot
Nested Sequent Calculi for Some Modal Logics with Non-Standard Modalities
inferred← citeshttps://doi.org/10.18778/0138-0680.2025.02openalex-snapshot
Internal and External Calculi: Ordering the Jungle without Being Lost in Translations
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:7)2015openalex-snapshot
On Nested Sequents for Constructive Modal Logics
inferred← citeshttps://doi.org/10.2168/lmcs-7(2:8)2011openalex-snapshot
On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
inferred← citeshttps://doi.org/10.23638/lmcs-14(4:18)2018openalex-snapshot
Inducing syntactic cut-elimination for indexed nested sequents
inferred← citeshttps://doi.org/10.2478/slgr-2024-0014openalex-snapshot
Gentzen and Temporal Sequents
inferred← citeshttps://doi.org/10.24963/kr.2022/26openalex-snapshot
Automating Reasoning with Standpoint Logic via Nested Sequents
inferred← citeshttps://doi.org/10.25911/5d5fcc3a4db33openalex-snapshot
Proof theory and proof search of bi-intuitionistic and tense logic
inferred← citeshttps://doi.org/10.25911/5d626d13dfdbfopenalex-snapshot
Cut-elimination for provability logics and some results in display logic
inferred← citeshttps://doi.org/10.3233/ia-150082openalex-snapshot
Nested sequent calculi and theorem proving for normal conditional logics: The theorem prover NESCOND
inferred← citeshttps://doi.org/10.3390/axioms12070620openalex-snapshot
Cut-Free Gentzen Sequent Calculi for Tense Logics
inferred← citeshttps://doi.org/10.4204/eptcs.415.11openalex-snapshot
Syntactic Cut-Elimination for Provability Logic GL via Nested Sequents
inferred← citeshttps://doi.org/10.4204/eptcs.415.7openalex-snapshot
Nested-sequent Calculus for Modal Logic MB
inferred← citeshttps://doi.org/10.4230/lipics.csl.2013.197openalex-snapshot
Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic
inferred← citeshttps://doi.org/10.4230/lipics.csl.2020.28openalex-snapshot
Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents
inferred← citeshttps://doi.org/10.4230/lipics.csl.2025.42openalex-snapshot
Refining Labelled Systems for Modal and Constructive Logics with Applications
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2018.15openalex-snapshot
A Hypersequent Calculus with Clusters for Tense Logic over Ordinals
inferred← citeshttps://doi.org/10.48550/arxiv.0903.2448openalex-snapshot
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information
inferred← citeshttps://doi.org/10.48550/arxiv.1006.4793openalex-snapshot
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1204.2413openalex-snapshot
Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures
inferred← citeshttps://doi.org/10.48550/arxiv.1307.0289openalex-snapshot
Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic -- Extended Version
inferred← citeshttps://doi.org/10.48550/arxiv.1907.01270openalex-snapshot
Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version)
inferred← citeshttps://doi.org/10.70675/406e0badzf997z4146z91f1z22e8aba9a066openalex-snapshot
Unusual proof systems for modal logics with applications to decision problems
inferred← citeshttps://doi.org/10.70675/9574fbc5zea00z4774zbd87zee73ba8839a2openalex-snapshot
Logique de requêtes à la XPath : systèmes de preuve et pertinence pratique
inferred← citeshttps://doi.org/10.70675/ce9d0e11zd180z43dczb25dzb8f4ec4c461bopenalex-snapshot
Structures multi-contextuelles et logiques modales intuititionnistes et hybrides
inferred← citeshttps://doi.org/10.70675/d25fa491z4ac5z43c0z8632z2ce9c78e05beopenalex-snapshot
On the proof theory of conditional logics
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.