On the public citation graph
Theorem proving in higher order logics: 17th International conference, TPHOLs 2004 park city, Utah, USA, september 14-17, 2004 proceedings 13
0 signed · 23 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/10930755_21openalex-snapshot
Formalizing Hilbert’s Grundlagen in Isabelle/Isar
inferredcites →https://doi.org/10.1007/3-540-45410-1_17openalex-snapshot
Higher-Order Intuitionistic Formalization and Proofs in Hilbert’s Elementary Geometry
inferredcites →https://doi.org/10.1007/978-94-009-4037-6openalex-snapshot
Mechanical Geometry Theorem Proving
inferredcites →https://doi.org/10.1007/bfb0014565openalex-snapshot
Using reflection to build efficient and certified decision procedures
inferredcites →https://doi.org/10.1016/0168-0072(95)00005-2openalex-snapshot
The axioms of constructive geometry
inferredcites →https://doi.org/10.1016/s0049-237x(09)70017-5openalex-snapshot
What is Elementary Geometry?
inferredcites →https://doi.org/10.1090/conm/029/12openalex-snapshot
On the Decision Problem and the Mechanization of Theorem-Proving in Elementary Geometry
inferredcites →https://doi.org/10.1145/1093390.1093393openalex-snapshot
Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition
inferredcites →https://doi.org/10.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10817-008-9097-2openalex-snapshot
Nominal Techniques in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/s10817-022-09652-0openalex-snapshot
Measuring the Readability of Geometric Proofs: The Area Method Case
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103524openalex-snapshot
Equiconsistency of the Minimalist Foundation with its classical version
inferred← citeshttps://doi.org/10.1016/j.cola.2021.101085openalex-snapshot
An intrinsically-typed solution for the list-machine benchmark
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.01.016openalex-snapshot
A Logic for Reasoning about Generic Judgments
inferred← citeshttps://doi.org/10.1016/j.ic.2018.03.001openalex-snapshot
Incorporating quotation and evaluation into Church's type theory
inferred← citeshttps://doi.org/10.1017/9781316823187openalex-snapshot
Introduction to Coalgebra: Towards Mathematics of States and Observation
inferred← citeshttps://doi.org/10.1017/s0960129511000156openalex-snapshot
A pluralist approach to the formalisation of mathematics
inferred← citeshttps://doi.org/10.1093/logcom/exad068openalex-snapshot
The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
inferred← citeshttps://doi.org/10.1112/s1461157000000188openalex-snapshot
A Formalisation of Weak Normalisation (with Respect to Permutations) of Sequent Calculus Proofs
inferred← citeshttps://doi.org/10.1145/309831.309949openalex-snapshot
Automated theorem proving in support of computer algebra
inferred← citeshttps://doi.org/10.4204/eptcs.352.14openalex-snapshot
Open Geometry Prover Community Project
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.