On the public citation graph
Are tableaux an improvement on truth-tables?
0 signed · 90 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/3-540-54487-9_62openalex-snapshot
Towards an efficient tableau proof procedure for multiple-valued logics
inferredcites →https://doi.org/10.1007/978-1-4612-2360-3openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-1-4612-2822-6_22openalex-snapshot
Complexity of Proofs in Classical Propositional Logic
inferredcites →https://doi.org/10.1007/978-1-4684-0357-2openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-94-009-2356-0_12openalex-snapshot
Towards Feasible Solutions of the Tautology Problem
inferredcites →https://doi.org/10.1007/978-94-010-3269-8_7openalex-snapshot
On Machines Which Prove Theorems
inferredcites →https://doi.org/10.1007/bf00244513openalex-snapshot
HARP: A tableau-based theorem prover
inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1016/0003-4843(76)90020-6openalex-snapshot
Towards feasible solutions of the tautology problem
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7039-9openalex-snapshot
The Collected Papers of Gerhard Gentzen
inferredcites →https://doi.org/10.1109/ismvl.1991.130736openalex-snapshot
Uniform notation of tableau rules for multiple-valued logics
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/321607.321618openalex-snapshot
The Unit Proof and the Input Proof in Theorem Proving
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/800119.803893openalex-snapshot
On the lengths of proofs in the propositional calculus (Preliminary Version)
inferredcites →https://doi.org/10.2307/2273702openalex-snapshot
The relative efficiency of propositional proof systems
inferredcites →https://doi.org/10.2307/2274395openalex-snapshot
Systematization of finite many-valued logics through the method of tableaux
inferredcites →https://doi.org/10.2307/2274839openalex-snapshot
Jean-Yves Girard. Proof theory and logical complexity. Volume I. Studies in proof theory, no. 1. Bibliopolis, Naples 1987, also distributed by Humanities Press, Atlantic Highlands, N.J., 503 pp.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10703163_7openalex-snapshot
Quantifiers and the System KE: Some Surprising Results
inferred← citeshttps://doi.org/10.1007/10720246_8openalex-snapshot
SAT-Based Procedures for Temporal Reasoning
inferred← citeshttps://doi.org/10.1007/3-540-48315-2_13openalex-snapshot
A Context-Based Logic for Distributed Knowledge Representation and Reasoning
inferred← citeshttps://doi.org/10.1007/3-540-58495-1_54openalex-snapshot
BDDs and automated deduction
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_115openalex-snapshot
Building decision procedures for modal logics from propositional decision procedures — The case study of modal K
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_22openalex-snapshot
Simplification and Backjumping in Modal Tableau
inferred← citeshttps://doi.org/10.1007/978-1-4020-5571-3_11openalex-snapshot
The SAT-based Approach to Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_25openalex-snapshot
Synthetic Tableaux: Minimal Tableau Search Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-031-82451-7_6openalex-snapshot
From Erotetic Calculi to Proofs. The Classical Case
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_37openalex-snapshot
Entailment vs. Verification for Partial-Assignment Satisfiability and Enumeration
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_44openalex-snapshot
Polynomial Approximations of Full Propositional Logic via Limited Bivalence
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_33openalex-snapshot
Combining Sets with Elements
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_15openalex-snapshot
Complexity of Deep Inference via Atomic Flows
inferred← citeshttps://doi.org/10.1007/978-3-642-32621-9_24openalex-snapshot
Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics
inferred← citeshttps://doi.org/10.1007/978-94-011-4574-9_14openalex-snapshot
Transformation Methods in LDS
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_2openalex-snapshot
Tableau Methods for Classical Propositional Logic
inferred← citeshttps://doi.org/10.1007/bf00881958openalex-snapshot
A generalization of analytic deduction via labelled deductive systems. Part I: Basic substructural logics
inferred← citeshttps://doi.org/10.1007/bf01384237openalex-snapshot
Accelerating tableaux proofs using compact representations
inferred← citeshttps://doi.org/10.1007/bfb0027412openalex-snapshot
Non-elementary speed-ups in proof length by different variants of classical analytic calculi
inferred← citeshttps://doi.org/10.1007/s10817-005-9002-1openalex-snapshot
The SAT-based Approach to Separation Logic
inferred← citeshttps://doi.org/10.1007/s10992-023-09718-3openalex-snapshot
Abduction as Deductive Saturation: a Proof-Theoretic Inquiry
inferred← citeshttps://doi.org/10.1007/s11225-018-9795-7openalex-snapshot
Rasiowa–Sikorski Deduction Systems with the Rule of Cut: A Case Study
inferred← citeshttps://doi.org/10.1007/s11225-019-09847-4openalex-snapshot
Normality, Non-contamination and Logical Depth in Classical Natural Deduction
inferred← citeshttps://doi.org/10.1007/s11225-020-09904-3openalex-snapshot
Non-distributive Relatives of ETL and NFL
inferred← citeshttps://doi.org/10.1007/s13218-010-0008-4openalex-snapshot
A SAT Solver for Circuits Based on the Tableau Method
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50005-9openalex-snapshot
Tableaux and Related Methods
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50007-2openalex-snapshot
Normal Form Transformations
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50029-1openalex-snapshot
Combining Superposition, Sorts and Splitting
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.02.039openalex-snapshot
Hybrid Tableaux for the Difference Modality
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.11.007openalex-snapshot
Towards an Efficient Prover for the C1 Paraconsistent Logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.007openalex-snapshot
The universe of propositional approximations
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.02.014openalex-snapshot
Semantics and proof-theory of depth bounded Boolean logics
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.016openalex-snapshot
Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00005-1openalex-snapshot
Relative efficiency of propositional proof systems: resolution vs. cut-free LK
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00244-8openalex-snapshot
Representing scope in intuitionistic deductions
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80007-3openalex-snapshot
4 Computational modal logic
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80011-5openalex-snapshot
8 Modal consequence relations
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80847-8openalex-snapshot
The Universe of Approximations
inferred← citeshttps://doi.org/10.1080/11663081.1999.10510981openalex-snapshot
An empirical analysis of modal theorem provers
inferred← citeshttps://doi.org/10.1093/jigpal/jzac081openalex-snapshot
Non-contingency in a paraconsistent setting
inferred← citeshttps://doi.org/10.1093/jigpal/jzm040openalex-snapshot
Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs
inferred← citeshttps://doi.org/10.1093/jigpal/jzq052openalex-snapshot
Towards automated first-order abduction: the cut-based approach
inferred← citeshttps://doi.org/10.1093/jigpal/jzx057openalex-snapshot
Automatic proof generation in an axiomatic system for $\mathsf{CPL}$ by means of the method of Socratic proofs
inferred← citeshttps://doi.org/10.1093/logcom/14.2.179openalex-snapshot
Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control
inferred← citeshttps://doi.org/10.1093/logcom/4.3.285openalex-snapshot
The Taming of the Cut. Classical Refutations with Analytic Cut
inferred← citeshttps://doi.org/10.1093/logcom/exl018openalex-snapshot
Anytime Approximations of Classical Logic from Above
inferred← citeshttps://doi.org/10.1093/logcom/exn065openalex-snapshot
Analytic Methods for the Logic of Proofs
inferred← citeshttps://doi.org/10.1093/oso/9780198539896.001.0001openalex-snapshot
Automated Deduction in Multiple-valued Logics
inferred← citeshttps://doi.org/10.1145/2629669openalex-snapshot
Identifying Efficient Abductive Hypotheses Using Multicriteria Dominance Relation
inferred← citeshttps://doi.org/10.1145/2701424openalex-snapshot
On the Power of Substitution in the Calculus of Structures
inferred← citeshttps://doi.org/10.1215/00294527-2024-0005openalex-snapshot
Tableaux and Interpolation for Propositional Justification Logics
inferred← citeshttps://doi.org/10.12775/llp.2018.009openalex-snapshot
Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis
inferred← citeshttps://doi.org/10.2168/lmcs-11(1:4)2015openalex-snapshot
On the relative proof complexity of deep inference via atomic flows
inferred← citeshttps://doi.org/10.22028/d291-25703openalex-snapshot
Resolution-based decision procedures for subclasses of first-order 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/421131openalex-snapshot
The Complexity of Propositional Proofs
inferred← citeshttps://doi.org/10.3166/jancl.16.367-408openalex-snapshot
An efficient relational deductive system for propositional non-classical logics
inferred← citeshttps://doi.org/10.3233/978-1-58603-929-5-781openalex-snapshot
SAT Techniques for Modal and Description Logics
inferred← citeshttps://doi.org/10.3390/axioms8040133openalex-snapshot
Synthetic Tableaux with Unrestricted Cut for First-Order Theories
inferred← citeshttps://doi.org/10.48550/arxiv.1405.1565openalex-snapshot
Tableau vs. Sequent Calculi for Minimal Entailment
inferred← citeshttps://doi.org/10.48550/arxiv.1405.1828openalex-snapshot
Tableau Proof Systems for Justification Logics
inferred← citeshttps://doi.org/10.48550/arxiv.2003.04225openalex-snapshot
Are You Satisfied by This Partial Assignment?
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.