On the public citation graph
Cut-free sequent and tableau systems for propositional Diodorean modal logics
0 signed · 45 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.1002/malq.19860320707openalex-snapshot
A Syntactic Proof of Cut‐Elimination For GL lin
inferredcites →https://doi.org/10.1007/978-94-017-2794-5openalex-snapshot
Proof Methods for Modal and Intuitionistic Logics
inferredcites →https://doi.org/10.1007/bf00249258openalex-snapshot
Modal tableau calculi and interpolation
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1111/j.1468-0149.1969.tb00005.xopenalex-snapshot
AN INTRODUCTION TO MODAL LOGIC
inferredcites →https://doi.org/10.1111/j.1755-2567.1978.tb00170.xopenalex-snapshot
Transitivity follows from Dummett's axiom
inferredcites →https://doi.org/10.2307/2270582openalex-snapshot
An algebraic study of Diodorean modal systems
inferredcites →https://doi.org/10.2307/2271879openalex-snapshot
J. Jay Zeman. Modal logic. The Lewis-modal systems. Clarendon Press, Oxford1973, x + 302 pp.
inferredcites →https://doi.org/10.2307/2274341openalex-snapshot
Melvin Fitting. Proof methods for modal and intuitionistic logics. Synthese library, vol. 169. D. Reidel Publishing Company, Dordrecht, Boston, and Lancaster, 1983, viii + 555 pp.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2001.3094openalex-snapshot
The Complexity of Propositional Linear Temporal Logics in Simple Cases
inferred← citeshttps://doi.org/10.1007/10722086_26openalex-snapshot
The Mosaic Method for Temporal Logics
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-58156-1_52openalex-snapshot
Strongly analytic tableaux for normal modal logics
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_12openalex-snapshot
A simple tableau system for the logic of elsewhere
inferred← citeshttps://doi.org/10.1007/3-540-63912-8_79openalex-snapshot
Modal tableaux for reasoning about actions and plans
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_28openalex-snapshot
A New One-Pass Tableau Calculus for PLTL
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-642-40537-2_19openalex-snapshot
Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5
inferred← citeshttps://doi.org/10.1007/978-3-642-40537-2_6openalex-snapshot
Bounded Proofs and Step Frames
inferred← citeshttps://doi.org/10.1007/978-90-481-8785-0_6openalex-snapshot
Standard Approach to Basic Modal Logics
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-9670-8_2openalex-snapshot
Modal Logic and Ordinary Sequent 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-1754-0_11openalex-snapshot
A Bibliography on Analytic Tableaux Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_6openalex-snapshot
Tableau Methods for Modal and Temporal Logics
inferred← citeshttps://doi.org/10.1007/bf00370840openalex-snapshot
Cut-free tableau calculi for some propositional normal modal logics
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.05.027openalex-snapshot
Admissibility of Cut in Coalgebraic Logics
inferred← citeshttps://doi.org/10.1016/j.ic.2009.11.008openalex-snapshot
Cut elimination in coalgebraic logics
inferred← citeshttps://doi.org/10.1023/a:1005291931660openalex-snapshot
On an Intuitionistic Modal Logic
inferred← citeshttps://doi.org/10.1109/lics.2013.47openalex-snapshot
From Frame Properties to Hypersequent Rules in Modal Logics
inferred← citeshttps://doi.org/10.1145/1071596.1071599openalex-snapshot
Disjunction and modular goal-directed proof search
inferred← citeshttps://doi.org/10.15388/lmr.2009.48openalex-snapshot
A method of marks and indices for linear modal logic
inferred← citeshttps://doi.org/10.47749/t/unicamp.2004.305159openalex-snapshot
Um modelo de desenvolvimento de sistemas para suporte a cooperação fundamentado em design participativo e semiotica organizacional
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0104021openalex-snapshot
Disjunction and modular goal-directed proof search
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.