On the public citation graph
Reminiscences of logicians
0 signed · 51 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/978-3-662-41928-1openalex-snapshot
Grundzüge der Theoretischen Logik
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_3openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.1007/bf01458217openalex-snapshot
Über Möglichkeiten im Relativkalkül
inferredcites →https://doi.org/10.1007/bf01565439openalex-snapshot
General recursive functions of natural numbers
inferredcites →https://doi.org/10.1007/bf01696781openalex-snapshot
Die Vollständigkeit der Axiome des logischen Funktionenkalküls
inferredcites →https://doi.org/10.1007/bf01700692openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1007/bf02028146openalex-snapshot
Diskussion zur Grundlegung der Mathematik
inferredcites →https://doi.org/10.1016/j.hm.2003.07.003openalex-snapshot
From Frege to Gödel. A Source Book in Mathematical Logic, 1879–1931
inferredcites →https://doi.org/10.1016/s0049-237x(08)70579-2openalex-snapshot
Recursion in the Superjump
inferredcites →https://doi.org/10.1016/s0049-237x(08)71232-1openalex-snapshot
A Countable Hierarchy for the Superjump
inferredcites →https://doi.org/10.1016/s0049-237x(09)70461-6openalex-snapshot
On definable sets of positive integers )
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.1090/s0002-9904-1961-10696-4openalex-snapshot
The theory of transfinite recursion
inferredcites →https://doi.org/10.1090/s0002-9947-1943-0007371-8openalex-snapshot
Recursive Predicates and Quantifiers
inferredcites →https://doi.org/10.1090/s0002-9947-1955-0070594-4openalex-snapshot
Arithmetical Predicates and Function Quantifiers
inferredcites →https://doi.org/10.1098/rsbm.1955.0019openalex-snapshot
Alan Mathison Turing, 1912-1954
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1112/plms/s2-43.6.544openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
inferredcites →https://doi.org/10.2307/1969708openalex-snapshot
The Upper Semi-Lattice of Degrees of Recursive Unsolvability
inferredcites →https://doi.org/10.2307/2266224openalex-snapshot
Adolf Lindenbaum und Andrzej Mostowski. Über die Unabhängigkeit des Auswahlaxioms und einiger seiner Folgerungen. Comptes rendus des séances de la Société des Sciences et des Lettres de Varsovie, Classe III, Bd. 31 (1938), S. 27–32.
inferredcites →https://doi.org/10.2307/2266225openalex-snapshot
Andrzej Mostowski. Über den Begriff einer endlichen Menge. Comptes rendus des séances de la Société des Sciences et des Lettres de Varsovie, Classe III, Bd. 31 (1938), S. 13–20.
inferredcites →https://doi.org/10.2307/2269031openalex-snapshot
Finite combinatory processes—formulation
inferredcites →https://doi.org/10.2307/2269044openalex-snapshot
Kurt Gödel. Über die Länge von Beweisen. Ergebnisse eirtes mathematischen Kolloquiums, Heft 7, pp. 23–24.
inferredcites →https://doi.org/10.2307/2272994openalex-snapshot
Jean van Heijenoort. Introductory note. From Frege to Gödel, A source book in mathematical logic, 1879–1931, edited by Jean van Heijenoort, Harvard University Press, Cambridge, Mass., 1967, pp. 1–5. Reprinted in Frege and Gödel, Two fundamental texts in mathematical logic, edited by Jean van…
inferredcites →https://doi.org/10.2307/2371045openalex-snapshot
An Unsolvable Problem of Elementary Number Theory
inferredcites →https://doi.org/10.2969/jmsj/00910093openalex-snapshot
On the theory of ordinal numbers
inferredcites →https://doi.org/10.2969/jmsj/01220119openalex-snapshot
On the recursive functions of ordinal numbers.
inferredcites →https://doi.org/10.4064/fm-23-1-150-161openalex-snapshot
Über die Nicht-charakterisierbarkeit der Zahlenreihe mittels endlich oder abzählbar unendlich vieler Aussagen mit ausschliesslich Zahlenvariablen
inferredcites →https://doi.org/10.4064/fm-34-1-81-112openalex-snapshot
On definable sets of positive integers
inferredcites →https://doi.org/10.4064/fm-46-3-337-357openalex-snapshot
Some consequences of the axiom of constructibility
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_1openalex-snapshot
Automated Reasoning for Mathematics
inferred← citeshttps://doi.org/10.1007/978-94-015-8988-8_9openalex-snapshot
A Picaresque Approach to Set Theory Genealogy
inferred← citeshttps://doi.org/10.1007/s00153-020-00712-zopenalex-snapshot
The noneffectivity of Arslanov’s completeness criterion and related theorems
inferred← citeshttps://doi.org/10.1007/s11229-026-05482-4openalex-snapshot
Varieties of confluence arguments, part 1: practical applications
inferred← citeshttps://doi.org/10.1007/s11787-014-0108-2openalex-snapshot
Adolf Lindenbaum: Notes on his Life, with Bibliography and Selected References
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50010-1openalex-snapshot
Degrees of Unsolvability
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot
Lambda-Calculus and Combinators in the 20th Century
inferred← citeshttps://doi.org/10.1080/00455091.1981.10716338openalex-snapshot
D.R. Hofstadter Gödel, Escher, Bach: an Eternal Golden Braid (New York: Basic Books Inc.1979).
inferred← citeshttps://doi.org/10.1080/01445348308837055openalex-snapshot
Remarks on the development of computability
inferred← citeshttps://doi.org/10.1090/s0273-0979-1982-14963-1openalex-snapshot
The word problem and the isomorphism problem for groups
inferred← citeshttps://doi.org/10.1145/2746325.2746330openalex-snapshot
Church Encoding of Data Types Considered Harmful for Implementations
inferred← citeshttps://doi.org/10.2178/jsl/1067620175openalex-snapshot
The axiom of choice and combinatory logic
inferred← citeshttps://doi.org/10.2307/2275109openalex-snapshot
Derivation rules as anti-axioms in modal logic
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.