On the public citation graph

Modularisation of Sequent Calculi for Normal and Non-normal Modalities

https://doi.org/10.1145/3288757
0 signed · 78 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/11591191_25openalex-snapshot
On the Specification of Sequent Systems
inferredcites →https://doi.org/10.1007/3-540-44802-0_5openalex-snapshot
Non-commutativity and MELL in the Calculus of Structures
inferredcites →https://doi.org/10.1007/978-1-4020-9084-4_3openalex-snapshot
The Method of Tree-Hypersequents for Modal Propositional Logic
inferredcites →https://doi.org/10.1007/978-1-4757-3208-5openalex-snapshot
Labelled Non-Classical Logics
inferredcites →https://doi.org/10.1007/978-3-0346-0145-0_16openalex-snapshot
Semantical Considerations on Modal Logic
inferredcites →https://doi.org/10.1007/978-3-319-08615-6_11openalex-snapshot
Proof Analysis in Deontic Logics
inferredcites →https://doi.org/10.1007/978-3-319-24312-2_10openalex-snapshot
Linear Nested Sequents, 2-Sequents and Hypersequents
inferredcites →https://doi.org/10.1007/978-3-319-27683-0_1openalex-snapshot
Modal Logics with Hard Diamond-Free Fragments
inferredcites →https://doi.org/10.1007/978-3-642-36039-8_14openalex-snapshot
Constructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic
inferredcites →https://doi.org/10.1007/978-3-642-37075-5_14openalex-snapshot
Cut Elimination in Nested Sequents for Intuitionistic Modal Logics
inferredcites →https://doi.org/10.1007/978-3-662-48899-7_19openalex-snapshot
Focused Labeled Proof Systems for Modal Logic
inferredcites →https://doi.org/10.1007/978-3-662-48899-7_39openalex-snapshot
Proof Search in Nested Sequent Calculi
inferredcites →https://doi.org/10.1007/978-3-662-49630-5_23openalex-snapshot
Focused and Synthetic Nested Sequents
inferredcites →https://doi.org/10.1007/978-94-010-0387-2_2openalex-snapshot
Sequent Systems for Modal Logics
inferredcites →https://doi.org/10.1007/bf01053026openalex-snapshot
Cut-free sequent calculi for some tense logics
inferredcites →https://doi.org/10.1007/bfb0022564openalex-snapshot
The structure of exponentials: Uncovering the dynamics of linear logic proofs
inferredcites →https://doi.org/10.1007/s00153-009-0137-3openalex-snapshot
Deep sequent systems for modal logic
inferredcites →https://doi.org/10.1007/s10817-010-9182-1openalex-snapshot
A Framework for Proof Systems
inferredcites →https://doi.org/10.1007/s10992-005-2267-3openalex-snapshot
Proof Analysis in Modal Logic
inferredcites →https://doi.org/10.1007/s11225-014-9556-1openalex-snapshot
Modular Sequent Calculi for Classical Modal Logics
inferredcites →https://doi.org/10.1016/0168-0072(92)90029-yopenalex-snapshot
2-Sequent calculus: a proof theory of modalities
inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1016/j.apal.2011.09.004openalex-snapshot
Prefixed tableaus and nested sequents
inferredcites →https://doi.org/10.1016/j.ic.2011.10.003openalex-snapshot
Cut-free Gentzen calculus for multimodal CK
inferredcites →https://doi.org/10.1016/j.tcs.2006.03.009openalex-snapshot
Justified common knowledge
inferredcites →https://doi.org/10.1016/j.tcs.2009.07.041openalex-snapshot
Focusing and polarization in linear, intuitionistic, and classical logics
inferredcites →https://doi.org/10.1016/j.tcs.2012.12.008openalex-snapshot
A formal framework for specifying sequent calculus proof systems
inferredcites →https://doi.org/10.1016/j.tcs.2017.06.009openalex-snapshot
On subexponentials, focusing and modalities in concurrent systems
inferredcites →https://doi.org/10.1016/s0049-237x(08)70822-xopenalex-snapshot
3. Investigations into Logical Deduction
inferredcites →https://doi.org/10.1017/9781316755921.010openalex-snapshot
Linear logic as a framework for specifying sequent calculus
inferredcites →https://doi.org/10.1017/bsl.2016.2openalex-snapshot
LINEAR TIME IN HYPERSEQUENT FRAMEWORK
inferredcites →https://doi.org/10.1017/cbo9781139003513openalex-snapshot
Proof Analysis
inferredcites →https://doi.org/10.1023/a:1006155811656openalex-snapshot
Single Step Tableaux for Modal Logics
inferredcites →https://doi.org/10.1023/a:1026753129680openalex-snapshot
Sequent Calculi and Decision Procedures for Weak Modal Systems
inferredcites →https://doi.org/10.1080/11663081.2015.1080422openalex-snapshot
Non-normal modalities in variants of linear logic
inferredcites →https://doi.org/10.1093/jigpal/6.5.735openalex-snapshot
An analysis of (linear) exponentials based on extended sequents
inferredcites →https://doi.org/10.1093/logcom/2.3.297openalex-snapshot
Logic Programming with Focusing Proofs in Linear Logic
inferredcites →https://doi.org/10.1093/logcom/exu029openalex-snapshot
An extended framework for specifying and reasoning about proof systems
inferredcites →https://doi.org/10.1093/logcom/exu037openalex-snapshot
Proof analysis beyond geometric theories: from rule systems to systems of rules
inferredcites →https://doi.org/10.1093/oso/9780198538622.003.0001openalex-snapshot
The Method of Hypersequents in the Proof Theory of Propositional Non-classical Logics
inferredcites →https://doi.org/10.1109/lics.2017.8005089openalex-snapshot
Dual-Context Calculi for Modal Logic
inferredcites →https://doi.org/10.1145/3288757openalex-snapshot
Modularisation of Sequent Calculi for Normal and Non-normal Modalities
inferredcites →https://doi.org/10.1215/00294527-2377869openalex-snapshot
Nested Sequents for Intuitionistic Logics
inferredcites →https://doi.org/10.18778/0138-0680.46.1.2.10openalex-snapshot
Cut Elimination Theorem for Non-Commutative Hypersequent Calculus
inferredcites →https://doi.org/10.18910/6054openalex-snapshot
Gentzen method in modal calculi
inferredcites →https://doi.org/10.21236/ada065502openalex-snapshot
On the Model Theory of Knowledge
inferredcites →https://doi.org/10.4230/lipics.fscd.2016.16openalex-snapshot
Modular Focused Proof Systems for Intuitionistic Modal Logics

What points at this work

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

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_13openalex-snapshot
On Combinatorial Proofs for Modal Logic
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_3openalex-snapshot
Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics
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_9openalex-snapshot
From Input/Output Logics to Conditional Logics via Sequents – with Provers
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_17openalex-snapshot
CoNP Complexity for Combinations of Non-normal Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_18openalex-snapshot
Resolution Calculi for Non-normal Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-031-45558-2_16openalex-snapshot
On the Finite Model Property of Non-normal 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-031-63501-4_12openalex-snapshot
Sequent Systems on Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-57669-4_3openalex-snapshot
A Semantical View of Proof Systems
inferred← citeshttps://doi.org/10.1007/s10992-019-09539-3openalex-snapshot
Intuitionistic Non-normal Modal Logics: A General Framework
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.08.008openalex-snapshot
A Fresh View of Linear Logic as a Logical Framework
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104756openalex-snapshot
Non-normal modal logics and conditional logics: Semantic analysis and proof theory
inferred← citeshttps://doi.org/10.1016/j.jlamp.2022.100827openalex-snapshot
A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems
inferred← citeshttps://doi.org/10.1017/s0960129522000366openalex-snapshot
A linear logic framework for multimodal logics
inferred← citeshttps://doi.org/10.1017/s1755020320000180openalex-snapshot
CUT-FREE COMPLETENESS FOR MODULAR HYPERSEQUENT CALCULI FOR MODAL LOGICS K, T, AND D
inferred← citeshttps://doi.org/10.1080/11663081.2023.2233750openalex-snapshot
Natural deduction calculi for classical and intuitionistic S5
inferred← citeshttps://doi.org/10.1093/logcom/exaa072openalex-snapshot
Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity
inferred← citeshttps://doi.org/10.1145/3461661openalex-snapshot
From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics
inferred← citeshttps://doi.org/10.1215/00294527-2024-0011openalex-snapshot
A Natural Deduction Calculus for S4.2
inferred← citeshttps://doi.org/10.12775/llp.2020.018openalex-snapshot
Sequent Calculi and Interpolation for Non-Normal Modal and Deontic Logics
inferred← citeshttps://doi.org/10.18778/0138-0680.2023.22openalex-snapshot
Cut Elimination for Extended Sequent Calculi
inferred← citeshttps://doi.org/10.29007/93qgopenalex-snapshot
A uniform framework for substructural logics with modalities
inferred← citeshttps://doi.org/10.48550/arxiv.1802.04704openalex-snapshot
Proof systems: from nestings to sequents and back
inferred← citeshttps://doi.org/10.5463/thesis.149openalex-snapshot
Semantically informed methods in structural proof theory
inferred← citeshttps://doi.org/10.70675/b09df5f2z3de1z4f5czab1dz82155f62a90bopenalex-snapshot
Non-normal modal logics : neighbourhood semantics and their calculi
showing the first 29 of 30 · page through all 30
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.