On the public citation graph
Display logic
0 signed · 230 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4020-4108-2_9openalex-snapshot
Backwards-Looking Operators in Tense Logic and in Natural Language
inferredcites →https://doi.org/10.1007/978-94-009-8356-4_13openalex-snapshot
Entailment and the disjunctive syllogism
inferredcites →https://doi.org/10.1007/978-94-009-9825-4openalex-snapshot
Essays on Mathematical and Philosophical Logic
inferredcites →https://doi.org/10.1007/bf00262861openalex-snapshot
A consecutive calculus for positive relevant implication with necessity
inferredcites →https://doi.org/10.1007/bf00373152openalex-snapshot
Intuitive semantics for first-degree entailments and ?coupled trees?
inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1111/j.1468-0149.1973.tb01528.xopenalex-snapshot
MODAL LOGIC: THE LEWIS‐MODAL SYSTEMS
inferredcites →https://doi.org/10.2307/2273355openalex-snapshot
A cut-free Gentzen-type system for the modal logic S5
inferredcites →https://doi.org/10.2307/2273727openalex-snapshot
Failures of the interpolation lemma in quantified modal logic
inferredcites →https://doi.org/10.2307/2964179openalex-snapshot
New foundations for Lewis modal systems
inferredcites →https://doi.org/10.2307/2964754openalex-snapshot
Modalities in Ackermann's “rigorous implication”
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470996751.ch29openalex-snapshot
Proofs and Expressiveness in Alethic Modal Logic
inferred← citeshttps://doi.org/10.1002/9781444395037.ch6openalex-snapshot
Multi‐Modal Type‐Logical Grammar
inferred← citeshttps://doi.org/10.1007/10722086_21openalex-snapshot
Dual Intuitionistic Logic Revisited
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_10openalex-snapshot
Formalised Cut Admissibility for Display Logic
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_11openalex-snapshot
Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_10openalex-snapshot
An $$ \mathcal{O} $$ ((n · log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_2openalex-snapshot
Tractable Transformations from Modal Provability Logics into First-Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_16openalex-snapshot
Cut-Free Display Calculi for Nominal Tense Logics
inferred← citeshttps://doi.org/10.1007/3-540-49545-2_18openalex-snapshot
A Mechanised Proof System for Relation Algebra Using Display Logic
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_40openalex-snapshot
Cut-free display calculi for relation algebras
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-36755-8_11openalex-snapshot
Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents
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-71258-7_7openalex-snapshot
R-Mingle is Nice, and so is Arnon Avron
inferred← citeshttps://doi.org/10.1007/978-3-030-76920-8_5openalex-snapshot
An Algebraic Glimpse at Bunched Implications and Separation Logic
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-031-10769-6_27openalex-snapshot
Non-associative, Non-commutative Multi-modal Linear Logic
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-43513-3_6openalex-snapshot
Some Analytic Systems of Rules
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-57635-5_14openalex-snapshot
Substructural Negations as Normal Modal Operators
inferred← citeshttps://doi.org/10.1007/978-3-031-63501-4_10openalex-snapshot
Sequents vs Hypersequents for Åqvist Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-69940-5_1openalex-snapshot
Introduction: Directions and New Directions
inferred← citeshttps://doi.org/10.1007/978-3-031-69940-5_12openalex-snapshot
Fusion, Fission, and Ackermann’s Truth Constant in Relevant Logics: A Proof-Theoretic Investigation
inferred← citeshttps://doi.org/10.1007/978-3-032-06085-3_12openalex-snapshot
Analytic Proofs for Tense Logic
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-11027-5_13openalex-snapshot
Recapturing Structural Properties with a Consistency Operator
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_23openalex-snapshot
Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-29198-7_5openalex-snapshot
Machine-Checked Proof-Theory for Propositional Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_31openalex-snapshot
Machine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi
inferred← citeshttps://doi.org/10.1007/978-3-319-66902-1_3openalex-snapshot
On the Decidability of Certain Semi-Lattice Based Modal Logics
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-319-94821-8_4openalex-snapshot
Software Tool Support for Modular Reasoning in Modal Logics of Actions
inferred← citeshttps://doi.org/10.1007/978-3-540-30597-2_9openalex-snapshot
Relevant Logic and Paraconsistency
inferred← citeshttps://doi.org/10.1007/978-3-540-73099-6_13openalex-snapshot
Tree-Sequent Methods for Subintuitionistic Predicate Logics
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-22119-4_9openalex-snapshot
Craig Interpolation in Displayable Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-22221-4_3openalex-snapshot
Polarized Classical Non-associative Lambek Calculus and Formal Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-31482-7_24openalex-snapshot
Polarities in Logic and Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-39992-3_10openalex-snapshot
Structural Extensions of Display Calculi: A General Recipe
inferred← citeshttps://doi.org/10.1007/978-3-642-40948-6_11openalex-snapshot
Dynamic Epistemic Logic Displayed
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-52921-8_14openalex-snapshot
A Multi-type Calculus for Inquisitive Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-53826-5_9openalex-snapshot
Strong and Weak Quantifiers in Focused NL$$_{\text {CL}}$$
inferred← citeshttps://doi.org/10.1007/978-3-662-55386-2_11openalex-snapshot
Lattice Logic Properly Displayed
inferred← citeshttps://doi.org/10.1007/978-3-662-55947-5_1openalex-snapshot
Basic Postulates for Inconsistency Measures
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_1openalex-snapshot
On Combinatorial Proofs for Logics of Relevance and Entailment
inferred← citeshttps://doi.org/10.1007/978-3-7908-1828-4_10openalex-snapshot
Coping with Semilattices of Relations in Logics with Relative Accessibility Relations
inferred← citeshttps://doi.org/10.1007/978-90-481-9670-8_1openalex-snapshot
What Is a Good Sequent Calculus?
inferred← citeshttps://doi.org/10.1007/978-94-011-5108-5_21openalex-snapshot
Jaśkowski and Gentzen Approaches to Natural Deduction and Related Systems
inferred← citeshttps://doi.org/10.1007/978-94-011-5638-7_1openalex-snapshot
Recent Issues in Logic, Language and Computation
inferred← citeshttps://doi.org/10.1007/978-94-011-5638-7_8openalex-snapshot
Displaying as Temporalizing
inferred← citeshttps://doi.org/10.1007/978-94-017-0452-6_5openalex-snapshot
Advanced Many-Valued Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-2798-3_7openalex-snapshot
Power and Weakness of the Modal Display Calculus
inferred← citeshttps://doi.org/10.1007/978-94-017-2798-3_8openalex-snapshot
A Proof-Theoretic Proof of Functional Completeness for Many Modal and Tense Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-9673-6_22openalex-snapshot
Validity and Truth-Preservation
inferred← citeshttps://doi.org/10.1007/bf00296176openalex-snapshot
Solution to a problem of Ono and Komori
inferred← citeshttps://doi.org/10.1007/bf00394443openalex-snapshot
On purported Gentzen formulations of two positive relevent logics
inferred← citeshttps://doi.org/10.1007/bf00671566openalex-snapshot
Sequent-systems and groupoid models. I
inferred← citeshttps://doi.org/10.1007/bfb0038701openalex-snapshot
Hypothetical reasoning and definitional reflection in logic programming
inferred← citeshttps://doi.org/10.1007/bfb0095045openalex-snapshot
A mechanisation of classical modal tense logics using isabelle
inferred← citeshttps://doi.org/10.1007/s00153-009-0137-3openalex-snapshot
Deep sequent systems for modal logic
inferred← citeshttps://doi.org/10.1007/s00236-013-0186-2openalex-snapshot
Judgmental subtyping systems with intersection types and modal types
inferred← citeshttps://doi.org/10.1007/s10670-015-9792-4openalex-snapshot
Restall’s Proof-Theoretic Pluralism and Relevance Logic
inferred← citeshttps://doi.org/10.1007/s10670-020-00264-xopenalex-snapshot
A Hypersequent Solution to the Inferentialist Problem of Modality
inferred← citeshttps://doi.org/10.1007/s10849-006-0541-6openalex-snapshot
Types as Graphs: Continuations in Type Logical Grammar
inferred← citeshttps://doi.org/10.1007/s10992-010-9149-zopenalex-snapshot
Implications-as-Rules vs. Implications-as-Links: An Alternative Implication-Left Schema for the Sequent Calculus
inferred← citeshttps://doi.org/10.1007/s10992-015-9346-xopenalex-snapshot
Current Trends in Substructural Logics
inferred← citeshttps://doi.org/10.1007/s10992-018-9466-1openalex-snapshot
Disentangling Structural Connectives or Life Without Display Property
inferred← citeshttps://doi.org/10.1007/s10992-025-09820-8openalex-snapshot
Inductive Sequents for Distributive Modal Logic
inferred← citeshttps://doi.org/10.1007/s10992-026-09834-wopenalex-snapshot
Absolute Generality and Revision Theory
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-006-6605-4openalex-snapshot
Cut Elimination inside a Deep Inference System for Classical Predicate Logic
inferred← citeshttps://doi.org/10.1007/s11225-006-6607-2openalex-snapshot
Towards a Semantic Characterization of Cut-Elimination
inferred← citeshttps://doi.org/10.1007/s11225-012-9432-9openalex-snapshot
Cut-elimination for Weak Grzegorczyk Logic Go
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/s11225-014-9598-4openalex-snapshot
Normal Proofs, Cut Free Derivations and Structural Rules
inferred← citeshttps://doi.org/10.1007/s11225-016-9676-xopenalex-snapshot
Understanding Negation Implicationally in the Relevant Logic R
inferred← citeshttps://doi.org/10.1007/s11225-017-9778-0openalex-snapshot
Logicality, Double-Line Rules, and Modalities
inferred← citeshttps://doi.org/10.1007/s11225-020-09906-1openalex-snapshot
A Generalized Proof-Theoretic Approach to Logical Argumentation Based on Hypersequents
inferred← citeshttps://doi.org/10.1007/s11225-020-09920-3openalex-snapshot
A Cut-Elimination Proof in Positive Relevant Logic with Necessity
inferred← citeshttps://doi.org/10.1007/s11225-022-10003-8openalex-snapshot
A Proof-Theoretic Approach to Negative Translations in Intuitionistic Tense Logics
inferred← citeshttps://doi.org/10.1007/s11225-026-10239-8openalex-snapshot
A General Formalised Framework for Reasoning About Display Calculi
inferred← citeshttps://doi.org/10.1007/s11225-026-10247-8openalex-snapshot
Reduced Sequents in Modal Display 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-017-1353-8openalex-snapshot
Knowledge, belief, normality, and introspection
inferred← citeshttps://doi.org/10.1007/s11229-019-02474-5openalex-snapshot
The nature of entailment: an informational approach
inferred← citeshttps://doi.org/10.1007/s11787-010-0011-4openalex-snapshot
Some General Results About Proof Normalization
inferred← citeshttps://doi.org/10.1007/s11787-023-00328-wopenalex-snapshot
Rooted Hypersequent Calculus for Modal Logic S5
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90023-uopenalex-snapshot
Simple consequence relations
inferred← citeshttps://doi.org/10.1016/b978-0-444-51726-5.50012-1openalex-snapshot
THE STORIES OF LOGIC AND INFORMATION
inferred← citeshttps://doi.org/10.1016/b978-0-444-53726-3.00002-5openalex-snapshot
Categorial Type Logics
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50024-2openalex-snapshot
Connections in Nonclassical Logics
inferred← citeshttps://doi.org/10.1016/b978-044481714-3/50005-9openalex-snapshot
Categorial Type Logics
inferred← citeshttps://doi.org/10.1016/j.apal.2007.08.001openalex-snapshot
Sufficient conditions for cut elimination with complexity analysis
inferred← citeshttps://doi.org/10.1016/j.apal.2016.10.012openalex-snapshot
Algebraic proof theory: Hypersequents and hypercompletions
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103509openalex-snapshot
Universal proof theory: Semi-analytic rules and Craig interpolation
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.04.013openalex-snapshot
Mechanising the Alphabetised Relational Calculus
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.2010.08.012openalex-snapshot
A Unified Display Proof Theory for Bunched Logic
inferred← citeshttps://doi.org/10.1016/j.fss.2015.02.016openalex-snapshot
Proof search and Co-NP completeness for many-valued logics
inferred← citeshttps://doi.org/10.1016/j.fss.2018.05.007openalex-snapshot
Bilattice logic properly displayed
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.jal.2009.06.001openalex-snapshot
Combining linear-time temporal logic with constructiveness and paraconsistency
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.001openalex-snapshot
Proof theory of Nelson’s paraconsistent logic: A uniform perspective
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/s1571-0661(04)80880-6openalex-snapshot
Embedding Display Calculi into Logical Frameworks:
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)81004-1openalex-snapshot
A New Machine-checked Proof of Strong Normalisation for Display Logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01183-7openalex-snapshot
Logic Programming with Bunched Implications
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80030-0openalex-snapshot
Relevant and substructural logics
inferred← citeshttps://doi.org/10.1017/bsl.2016.2openalex-snapshot
LINEAR TIME IN HYPERSEQUENT FRAMEWORK
inferred← citeshttps://doi.org/10.1017/jsl.2021.42openalex-snapshot
BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
inferred← citeshttps://doi.org/10.1017/s1755020311000323openalex-snapshot
VALENTINI’S CUT-ELIMINATION FOR PROVABILITY LOGIC RESOLVED
inferred← citeshttps://doi.org/10.1017/s175502031700034xopenalex-snapshot
THE LOGIC OF RESOURCES AND CAPABILITIES
inferred← citeshttps://doi.org/10.1017/s1755020322000193openalex-snapshot
THE LOGIC OF HYPERLOGIC. PART A: FOUNDATIONS
inferred← citeshttps://doi.org/10.1023/a:1004947400860openalex-snapshot
Grafting Modalities onto Substructural Implication Systems
inferred← citeshttps://doi.org/10.1023/a:1005217827758openalex-snapshot
The Idea of a Proof-Theoretic Semantics and the Meaning of the Logical Operations
inferred← citeshttps://doi.org/10.1023/a:1005292130553openalex-snapshot
The Classification of Propositional Calculi
inferred← citeshttps://doi.org/10.1023/a:1008341521750openalex-snapshot
Display Calculi for Logics with Relative Accessibility Relations
inferred← citeshttps://doi.org/10.1023/a:1008359116755openalex-snapshot
Displaying Modal Logic, Heinrich Wansing
inferred← citeshttps://doi.org/10.1023/a:1013838528631openalex-snapshot
Ground and Free-Variable Tableaux for Variants of Quantified Modal Logics
inferred← citeshttps://doi.org/10.1023/a:1017948105274openalex-snapshot
Indexed systems of sequents and cut-elimination
inferred← citeshttps://doi.org/10.1023/b:jlli.0000024730.34743.faopenalex-snapshot
Analyzing the Core of Categorial Grammar
inferred← citeshttps://doi.org/10.1023/b:phil.0000019542.43440.d1openalex-snapshot
Two-Dimensional Adventures
inferred← citeshttps://doi.org/10.1057/9781137003720_4openalex-snapshot
Interpreting and Applying Proof Theories for Modal Logic
inferred← citeshttps://doi.org/10.1080/00048400701728574openalex-snapshot
Implicational Paradoxes and the Meaning of Logical Constants
inferred← citeshttps://doi.org/10.1080/11663081.2016.1179528openalex-snapshot
A comparison between monoidal and substructural logics
inferred← citeshttps://doi.org/10.1080/11663081.2018.1547513openalex-snapshot
Monoidal logics: completeness and classical systems
inferred← citeshttps://doi.org/10.1080/11663081.2018.1547515openalex-snapshot
Lattice logic as a fragment of (2-sorted) residuated modal logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzaa002openalex-snapshot
A note on the system GRW with the intensional contraction rule
inferred← citeshttps://doi.org/10.1093/jigpal/jzaf007openalex-snapshot
Gentzen-type sequent calculus for modal logic S5
inferred← citeshttps://doi.org/10.1093/jigpal/jzu009openalex-snapshot
A cut-free sequent calculus for relevant logic RW
inferred← citeshttps://doi.org/10.1093/jigpal/jzw005openalex-snapshot
Grafting hypersequents onto nested sequents
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/exq021openalex-snapshot
Cyclic Involutive Distributive Full Lambek Calculus is Decidable
inferred← citeshttps://doi.org/10.1093/logcom/ext018openalex-snapshot
Proof theory of witnessed Gödel logic: A negative result
inferred← citeshttps://doi.org/10.1093/logcom/ext035openalex-snapshot
Falsification, natural deduction and bi-intuitionistic logic
inferred← citeshttps://doi.org/10.1093/logcom/exu002openalex-snapshot
A substructural logic for layered graphs
inferred← citeshttps://doi.org/10.1093/logcom/exu061openalex-snapshot
Embedding the hypersequent calculus in the display calculus
inferred← citeshttps://doi.org/10.1093/logcom/exu063openalex-snapshot
A proof-theoretic semantic analysis of dynamic epistemic logic
inferred← citeshttps://doi.org/10.1093/logcom/exu064openalex-snapshot
Multi-type display calculus for propositional dynamic logic
inferred← citeshttps://doi.org/10.1093/logcom/exu068openalex-snapshot
Multi-type display calculus for dynamic epistemic logic
inferred← citeshttps://doi.org/10.1093/logcom/exw017openalex-snapshot
Special issue on substructural logic and information dynamics: introduction
inferred← citeshttps://doi.org/10.1093/logcom/exw022openalex-snapshot
Unified correspondence as a proof-theoretic tool
inferred← citeshttps://doi.org/10.1093/logcom/exx039openalex-snapshot
On the ‘transitivity’ of consequence relations
inferred← citeshttps://doi.org/10.1093/logcom/exz010openalex-snapshot
A bilateral Hilbert-style investigation of 2-intuitionistic logic
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175785openalex-snapshot
Cut-Restriction: From Cuts to Analytic Cuts
inferred← citeshttps://doi.org/10.1111/j.1747-9991.2011.00418.xopenalex-snapshot
Proof Theory for Modal Logic
inferred← citeshttps://doi.org/10.1145/1182613.1182614openalex-snapshot
A system of interaction and structure
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/2874775openalex-snapshot
Power and Limits of Structural Display Rules
inferred← citeshttps://doi.org/10.1145/3460492openalex-snapshot
Display to Labeled Proofs and Back Again for Tense Logics
inferred← citeshttps://doi.org/10.1145/3529255openalex-snapshot
Syntactic Completeness of Proper Display Calculi
inferred← citeshttps://doi.org/10.12775/llp.2015.018openalex-snapshot
Hypersequent Calculi for S5: The Methods of Cut Elimination
inferred← citeshttps://doi.org/10.12775/llp.2017.023openalex-snapshot
On Displaying Negative Modalities
inferred← citeshttps://doi.org/10.12775/llp.2019.031openalex-snapshot
On a multilattice analogue of a hypersequent S5 calculus
inferred← citeshttps://doi.org/10.12775/llp.2023.005openalex-snapshot
An Expressivist Strategy to Understand Logical Forms
inferred← citeshttps://doi.org/10.1287/isre.2016.0631openalex-snapshot
On the Ontological Quality and Logical Quality of Conceptual-Modeling Grammars: The Need for a Dual Perspective
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-2(2:4)2006openalex-snapshot
A System of Interaction and Structure II: The Need for Deep Inference
inferred← citeshttps://doi.org/10.2168/lmcs-6(3:3)2010openalex-snapshot
Classical BI: Its Semantics and Proof Theory
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.2178/bsl/1231081772openalex-snapshot
2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
inferred← citeshttps://doi.org/10.2178/jsl/1129642117openalex-snapshot
The geometry of non-distributive logics
inferred← citeshttps://doi.org/10.2307/2275375openalex-snapshot
Relational proof system for relevant logics
inferred← citeshttps://doi.org/10.2307/2275666openalex-snapshot
Gentzenizations of relevant logics without distribution. I
inferred← citeshttps://doi.org/10.2307/2275668openalex-snapshot
Gentzenizations of relevant logics with distribution
showing the first 200 of 213 · page through all 213
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.