On the public citation graph
On the axiom of extensionality – Part I
0 signed · 31 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/978-3-642-65129-8_2openalex-snapshot
Probleme der Grundlegung der Mathematik
inferredcites →https://doi.org/10.1073/pnas.24.12.556openalex-snapshot
The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.2307/2267552openalex-snapshot
A formal theorem in Church's theory of types
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.200310009openalex-snapshot
On the axiom of extensionality in the positive set theory
inferred← citeshttps://doi.org/10.1002/malq.200710030openalex-snapshot
The axiom of choice and the law of excluded middle in weak set theories
inferred← citeshttps://doi.org/10.1002/malq.200710093openalex-snapshot
Light monotone Dialectica methods for proof mining
inferred← citeshttps://doi.org/10.1007/3-540-18508-9_19openalex-snapshot
An equational presentation of higher order logic
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_53openalex-snapshot
Inductive definitions with decidable atomic formulas
inferred← citeshttps://doi.org/10.1007/978-94-010-0526-5_5openalex-snapshot
Axioms of Infinity in Church’s Type Theory
inferred← citeshttps://doi.org/10.1007/bf00370439openalex-snapshot
A theorem in 3-valued model theory with connections to number theory, type theory, and relevant logic
inferred← citeshttps://doi.org/10.1007/bfb0014987openalex-snapshot
Extensional models for polymorphism
inferred← citeshttps://doi.org/10.1007/bfb0049326openalex-snapshot
From semantics to rules: A machine assisted analysis
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90097-7openalex-snapshot
Extensional models for polymorphism
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50013-5openalex-snapshot
Type Systems for Programming Languages
inferred← citeshttps://doi.org/10.1017/cbo9780511863196.003openalex-snapshot
Inside Our Computable World, and the Mathematics of Universality
inferred← citeshttps://doi.org/10.1017/jsl.2020.2openalex-snapshot
EXACT COMPLETION AND CONSTRUCTIVE THEORIES OF SETS
inferred← citeshttps://doi.org/10.1017/s0027763000011594openalex-snapshot
On a Theory Objects Based on a Single Axiom Scheme
inferred← citeshttps://doi.org/10.1017/s0960129514000504openalex-snapshot
A generalization of the Takeuti–Gandy interpretation
inferred← citeshttps://doi.org/10.1017/s0960129525100406openalex-snapshot
Formal p -category theory and normalization by evaluation in Rocq
inferred← citeshttps://doi.org/10.1023/a:1019964114625openalex-snapshot
A Formalised Proof of the Soundness and Completeness of a Simply Typed Lambda-Calculus with Explicit Substitutions
inferred← citeshttps://doi.org/10.1305/ndjfl/1093891200openalex-snapshot
Resolution and the consistency of analysis.
inferred← citeshttps://doi.org/10.29007/8p9qopenalex-snapshot
From Classical Extensional Higher-Order Tableau to Intuitionistic Intentional Natural Deduction
inferred← citeshttps://doi.org/10.31235/osf.io/57rxfopenalex-snapshot
Gödel mathematics versus Hilbert mathematics. II Logicism and Hilbert mathematics, the identification of logic and set theory, and Gödel’s “completeness paper” (1930)
inferred← citeshttps://doi.org/10.33774/coe-2023-m1rckopenalex-snapshot
Gödel mathematics versus Hilbert mathematics. II Logicism and Hilbert mathematics, the identification of logic and set theory, and Gödel’s “completeness paper” (1930)
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.