On the public citation graph
Selectively instantiating definitions
0 signed · 43 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-10009-1_21openalex-snapshot
Abstraction mappings in mechanical theorem proving
inferredcites →https://doi.org/10.1007/3-540-61511-3_74openalex-snapshot
ABSFOL: A proof checker with abstraction
inferredcites →https://doi.org/10.1007/978-94-015-9934-4openalex-snapshot
An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof
inferredcites →https://doi.org/10.1007/bf00247438openalex-snapshot
The problem of definition expansion and contraction
inferredcites →https://doi.org/10.1007/bf00248320openalex-snapshot
On connections and higher-order logic
inferredcites →https://doi.org/10.1007/bf00252180openalex-snapshot
TPS: A theorem-proving system for classical type theory
inferredcites →https://doi.org/10.1007/bf00370646openalex-snapshot
A compact representation of proofs
inferredcites →https://doi.org/10.1007/bf00881874openalex-snapshot
?-match: An inference rule for incrementally elaborating set instantiations
inferredcites →https://doi.org/10.1007/bf02341853openalex-snapshot
Gazing: An approach to the problem of definition and lemma use
inferredcites →https://doi.org/10.1016/0004-3702(74)90009-5openalex-snapshot
A man-machine theorem-proving system
inferredcites →https://doi.org/10.1016/0004-3702(78)90028-0openalex-snapshot
Automatic theorem proving in set theory
inferredcites →https://doi.org/10.1016/0004-3702(81)90015-1openalex-snapshot
Theorem proving with abstraction
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1145/322248.322249openalex-snapshot
Theorem Proving via General Matings
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.2307/2274454openalex-snapshot
Peter B. Andrews. An introduction to mathematical logic and type theory: to truth through proof. Computer science and applied mathematics. Academic Press, Orlando etc. 1986, xv + 304 pp.
inferredcites →https://doi.org/10.2307/2312411openalex-snapshot
Correction for "Indefinite Integration by Residues"
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.0468openalex-snapshot
MBase: Representing Knowledge and Context for the Integration of Mathematical Software Systems
inferred← citeshttps://doi.org/10.1007/10721959_11openalex-snapshot
System Description: TPS: A Theorem Proving System for Type Theory
inferred← citeshttps://doi.org/10.1007/10721959_44openalex-snapshot
Tutorial: Using TPS for Higher-Order Theorem Proving and ETPS for Teaching Logic
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_25openalex-snapshot
Proof Development with ΩMEGA: √2 Is Irrational
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_5openalex-snapshot
Replacement Rules with Definition Detection
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_32openalex-snapshot
A Breadth-First Strategy for Mating Search
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_17openalex-snapshot
Bridging Theorem Proving and Mathematical Knowledge Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_27openalex-snapshot
Can a Higher-Order and a First-Order Theorem Prover Cooperate?
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_14openalex-snapshot
LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)
inferred← citeshttps://doi.org/10.1007/978-94-017-0253-9_11openalex-snapshot
Proof Development with Ωmega: The Irrationality of $$\sqrt 2$$
inferred← citeshttps://doi.org/10.1007/s10817-015-9331-7openalex-snapshot
Definitional Expansions in Mizar
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50017-5openalex-snapshot
Classical Type Theory
inferred← citeshttps://doi.org/10.1016/j.cl.2015.07.002openalex-snapshot
Flexary connectives in Mizar
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.002openalex-snapshot
TPS: A hybrid automatic-interactive system for developing proofs
inferred← citeshttps://doi.org/10.1016/j.jal.2007.06.003openalex-snapshot
Combined reasoning by automated cooperation
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80615-2openalex-snapshot
MBase: Representing mathematical Knowledge in a Relational Data Base
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03001-5openalex-snapshot
Chapter 1 Knowledge Representation and Classical Logic
inferred← citeshttps://doi.org/10.1023/b:jars.0000009552.54063.f3openalex-snapshot
Herbrand Award Acceptance Speech
inferred← citeshttps://doi.org/10.1609/aimag.v37i2.2620openalex-snapshot
The CADE ATP System Competition — CASC
inferred← citeshttps://doi.org/10.29007/lvccopenalex-snapshot
Proceedings of the 6th IJCAR ATP System Competition (CASC-J6)
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/1710openalex-snapshot
Automated Reasoning in Higher-Order Logic using the TPTP THF Infrastructure
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.