On the public citation graph

Some applications of Gentzen's proof theory in automated deduction

https://doi.org/10.1007/bfb0038693
0 signed · 45 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-16780-3_122openalex-snapshot
A prolog technology theorem prover: Implementation by an extended prolog compiler
inferredcites →https://doi.org/10.1007/3-540-52885-7_136openalex-snapshot
A prolog technology theorem prover
inferredcites →https://doi.org/10.1007/978-1-4613-9647-5_25openalex-snapshot
Logic and Computation in MATHPERT: An Expert System for Learning Mathematics
inferredcites →https://doi.org/10.1007/978-3-642-55481-0openalex-snapshot
Programming in Prolog
inferredcites →https://doi.org/10.1007/978-3-642-66473-1openalex-snapshot
Proof Theory
inferredcites →https://doi.org/10.1007/978-3-642-68952-9openalex-snapshot
Foundations of Constructive Mathematics
inferredcites →https://doi.org/10.1007/978-3-642-87374-4_12openalex-snapshot
Deduction and Computation
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-662-40145-3openalex-snapshot
Fundamentals of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf00297245openalex-snapshot
A prolog technology theorem prover: Implementation by an extended prolog compiler
inferredcites →https://doi.org/10.1007/bfb0012823openalex-snapshot
Specifying theorem provers in a higher-order logic programming language
inferredcites →https://doi.org/10.1007/bfb0012835openalex-snapshot
Computational metatheory in Nuprl
inferredcites →https://doi.org/10.1007/bfb0012847openalex-snapshot
SATCHMO: A theorem prover implemented in Prolog
inferredcites →https://doi.org/10.1007/bfb0062852openalex-snapshot
A language and axioms for explicit mathematics
inferredcites →https://doi.org/10.1016/0743-1066(84)90029-3openalex-snapshot
N-Prolog: An extension of Prolog with hypothetical implications. I.
inferredcites →https://doi.org/10.1016/0743-1066(86)90015-4openalex-snapshot
Natural deduction as higher-order resolution
inferredcites →https://doi.org/10.1016/0743-1066(87)90020-3openalex-snapshot
Efficient loop detection in prolog using the tortoise-and-hare technique
inferredcites →https://doi.org/10.1016/0743-1066(88)90005-2openalex-snapshot
Clausal intuitionistic logic I. fixed-point semantics
inferredcites →https://doi.org/10.1016/0743-1066(88)90014-3openalex-snapshot
Clausal intuitionistic logic II. tableau proof procedures
inferredcites →https://doi.org/10.1016/s0049-237x(08)71625-2openalex-snapshot
Constructive Theories of Functions and Classes
inferredcites →https://doi.org/10.1080/00029890.1985.11971545openalex-snapshot
AUTOMATED REASONING
inferredcites →https://doi.org/10.1080/11663081.1993.10510797openalex-snapshot
Computation with run time skolemisation (N-Prolog part 3)
inferredcites →https://doi.org/10.1090/conm/029openalex-snapshot
Automated Theorem Proving: After 25 Years
inferredcites →https://doi.org/10.1145/33447.33448openalex-snapshot
Generality in artificial intelligence
inferredcites →https://doi.org/10.2307/2314383openalex-snapshot
Foundations of Constructive Analysis.
inferredcites →https://doi.org/10.25911/5d6fa29251193openalex-snapshot
Automated theorem-proving in non-classical logics

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jsco.2000.0465openalex-snapshot
Automatic Derivation of the Irrationality of e
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_23openalex-snapshot
A Second-Order Theorem Prover Applied to Circumscription
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_98openalex-snapshot
Presenting intuitive deductions via symmetric simplification
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_189openalex-snapshot
Proof search in the intuitionistic sequent calculus
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_62openalex-snapshot
Cut formulae and logic programming
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_65openalex-snapshot
A resolution theorem prover for intuitionistic logic
inferred← citeshttps://doi.org/10.1007/978-1-4613-9647-5_25openalex-snapshot
Logic and Computation in MATHPERT: An Expert System for Learning Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-662-05642-4_5openalex-snapshot
The Mechanization of Mathematics
inferred← citeshttps://doi.org/10.1007/978-981-97-8093-8_41openalex-snapshot
Jaśkowski–Fitch Natural Deduction Proofs for Metadata Extraction Through Machine Learning Systems
inferred← citeshttps://doi.org/10.1007/bfb0013085openalex-snapshot
Mathpert: Computer support for learning algebra, trig, and calculus
inferred← citeshttps://doi.org/10.1007/bfb0038701openalex-snapshot
Hypothetical reasoning and definitional reflection in logic programming
inferred← citeshttps://doi.org/10.1007/bfb0054251openalex-snapshot
Unification in lambda-calculi with if-then-else
inferred← citeshttps://doi.org/10.1007/bfb0055903openalex-snapshot
Automatic generation of epsilon-delta proofs of continuity
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80613-9openalex-snapshot
Automatic Derivation of the Irrationality of e
inferred← citeshttps://doi.org/10.1049/ip-sen:20060011openalex-snapshot
Deriving specifications from requirements through problem reduction
inferred← citeshttps://doi.org/10.1093/logcom/1.5.635openalex-snapshot
A Proof-Theoretic Approach to Logic Programming
inferred← citeshttps://doi.org/10.1109/lics.1989.39186openalex-snapshot
Elf: a language for logic definition and verified metaprogramming
inferred← citeshttps://doi.org/10.1111/j.1747-9991.2011.00418.xopenalex-snapshot
Proof Theory for Modal Logic
inferred← citeshttps://doi.org/10.21954/ou.ro.0001604dopenalex-snapshot
Problem Oriented Software Engineering
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.