On the public citation graph

Generalized tableau systems for intermediate propositional logics

https://doi.org/10.1007/bfb0027404
0 signed · 29 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.1007/3-540-59338-1_30openalex-snapshot
Refutation systems for prepositional modal logics
inferredcites →https://doi.org/10.1007/978-94-017-2977-2openalex-snapshot
Semantical Investigations in Heyting’s Intuitionistic Logic
inferredcites →https://doi.org/10.1007/bf00881949openalex-snapshot
An improved refutation system for intuitionistic predicate logic
inferredcites →https://doi.org/10.1007/bf01053063openalex-snapshot
The simple substitution property of the intermediate propositional logics on finite slices
inferredcites →https://doi.org/10.1007/bf01277484openalex-snapshot
An infinite class of maximal intermediate propositional logics with the disjunction property
inferredcites →https://doi.org/10.1007/bf01988049openalex-snapshot
Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül
inferredcites →https://doi.org/10.1007/bfb0066744openalex-snapshot
Applications of Kripke models
inferredcites →https://doi.org/10.1016/0168-0072(94)00052-5openalex-snapshot
A method to single out maximal propositional logics with the disjunction property II
inferredcites →https://doi.org/10.1016/0168-0072(94)00053-6openalex-snapshot
A method to single out maximal propositional logics with the disjunction property I
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7038-7openalex-snapshot
Intuitionistic Logic Model Theory and Forcing
inferredcites →https://doi.org/10.1016/s1385-7258(52)50028-3openalex-snapshot
On the intuitionistic theory of deduction
inferredcites →https://doi.org/10.1093/jigpal/5.1.145openalex-snapshot
Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic
inferredcites →https://doi.org/10.1093/logcom/3.1.63openalex-snapshot
An O(n log n)-Space Decision Procedure for Intuitionistic Propositional Logic
inferredcites →https://doi.org/10.2307/2270700openalex-snapshot
The decidability of the Kreisel-Putnam system
inferredcites →https://doi.org/10.2307/2272344openalex-snapshot
A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property
inferredcites →https://doi.org/10.2307/2275149openalex-snapshot
Counting the maximal intermediate constructive logics
inferredcites →https://doi.org/10.2307/2275431openalex-snapshot
Contraction-free sequent calculi for intuitionistic logic
inferredcites →https://doi.org/10.2977/prims/1195193915openalex-snapshot
Kripke Models and Intermediate Logics
inferredcites →https://doi.org/10.3792/pja/1195521836openalex-snapshot
A series of successive modifications of Peirce's rule

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45616-3_9openalex-snapshot
Tableau Calculi for the Logics of Finite k-Ary Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_5openalex-snapshot
SAT-Based Proof Search in Intermediate Propositional Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-21070-9_3openalex-snapshot
Synthesising Terminating Tableau Calculi for Relational Logics
inferred← citeshttps://doi.org/10.1016/j.ins.2010.06.004openalex-snapshot
Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus
inferred← citeshttps://doi.org/10.1017/jsl.2021.42openalex-snapshot
BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
inferred← citeshttps://doi.org/10.1023/a:1022981105345openalex-snapshot
Preface. In Memoriam Pierangelo Miglioli (1946–1999)
inferred← citeshttps://doi.org/10.1093/jigpal/9.1.1openalex-snapshot
How to avoid the formal verification of a theorem prover
inferred← citeshttps://doi.org/10.2168/lmcs-7(2:6)2011openalex-snapshot
Automated Synthesis of Tableau Calculi
inferred← citeshttps://doi.org/10.29007/dhz5openalex-snapshot
Tableau Calculus for Dummett Logic Based on Present and Next State of Knowledge
inferred← citeshttps://doi.org/10.29007/mbbqopenalex-snapshot
Fast Decision Procedure for Propositional Dummett Logic Based on a Multiple Premise Tableau Calculus
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.