On the public citation graph

ileanTAP: An intuitionistic theorem prover

https://doi.org/10.1007/bfb0027422
0 signed · 35 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-58156-1_62openalex-snapshot
LeanT A P: Lean tableau-based theorem proving
inferredcites →https://doi.org/10.1007/3-540-59338-1_32openalex-snapshot
A connection based proof method for intuitionistic logic
inferredcites →https://doi.org/10.1007/3-540-61208-4_16openalex-snapshot
T-string unification: Unifying prefixes in non-classical proof methods
inferredcites →https://doi.org/10.1007/3-540-61511-3_65openalex-snapshot
A resolution theorem prover for intuitionistic logic
inferredcites →https://doi.org/10.1007/3-540-61708-6_70openalex-snapshot
A uniform proof procedure for classical and non-classical 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-4684-0357-2openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/bf00881804openalex-snapshot
leanTAP: Lean tableau-based deduction
inferredcites →https://doi.org/10.1093/logcom/2.5.619openalex-snapshot
An Intuitionistic Predicate Logic Theorem Prover
inferredcites →https://doi.org/10.2307/2275431openalex-snapshot
Contraction-free sequent calculi for intuitionistic logic

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_31openalex-snapshot
A Tableau-Like Representation Framework for Efficient Proof Reconstruction
inferred← citeshttps://doi.org/10.1007/11554554_19openalex-snapshot
Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic
inferred← citeshttps://doi.org/10.1007/11554554_28openalex-snapshot
The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/11853886_25openalex-snapshot
On Herbrand’s Theorem for Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/3-540-33521-8_15openalex-snapshot
Tableau Method with Free Variables for Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_19openalex-snapshot
A General Theorem Prover for Quantified Modal Logics
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_20openalex-snapshot
linTAP : A Tableau Prover for Linear Logic
inferred← citeshttps://doi.org/10.1007/3-540-49674-2_1openalex-snapshot
A Multi-level Approach to Program Synthesis
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_20openalex-snapshot
Connection-based proof construction in linear logic
inferred← citeshttps://doi.org/10.1007/3-540-69778-0_27openalex-snapshot
Deleting Redundancy in Proof Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-030-86059-2_14openalex-snapshot
The nanoCoP 2.0 Connection Provers for Classical, Intuitionistic and Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-319-66902-1_13openalex-snapshot
Non-clausal Connection Calculi for Non-classical Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_23openalex-snapshot
leanCoP 2.0 and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
inferred← citeshttps://doi.org/10.1007/bfb0027407openalex-snapshot
Free variable tableaux for propositional modal logics
inferred← citeshttps://doi.org/10.1007/s10817-006-9060-zopenalex-snapshot
The ILTP Problem Library for Intuitionistic Logic
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50024-2openalex-snapshot
Connections in Nonclassical Logics
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00037-3openalex-snapshot
leanCoP: lean connection-based theorem proving
inferred← citeshttps://doi.org/10.1023/a:1013886427723openalex-snapshot
Free-Variable Tableaux for Propositional Modal Logics
inferred← citeshttps://doi.org/10.1080/00207160.2010.493211openalex-snapshot
Implementing a relational theorem prover for modal logic
inferred← citeshttps://doi.org/10.1145/2981544openalex-snapshot
How Hard Is Positive Quantification?
inferred← citeshttps://doi.org/10.18725/oparu-3openalex-snapshot
Construction and deduction in type theories
inferred← citeshttps://doi.org/10.3217/jucs-005-03-0088openalex-snapshot
Connection-Based Theorem Proving in Classical and Non-Classical Logics
inferred← citeshttps://doi.org/10.3233/aic-2010-0464openalex-snapshot
Restricting backtracking in connection calculi
inferred← citeshttps://doi.org/10.48550/arxiv.1910.01775openalex-snapshot
Formula Transformers and Combinatorial Test Generators for Propositional Intuitionistic Theorem Provers
inferred← citeshttps://doi.org/10.5282/ubm/epub.14895openalex-snapshot
Variations on a Theme: A Bibliography on Approaches to Theorem Proving Inspired From Satchmo
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.