On the public citation graph
Mathematical significance of consistency proofs
0 signed · 153 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-0348-9078-6openalex-snapshot
Proceedings of the International Congress of Mathematicians
inferredcites →https://doi.org/10.1007/978-3-540-89107-9_6openalex-snapshot
Grundlagen der Mathematik
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/978-3-8348-2359-5_5openalex-snapshot
Grundlagen der Mathematik
inferredcites →https://doi.org/10.1007/bf01192912openalex-snapshot
Some concepts concerning formal systems of number theory
inferredcites →https://doi.org/10.1007/bf01342849openalex-snapshot
Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
inferredcites →https://doi.org/10.1007/bf01342950openalex-snapshot
Schlußweisen-Kalküle der Prädikatenlogik
inferredcites →https://doi.org/10.1007/bf01343554openalex-snapshot
Beweistheoretische Untersuchung der verzweigten Analysis
inferredcites →https://doi.org/10.1007/bf01343896openalex-snapshot
On ordered fields and definite functions
inferredcites →https://doi.org/10.1007/bf01450016openalex-snapshot
Zur Widerspruchsfreiheit der Zahlentheorie
inferredcites →https://doi.org/10.1007/bf01564760openalex-snapshot
Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
inferredcites →https://doi.org/10.1007/bf02952513openalex-snapshot
Über die Zerlegung definiter Funktionen in Quadrate
inferredcites →https://doi.org/10.1016/b978-044450423-4/50007-3openalex-snapshot
Systems of logic based on ordinals
inferredcites →https://doi.org/10.1016/s0049-237x(09)70258-7openalex-snapshot
On a System of Axioms Which Has no Recursively Enumerable Arithmetic Model
inferredcites →https://doi.org/10.1016/s0049-237x(09)70260-5openalex-snapshot
A formula with no recursively enumerable model
inferredcites →https://doi.org/10.1016/s0049-237x(09)70263-0openalex-snapshot
A proof of Herbrand's theorem
inferredcites →https://doi.org/10.1016/s0049-237x(09)70302-7openalex-snapshot
Models, Translations and Interpretations
inferredcites →https://doi.org/10.1016/s0049-237x(09)70461-6openalex-snapshot
On definable sets of positive integers )
inferredcites →https://doi.org/10.1016/s1385-7258(52)50044-1openalex-snapshot
Some elementary inequalities
inferredcites →https://doi.org/10.1017/s0022481200039815openalex-snapshot
Barkley Rosser. Extensions of some theorems of Gödel and Church. The journal of symbolic logic, vol. 1 (1936), pp. 87–91.
inferredcites →https://doi.org/10.1090/s0002-9947-1955-0070594-4openalex-snapshot
Arithmetical Predicates and Function Quantifiers
inferredcites →https://doi.org/10.1112/plms/s2-45.1.161openalex-snapshot
Systems of Logic Based on Ordinals†
inferredcites →https://doi.org/10.1112/plms/s3-5.1.48openalex-snapshot
On the Difference π(x ) − lix (II)
inferredcites →https://doi.org/10.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.2307/2372632openalex-snapshot
On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
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-39-1-103-127openalex-snapshot
On the concepts of completeness and interpretation of formal systems
inferredcites →https://doi.org/10.4064/fm-40-1-56-61openalex-snapshot
On a system of axioms which has no recursively enumerable arithmetic model
inferredcites →https://doi.org/10.4064/fm-42-1-125-140openalex-snapshot
A formula with no recursively enumerable model
inferredcites →https://doi.org/10.5840/wcp11195314447openalex-snapshot
Note on Arithmetic Models for Consistent Formulae of the Predicate Calculus II
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.19770231902openalex-snapshot
Theorie Der Numerierungen III
inferred← citeshttps://doi.org/10.1006/inco.1996.0025openalex-snapshot
A Symmetric Lambda Calculus for Classical Program Extraction
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_1openalex-snapshot
A constructive valuation interpretation for classical logic and its use in witness extraction
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_112openalex-snapshot
A symmetric lambda calculus for “classical” program extraction
inferred← citeshttps://doi.org/10.1007/978-1-4020-8926-8_16openalex-snapshot
Tarski’s Practice and Philosophy: Between Formalism and Pragmatism
inferred← citeshttps://doi.org/10.1007/978-1-4899-0548-2_9openalex-snapshot
Reductions of Theories for Analysis
inferred← citeshttps://doi.org/10.1007/978-3-031-19685-0_2openalex-snapshot
On Some Algebraic Ways to Calculate Zeros of the Riemann Zeta Function
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-3-319-41842-1_2openalex-snapshot
Martin Davis and Hilbert’s Tenth Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-21963-8_6openalex-snapshot
A bottom-up approach to foundations of mathematics
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_32openalex-snapshot
An Algorithmic Approach to the Existence of Ideal Objects in Commutative Algebra
inferred← citeshttps://doi.org/10.1007/978-94-011-2496-6_5openalex-snapshot
Working Foundations - ’ 91
inferred← citeshttps://doi.org/10.1007/bf01388465openalex-snapshot
A continuous, constructive solution to Hilbert's 17th problem
inferred← citeshttps://doi.org/10.1007/bf03024381openalex-snapshot
What does logic have to tell us about mathematical proofs?
inferred← citeshttps://doi.org/10.1007/bfb0014559openalex-snapshot
“Classical” programming-with-proofs in λSymPA: An analysis of non-confluence
inferred← citeshttps://doi.org/10.1007/bfb0037097openalex-snapshot
Extracting constructive content from classical logic via control-like reductions
inferred← citeshttps://doi.org/10.1007/s10992-026-09839-5openalex-snapshot
On the Methodology of Informal Rigour: Set Theory, Semantics, and Intuitionism
inferred← citeshttps://doi.org/10.1007/s11229-004-6294-3openalex-snapshot
Notes on Constructive Negation
inferred← citeshttps://doi.org/10.1007/s11245-025-10337-7openalex-snapshot
Hilbert’s Programme and Georg Kreisel I: The Post-Gödelian Perspective
inferred← citeshttps://doi.org/10.1007/s11787-012-0061-xopenalex-snapshot
Jean van Heijenoort’s Contributions to Proof Theory and Its History
inferred← citeshttps://doi.org/10.1016/0020-0255(69)90016-4openalex-snapshot
Strong representability of partial functions in arithmetic theories
inferred← citeshttps://doi.org/10.1016/0168-0072(92)90066-9openalex-snapshot
On the idea(1) of logical closure
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00004-zopenalex-snapshot
A strong normalization result for classical logic
inferred← citeshttps://doi.org/10.1016/b978-0-7204-2233-7.50054-xopenalex-snapshot
A BIBLIOGRAPHY OF THE THEORY OF MODELS
inferred← citeshttps://doi.org/10.1016/j.jnt.2011.01.017openalex-snapshot
Diophantine equations and the generalized Riemann hypothesis
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.028openalex-snapshot
The Riemann Hypothesis in computer science
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70854-1openalex-snapshot
Notions of Realizability for Intuitionistic Arithmetic and Intuitionistic Arithmetic in all Finite Types
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71124-8openalex-snapshot
Proof Theory: Some Applications of Cut-Elimination
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71127-3openalex-snapshot
Aspects of Constructive Mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71875-5openalex-snapshot
Herbrand's Theorem and Proof-Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71878-0openalex-snapshot
Case Distinctions are Necessary for Representing polynomials as Sums of Squares
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71953-0openalex-snapshot
Elimination of Higher type Levels in Definitions of Primitive Recursive Functionals by Means of Transfinite Recursion
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70161-2openalex-snapshot
Intuitionistic formal systems
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70422-7openalex-snapshot
On the Kind of Data Needed for A Theory of Proofs
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70587-7openalex-snapshot
Foundations of Intuitionistic Logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00776-4openalex-snapshot
Dependent choice, ‘quote’ and the clock
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70007-xopenalex-snapshot
The Logic of Brouwer and Heyting
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70009-3openalex-snapshot
Jacques Herbrand: Life, Logic, and Automated Deduction
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.1017/9781316591321openalex-snapshot
Quine, New Foundations, and the Philosophy of Set Theory
inferred← citeshttps://doi.org/10.1017/9781316591321.003openalex-snapshot
Cantor and the Early Development of Set Theory
inferred← citeshttps://doi.org/10.1017/9781316591321.004openalex-snapshot
Cantor, Russell, and Zermelo and the Set-Theoretic Paradoxes
inferred← citeshttps://doi.org/10.1017/9781316591321.005openalex-snapshot
New Foundations and the Beginnings of Quine’s Philosophy of Set Theory
inferred← citeshttps://doi.org/10.1017/9781316591321.006openalex-snapshot
Quine’s Philosophy of Set Theory
inferred← citeshttps://doi.org/10.1017/9781316591321.007openalex-snapshot
Clarifying Our Conceptual Scheme: Set Theory and the Role of Explication
inferred← citeshttps://doi.org/10.1017/9781316591321.008openalex-snapshot
The Iterative Conception and Set Theory
inferred← citeshttps://doi.org/10.1017/9781316591321.009openalex-snapshot
New Foundations, the Axiom of Choice, and Arithmetic
inferred← citeshttps://doi.org/10.1017/9781316716939.007openalex-snapshot
A bottom-up approach to foundations of mathematics
inferred← citeshttps://doi.org/10.1017/9781316716939.008openalex-snapshot
K-graph Machines: generalizing Turing's machines and arguments
inferred← citeshttps://doi.org/10.1017/cbo9780511569807.014openalex-snapshot
Finding computational content in classical proofs
inferred← citeshttps://doi.org/10.1017/s096012950100336xopenalex-snapshot
Locus Solum: From the rules of logic to the logic of rules
inferred← citeshttps://doi.org/10.1017/s1755020316000411openalex-snapshot
THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
inferred← citeshttps://doi.org/10.1023/a:1005033725849openalex-snapshot
Simplicity and Incompleteness
inferred← citeshttps://doi.org/10.1023/a:1005268531418openalex-snapshot
Alfred Tarski: Semantic Shift, Heuristic Shift In Metamathematics
inferred← citeshttps://doi.org/10.1080/00029890.1969.12000392openalex-snapshot
Weak and Strong Induction
inferred← citeshttps://doi.org/10.1090/s0002-9904-1965-11325-8openalex-snapshot
“Recursive isomorphism” and effectively extensible theories
inferred← citeshttps://doi.org/10.1090/s0002-9904-1965-11328-3openalex-snapshot
Report on attainability of systems of identities
inferred← citeshttps://doi.org/10.1090/s0002-9904-1967-11689-6openalex-snapshot
Deduction-preserving “recursive isomorphisms” between theories
inferred← citeshttps://doi.org/10.1090/s0002-9904-1977-14334-6openalex-snapshot
Abraham Robinson, 1918-1974
inferred← citeshttps://doi.org/10.1090/s0002-9947-1965-0175771-6openalex-snapshot
Theory of Provable Recursive Functions
inferred← citeshttps://doi.org/10.1093/logcom/exaa019openalex-snapshot
The unreasonable effectiveness of Nonstandard Analysis
inferred← citeshttps://doi.org/10.1093/philmat/nkaf005openalex-snapshot
Artificial Intelligence and Inherent Mathematical Difficulty
inferred← citeshttps://doi.org/10.1109/lics.1991.151634openalex-snapshot
An evaluation semantics for classical proofs
inferred← citeshttps://doi.org/10.1109/lics.1996.561323openalex-snapshot
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations
inferred← citeshttps://doi.org/10.1111/phpr.70027openalex-snapshot
The philosophical significance of Gödel's Dialectica interpretation
inferred← citeshttps://doi.org/10.1134/s0081543811080074openalex-snapshot
What can and cannot be done with Diophantine problems
inferred← citeshttps://doi.org/10.1134/s1064562422700247openalex-snapshot
The Riemann Hypothesis As the Parity of Special Binomial Coefficients
inferred← citeshttps://doi.org/10.11429/sugaku1947.48.372openalex-snapshot
数学基礎論的手法の計算量理論への応用(付 : 数学他分野との関連)
inferred← citeshttps://doi.org/10.1184/r1/6490676openalex-snapshot
"Clarifying the Nature of the Infinite": the Development of Metamathematics and Proof Theory
inferred← citeshttps://doi.org/10.1215/9780822380443-002openalex-snapshot
The Mathematical Present as History
inferred← citeshttps://doi.org/10.1215/9780822380443-003openalex-snapshot
The Method of Proofs and Refutations
inferred← citeshttps://doi.org/10.1215/9780822380443-005openalex-snapshot
Between Formal and Informal
inferred← citeshttps://doi.org/10.1215/9780822380443-007openalex-snapshot
Kuhn, Popper, Feyerabend, Lakatos
inferred← citeshttps://doi.org/10.1215/9780822380443-008openalex-snapshot
A Historiographical Toolkit
inferred← citeshttps://doi.org/10.1215/9780822380443-009openalex-snapshot
Contradiction and Hindsight
inferred← citeshttps://doi.org/10.1215/9780822380443-012openalex-snapshot
Classical Political Economy as a Research Programme
inferred← citeshttps://doi.org/10.1215/9780822380443-013openalex-snapshot
Hungary 1956 and the Inverted World
inferred← citeshttps://doi.org/10.1305/ndjfl/1039886522openalex-snapshot
A Constructive Valuation Semantics for Classical Logic
inferred← citeshttps://doi.org/10.1305/ndjfl/1093893356openalex-snapshot
On provable recursive functions.
inferred← citeshttps://doi.org/10.1515/9781400871346openalex-snapshot
Two Applications of Logic to Mathematics
inferred← citeshttps://doi.org/10.1515/dmvm-2025-0054openalex-snapshot
On open questions, artificial intelligence, and mathematical difficulty: A précis
inferred← citeshttps://doi.org/10.2139/ssrn.3638937openalex-snapshot
A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory
inferred← citeshttps://doi.org/10.2139/ssrn.3644960openalex-snapshot
The Quantum Strategy of Completeness: On the Self-Foundation of Mathematics
inferred← citeshttps://doi.org/10.22405/2226-8383-2018-19-3-46-60openalex-snapshot
Гипотеза Римана как чётность биномиальных коэффициентов
inferred← citeshttps://doi.org/10.2307/2272821openalex-snapshot
Some relations between classical and constructive mathematics
inferred← citeshttps://doi.org/10.2307/2274322openalex-snapshot
Syntactic translations and provably recursive functions
inferred← citeshttps://doi.org/10.2307/2275028openalex-snapshot
Herbrand-Analysen zweier Beweise des Satzes von Roth: Polynomiale Anzahlschranken
inferred← citeshttps://doi.org/10.2307/2275402openalex-snapshot
Machine learning of higher-order programs
inferred← citeshttps://doi.org/10.2307/2275884openalex-snapshot
Minimal readability of intuitionistic arithmetic and elementary analysis
inferred← citeshttps://doi.org/10.2307/2586791openalex-snapshot
On the No-Counterexample Interpretation
inferred← citeshttps://doi.org/10.2307/j.ctt130hk3wopenalex-snapshot
Two Applications of Logic to Mathematics
inferred← citeshttps://doi.org/10.2307/j.ctv1220pnn.6openalex-snapshot
The Mathematical Present as History
inferred← citeshttps://doi.org/10.2977/prims/1195190375openalex-snapshot
A Foundation of Finite Mathematics
inferred← citeshttps://doi.org/10.4288/jafpos.16.1-2_1openalex-snapshot
Some Remarks on a Difference between Gentzen's Finitist and Heyting's Intuitionist Approaches toward Intuitionistic Logic and Arithmetic
inferred← citeshttps://doi.org/10.7146/brics.v4i42.18968openalex-snapshot
On the No-Counterexample Interpretation
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.