On the public citation graph
Realizability: A retrospective survey
0 signed · 71 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-540-89107-9_6openalex-snapshot
Grundlagen der Mathematik
inferredcites →https://doi.org/10.1007/bf01186549openalex-snapshot
Zur Deutung der intuitionistischen Logik
inferredcites →https://doi.org/10.1007/bf01360048openalex-snapshot
On disjunctions and existential statements in intuitionistic systems of logic
inferredcites →https://doi.org/10.1007/bf01988049openalex-snapshot
Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül
inferredcites →https://doi.org/10.1016/s0049-237x(08)70752-3openalex-snapshot
A Characterization of the Intuitionistic Propositional Calculus
inferredcites →https://doi.org/10.1016/s0049-237x(08)71514-3openalex-snapshot
Disjunction and Existence in Formalized Intuitionistic Analysis
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7058-2openalex-snapshot
Logic, Methodology and Philosophy of Science III
inferredcites →https://doi.org/10.1016/s1385-7258(52)50028-3openalex-snapshot
On the intuitionistic theory of deduction
inferredcites →https://doi.org/10.1090/memo/0089openalex-snapshot
Formalized recursive functionals and formalized realizability
inferredcites →https://doi.org/10.1090/s0002-9947-1943-0007371-8openalex-snapshot
Recursive Predicates and Quantifiers
inferredcites →https://doi.org/10.1090/s0002-9947-1947-0025420-1openalex-snapshot
Recursive Functions and Intuitionistic Number Theory
inferredcites →https://doi.org/10.1090/s0002-9947-1953-0055952-4openalex-snapshot
Propositional Calculus and Realizability
inferredcites →https://doi.org/10.2307/2183047openalex-snapshot
Logic, Methodology and Philosophy of Science.
inferredcites →https://doi.org/10.2307/2269016openalex-snapshot
On the interpretation of intuitionistic number theory
inferredcites →https://doi.org/10.2307/2313661openalex-snapshot
The Foundations of Intuitionistic Mathematics.
inferredcites →https://doi.org/10.2307/2371045openalex-snapshot
An Unsolvable Problem of Elementary Number Theory
inferredcites →https://doi.org/10.2307/2963675openalex-snapshot
Disjunction and existence under implication in elementary intuitionistic formalisms
inferredcites →https://doi.org/10.2307/2964334openalex-snapshot
Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-17184-3_40openalex-snapshot
Sur l'analogie entre les propositions et les types
inferred← citeshttps://doi.org/10.1007/3-540-51305-1_14openalex-snapshot
Realizability models for program construction
inferred← citeshttps://doi.org/10.1007/3-540-52592-0_78openalex-snapshot
Towards the theory of programming in constructive logic
inferred← citeshttps://doi.org/10.1007/978-0-8176-4769-8_10openalex-snapshot
The Unintended Interpretations of Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-0-8176-4769-8_11openalex-snapshot
The Writing of Introduction to Metamathematics
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_13openalex-snapshot
Constructive Kripke Semantics and Realizability
inferred← citeshttps://doi.org/10.1007/978-1-4613-0609-2_1openalex-snapshot
On the Early History of Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-29022-1_22openalex-snapshot
21st Century Virology: Critical Steps
inferred← citeshttps://doi.org/10.1007/978-3-0348-9114-1_5openalex-snapshot
La Logique Mathématique en sa jeunesse
inferred← citeshttps://doi.org/10.1007/978-3-319-20762-9_9openalex-snapshot
Verificationism and Classical Realizability
inferred← citeshttps://doi.org/10.1007/978-3-319-26506-3_5openalex-snapshot
On the Computational Meaning of Axioms
inferred← citeshttps://doi.org/10.1007/978-94-017-1592-8_13openalex-snapshot
Realizability and Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-3327-4_11openalex-snapshot
Why Constructive Mathematics?
inferred← citeshttps://doi.org/10.1007/978-94-017-9217-2_5openalex-snapshot
Proof-Theoretic Semantics and Feasibility
inferred← citeshttps://doi.org/10.1007/bf00485463openalex-snapshot
Realizability and intuitionistic logic
inferred← citeshttps://doi.org/10.1007/bf01084980openalex-snapshot
Theory of proofs (arithmetic and analysis)
inferred← citeshttps://doi.org/10.1007/s10670-024-00828-1openalex-snapshot
From Explosion to Implosion: A New Justification for the Ex Falso Quodlibet Rule
inferred← citeshttps://doi.org/10.1016/0165-4896(85)90038-1openalex-snapshot
On effectively computable realizations of choice functions
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90050-3openalex-snapshot
Realizability and recursive set theory
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50013-5openalex-snapshot
Type Systems for Programming Languages
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71259-xopenalex-snapshot
Kleene's Readability and “Divides” Notions for Formalized Intuitionistic Mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71265-5openalex-snapshot
Intuitionistic Analysis: The Search for Axiomatization and Understanding
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00080-xopenalex-snapshot
Analyzing realizability by Troelstra's methods
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00057-8openalex-snapshot
From computation to foundations via functions and application: The λ-calculus and its webbed models
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00172-2openalex-snapshot
From constructivism to computer science
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00104-5openalex-snapshot
A type theory which is complete for Kreisel's modified realizability
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00106-9openalex-snapshot
History and Developments
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80401-3openalex-snapshot
Intuitionism — Counting its Blessings. Preliminary version
inferred← citeshttps://doi.org/10.1017/s0960129502003626openalex-snapshot
Realizability: a historical essay
inferred← citeshttps://doi.org/10.1080/01445340.2025.2499409openalex-snapshot
Kolmogorov's Calculus of Problems and its Legacy
inferred← citeshttps://doi.org/10.1109/sfcs.1979.33openalex-snapshot
Origins of recursive function theory
inferred← citeshttps://doi.org/10.1145/318593.318606openalex-snapshot
Abstract types have existential types
inferred← citeshttps://doi.org/10.1145/44501.45065openalex-snapshot
Abstract types have existential type
inferred← citeshttps://doi.org/10.2178/bsl/1182353873openalex-snapshot
A General Notion of Realizability
inferred← citeshttps://doi.org/10.2307/2273147openalex-snapshot
Constructive assertions in an extension of classical mathematics
inferred← citeshttps://doi.org/10.2307/2275884openalex-snapshot
Minimal readability of intuitionistic arithmetic and elementary analysis
inferred← citeshttps://doi.org/10.2307/421038openalex-snapshot
Hermann Weyl's Intuitionistic Mathematics
inferred← citeshttps://doi.org/10.26083/tuprints-00000351openalex-snapshot
A Universal Realizability Model for Sequential Functional Computation
inferred← citeshttps://doi.org/10.33540/1241openalex-snapshot
Computability Models and Realizability Toposes
inferred← citeshttps://doi.org/10.48550/arxiv.1109.5542openalex-snapshot
Gaming security by obscurity
inferred← citeshttps://doi.org/10.5282/edoc.1619openalex-snapshot
On the Constructive Content of Proofs
inferred← citeshttps://doi.org/10.70675/ebffbe00z3617z41e5z91bfzd4ec1aa303afopenalex-snapshot
Le statut dynamique des axiomes : des preuves aux modèles
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.