On the public citation graph

The even more liberalized δ-rule in free variable Semantic Tableaux

https://doi.org/10.1007/bfb0022559
0 signed · 52 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/978-1-4612-2360-3openalex-snapshot
First-Order Logic and Automated Theorem Proving
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-3-642-86718-7openalex-snapshot
First-Order Logic
inferredcites →https://doi.org/10.1007/bf00244394openalex-snapshot
First-order modal tableaux
inferredcites →https://doi.org/10.1007/bf00881956openalex-snapshot
The liberalized ?-rule in free variable semantic tableaux

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722086_16openalex-snapshot
Variants of First-Order Modal Logics
inferred← citeshttps://doi.org/10.1007/11916277_12openalex-snapshot
A Semantic Completeness Proof for TaMeD
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_19openalex-snapshot
Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized δ-Rule but Without Skolemization
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_7openalex-snapshot
A Further and Effective Liberalization of the δ-Rule in Free Variable Semantic Tableaux
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_17openalex-snapshot
Hilbert’s ∈-Terms in Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_188openalex-snapshot
An improved method for adding equality to free variable semantic tableaux
inferred← citeshttps://doi.org/10.1007/3-540-56804-2_4openalex-snapshot
Compiling proof search in semantic tableaux
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_62openalex-snapshot
LeanT A P: Lean tableau-based theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_37openalex-snapshot
Constraint model elimination and a PTTP-implementation
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_38openalex-snapshot
Non-elementary speedups between different versions of tableaux
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_7openalex-snapshot
Incremental theory reasoning methods for semantic tableaux
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_95openalex-snapshot
The tableau-based theorem prover 3 T A P Version 4.0
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_15openalex-snapshot
Fibring Semantic Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_17openalex-snapshot
A Free Variable Sequent Calculus with Uniform Variable Splitting
inferred← citeshttps://doi.org/10.1007/978-3-642-04617-9_56openalex-snapshot
Atomic Metadeduction
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_4openalex-snapshot
Integrating Automated and Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_10openalex-snapshot
Implementing Semantic Tableaux
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_3openalex-snapshot
First-Order Tableau Methods
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_7openalex-snapshot
Tableau Methods for Substructural Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_9openalex-snapshot
Tableaux for Many-Valued Logics
inferred← citeshttps://doi.org/10.1007/bf00881804openalex-snapshot
leanTAP: Lean tableau-based deduction
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/bfb0027405openalex-snapshot
Lean induction principles for tableaux
inferred← citeshttps://doi.org/10.1007/bfb0027424openalex-snapshot
A framework for using knowledge in tableau proofs
inferred← citeshttps://doi.org/10.1007/s00153-021-00798-zopenalex-snapshot
Efficient elimination of Skolem functions in $$\text {LK}^\text {h}$$
inferred← citeshttps://doi.org/10.1007/s10817-006-9045-yopenalex-snapshot
A Sound Framework for δ-Rule Variants in Free-Variable Semantic Tableaux
inferred← citeshttps://doi.org/10.1007/s10817-006-9055-9openalex-snapshot
Liberalized Variable Splitting
inferred← citeshttps://doi.org/10.1007/s10817-008-9115-4openalex-snapshot
First Order Stålmarck
inferred← citeshttps://doi.org/10.1007/s10817-020-09576-7openalex-snapshot
Machine Learning Guidance for Connection Tableaux
inferred← citeshttps://doi.org/10.1007/s11787-012-0056-7openalex-snapshot
HERBRAND’s Fundamental Theorem in the Eyes of JEAN VAN HEIJENOORT
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50024-2openalex-snapshot
Connections in Nonclassical Logics
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104753openalex-snapshot
Towards a proof theory for quantifier macros
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.032openalex-snapshot
Incremental variable splitting
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.035openalex-snapshot
, , and Non-Permutability of -Steps
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.1093/jigpal/12.1.1openalex-snapshot
Descente Infinie + Deduction
inferred← citeshttps://doi.org/10.1093/logcom/7.1.39openalex-snapshot
Semantic tableaux with equality
inferred← citeshttps://doi.org/10.1093/logcom/exs057openalex-snapshot
Quantifiers in logic and proof-search using permissive-nominal terms and sets
inferred← citeshttps://doi.org/10.1109/ismvl.1994.302195openalex-snapshot
Efficient deduction in many-valued logics
inferred← citeshttps://doi.org/10.1109/ismvl.1996.508369openalex-snapshot
DT-an automated theorem prover for multiple-valued first-order predicate logics
inferred← citeshttps://doi.org/10.3217/jucs-005-03-0073openalex-snapshot
A Generic Tableau Prover and its Integration with Isabelle
inferred← citeshttps://doi.org/10.48550/arxiv.0902.3730openalex-snapshot
Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized delta-Rule but Without Skolemization
inferred← citeshttps://doi.org/10.48550/arxiv.1405.6317openalex-snapshot
Herbrand's Fundamental Theorem: The Historical Facts and their Streamlining
inferred← citeshttps://doi.org/10.48550/arxiv.1805.03107openalex-snapshot
Machine Learning Guidance and Proof Certification for Connection Tableaux
inferred← citeshttps://doi.org/10.70675/b8a908cfzea79z4efdza9dezd3589d30dd25openalex-snapshot
Designing an Automated Concurrent Tableau-Based Theorem Prover for First-Order Logic
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.