On the public citation graph
Modal tableau calculi and interpolation
0 signed · 94 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.19630090502openalex-snapshot
Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
inferredcites →https://doi.org/10.1007/978-3-322-85796-5openalex-snapshot
Klassische und nichtklassische Aussagenlogik
inferredcites →https://doi.org/10.1007/bf00249262openalex-snapshot
The modal logic of provability: Cut-elimination
inferredcites →https://doi.org/10.1007/bf00293433openalex-snapshot
The modal logic of provability. The sequential approach
inferredcites →https://doi.org/10.1007/bf00370323openalex-snapshot
A modal sequent calculus for a fragment of arithmetic
inferredcites →https://doi.org/10.1007/bf01673502openalex-snapshot
Interpolation theorems in modal logics and amalgamable varieties of topological Boolean algebras
inferredcites →https://doi.org/10.1007/bf02757006openalex-snapshot
Provability interpretations of modal logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)72008-1openalex-snapshot
Beth's Theorem and Self-Referential Sentences
inferredcites →https://doi.org/10.1111/j.1755-2567.1980.tb00686.xopenalex-snapshot
On systems of modal logic with provability interpretations
inferredcites →https://doi.org/10.2307/2271986openalex-snapshot
Model existence theorems for modal and intuitionistic logics
inferredcites →https://doi.org/10.2307/2273755openalex-snapshot
On the proof theory of the modal logic for arithmetic provability
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19860320707openalex-snapshot
A Syntactic Proof of Cut‐Elimination For GL lin
inferred← citeshttps://doi.org/10.1007/10722086_27openalex-snapshot
Sequent-Like Tableau Systems with the Analytic Superformula Property for the Modal Logics KB, KDB, K5, KD5
inferred← citeshttps://doi.org/10.1007/11554554_12openalex-snapshot
A Tableau Calculus with Automaton-Labelled Formulae for Regular Grammar Logics
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_15openalex-snapshot
Analytic Tableau Systems for Propositional Bimodal Logics of Knowledge and Belief
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-48340-3_29openalex-snapshot
A New Space Bound for the Modal Logics K4, KD4 and S4
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_24openalex-snapshot
Tableau Calculi for Hybrid Logics
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_30openalex-snapshot
Refutation systems for prepositional modal logics
inferred← citeshttps://doi.org/10.1007/978-1-4419-1221-3_7openalex-snapshot
On the Theory of Self-Reference
inferred← citeshttps://doi.org/10.1007/978-3-031-82451-7_7openalex-snapshot
From Erotetic Calculi to Proofs. The Non-classical Cases
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_35openalex-snapshot
Explaining Subsumption by Optimal Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_1openalex-snapshot
Non Commutative Logic: A Survey (Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_10openalex-snapshot
A General Tableau Method for Propositional Interval Temporal Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-73099-6_12openalex-snapshot
EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-540-88833-8_15openalex-snapshot
Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_31openalex-snapshot
A Tableau Calculus for Regular Grammar Logics with Converse
inferred← citeshttps://doi.org/10.1007/978-3-642-04441-0_38openalex-snapshot
ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic $\mathcal{ALC}$
inferred← citeshttps://doi.org/10.1007/978-3-642-15034-0_2openalex-snapshot
Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic $\mathcal{SH}$
inferred← citeshttps://doi.org/10.1007/978-3-642-21916-0_50openalex-snapshot
Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic $\mathcal{ALCI}$
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-017-1754-0_6openalex-snapshot
Tableau Methods for Modal and Temporal Logics
inferred← citeshttps://doi.org/10.1007/bf00370331openalex-snapshot
Modal companions of intermediate propositional logics
inferred← citeshttps://doi.org/10.1007/bf00370682openalex-snapshot
Amalgamation and interpolation in normal modal logics
inferred← citeshttps://doi.org/10.1007/bf00370840openalex-snapshot
Cut-free tableau calculi for some propositional normal modal logics
inferred← citeshttps://doi.org/10.1007/bf00454742openalex-snapshot
How far can Hume's is-ought thesis be generalized?
inferred← citeshttps://doi.org/10.1007/bf00970916openalex-snapshot
Continuum of normal extensions of the modal logic of provability with the interpolation property
inferred← citeshttps://doi.org/10.1007/bf00971028openalex-snapshot
An analog of Beth's theorem in normal extensions of the modal logic K4
inferred← citeshttps://doi.org/10.1007/bf01057938openalex-snapshot
Cut-free sequent and tableau systems for propositional Diodorean modal logics
inferred← citeshttps://doi.org/10.1007/bf01158230openalex-snapshot
Provability logic without Craig's interpolation property
inferred← citeshttps://doi.org/10.1007/bf01982275openalex-snapshot
Interpolation in infinitely layered extensions of provability logic
inferred← citeshttps://doi.org/10.1007/bfb0021972openalex-snapshot
Efficient strategies for Automated reasoning in modal logics
inferred← citeshttps://doi.org/10.1007/s00153-020-00713-yopenalex-snapshot
Uniform Lyndon interpolation property in propositional modal logics
inferred← citeshttps://doi.org/10.1007/s10817-011-9243-0openalex-snapshot
EXPTIME tableaux for ALC using sound global caching
inferred← citeshttps://doi.org/10.1007/s10992-008-9089-zopenalex-snapshot
A Loop-Free Decision Procedure for Modal Propositional Logics K4, S4 and S5
inferred← citeshttps://doi.org/10.1007/s11225-006-8309-1openalex-snapshot
Projective Beth Property in Extensions of Grzegorczyk Logic
inferred← citeshttps://doi.org/10.1007/s11225-011-9341-3openalex-snapshot
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse
inferred← citeshttps://doi.org/10.1007/s11225-019-09865-2openalex-snapshot
Rosser Provability and Normal Modal Logics
inferred← citeshttps://doi.org/10.1007/s11229-008-9359-xopenalex-snapshot
Interpolation in non-classical logics
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.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.1016/j.jal.2005.06.012openalex-snapshot
A general tableau method for propositional interval temporal logics: Theory and implementation
inferred← citeshttps://doi.org/10.1016/s0168-0072(99)00007-xopenalex-snapshot
Lattices of modal logics and their groups of automorphisms
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80011-5openalex-snapshot
8 Modal consequence relations
inferred← citeshttps://doi.org/10.1016/s1574-6526(05)80022-7openalex-snapshot
Time in Qualitative Simulation
inferred← citeshttps://doi.org/10.1023/a:1013834410884openalex-snapshot
Analytic Tableau Systems and Interpolation for the Modal Logics KB, KDB, K5, KD5
inferred← citeshttps://doi.org/10.1023/a:1015726824270openalex-snapshot
Remarks on Gregory's “Actually” Operator
inferred← citeshttps://doi.org/10.1023/a:1016118411572openalex-snapshot
Tableaus with Invertible Rules for Many‐Valued Modal Propositional Logics
inferred← citeshttps://doi.org/10.1023/b:allo.0000035113.06412.22openalex-snapshot
Definability in Normal Extensions of S4
inferred← citeshttps://doi.org/10.1080/11663081.1995.10510844openalex-snapshot
Uniform and non uniform strategies for tableaux calculi for modal logics
inferred← citeshttps://doi.org/10.1080/11663081.1999.10510981openalex-snapshot
An empirical analysis of modal theorem provers
inferred← citeshttps://doi.org/10.1093/jigpal/jzi024openalex-snapshot
Hybrid logics with Sahlqvist axioms
inferred← citeshttps://doi.org/10.1093/jigpal/jzp040openalex-snapshot
Problem of restricted interpolation in superintuitionistic and some modal logics
inferred← citeshttps://doi.org/10.1093/logcom/11.6.879openalex-snapshot
Reducing Modal Consequence Relations
inferred← citeshttps://doi.org/10.1093/logcom/ext036openalex-snapshot
A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel–McKinsey–Tarski embedding
inferred← citeshttps://doi.org/10.1109/epia.2005.341259openalex-snapshot
On the modal logic of order-of-magnitude qualitative reasoning: a tableau calculus
inferred← citeshttps://doi.org/10.1109/kse.2009.12openalex-snapshot
An Optimal Tableau Decision Procedure for Converse-PDL
inferred← citeshttps://doi.org/10.1142/9789812776471_0007openalex-snapshot
Modal Logics with Weak Forms of Recursion: PSPACE Specimens
inferred← citeshttps://doi.org/10.1145/3597301openalex-snapshot
Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
inferred← citeshttps://doi.org/10.1305/ndjfl/1054837934openalex-snapshot
The Fixed Point Property in Modal Logic
inferred← citeshttps://doi.org/10.1609/aaai.v35i7.16770openalex-snapshot
Living Without Beth and Craig: Definitions and Interpolants in Description Logics with Nominals and Role Inclusions
inferred← citeshttps://doi.org/10.1613/jair.4057openalex-snapshot
Beth Definability in Expressive Description Logics
inferred← citeshttps://doi.org/10.2178/jsl/1052669059openalex-snapshot
Constructive interpolation in hybrid logic
inferred← citeshttps://doi.org/10.22028/d291-26295openalex-snapshot
Incremental decision procedures for modal logics with nominals and eventualities
inferred← citeshttps://doi.org/10.2307/2275127openalex-snapshot
European summer meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/2275330openalex-snapshot
Splittings and the finite model property
inferred← citeshttps://doi.org/10.2307/2275487openalex-snapshot
Properties of independently axiomatizable bimodal logics
inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c060openalex-snapshot
Proof-Theoretic Methods in Nonclassical Logic --an Introduction
inferred← citeshttps://doi.org/10.3166/jancl.21.61-91openalex-snapshot
Converse-PDL with regular inclusion axioms: a framework for MAS logics
inferred← citeshttps://doi.org/10.3233/fi-2000-42102openalex-snapshot
Constructing the Least Models for Positive Modal Logic Programs
inferred← citeshttps://doi.org/10.3233/fi-2009-115openalex-snapshot
Clausal Tableaux for Multimodal Logics of Belief
inferred← citeshttps://doi.org/10.48550/arxiv.0904.0721openalex-snapshot
Optimal Tableau Decision Procedures for PDL
inferred← citeshttps://doi.org/10.48550/arxiv.1104.0405openalex-snapshot
A Cut-Free ExpTime Tableau Decision Procedure for the Logic Extending Converse-PDL with Regular Inclusion Axioms
inferred← citeshttps://doi.org/10.48550/arxiv.1106.2305openalex-snapshot
Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic SHI
inferred← citeshttps://doi.org/10.48550/arxiv.1205.5838openalex-snapshot
ExpTime Tableaux for the Description Logic SHIQ Based on Global State Caching and Integer Linear Feasibility Checking
inferred← citeshttps://doi.org/10.48550/arxiv.1405.7221openalex-snapshot
ExpTime Tableaux with Global Caching for the Description Logic SHOQ
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-188openalex-snapshot
Beth Definability in Expressive Description 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.