On the public citation graph
Systems of predicative analysis
0 signed · 377 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.1002/malq.19590051403openalex-snapshot
Ordinal Numbers and Predicative Set Theory
inferredcites →https://doi.org/10.1007/bf01361109openalex-snapshot
Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen
inferredcites →https://doi.org/10.1007/bf01972460openalex-snapshot
Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7095-8openalex-snapshot
A SURVEY OF MATHEMATICAL LOGIC
inferredcites →https://doi.org/10.1016/s1385-7258(62)50029-2openalex-snapshot
The Axiom of Choice and the Class of Hyperarithmetic Functions
inferredcites →https://doi.org/10.1017/cbo9781139171519.024openalex-snapshot
Russell's mathematical logic
inferredcites →https://doi.org/10.1090/pspum/005/0154801openalex-snapshot
Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics
inferredcites →https://doi.org/10.1090/s0002-9904-1955-09896-3openalex-snapshot
Hierarchies of number-theoretic predicates
inferredcites →https://doi.org/10.1090/s0002-9947-1908-1500814-9openalex-snapshot
Continuous Increasing Functions of Finite and Transfinite Ordinals
inferredcites →https://doi.org/10.1090/s0002-9947-1962-0142453-3openalex-snapshot
Classifications of Recursive Functions by Means of Hierarchies
inferredcites →https://doi.org/10.2307/2371894openalex-snapshot
On the Forms of the Predicates in the Theory of Constructive Ordinals
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.2307/2964572openalex-snapshot
Constructive definition of certain analytic sets of numbers
inferredcites →https://doi.org/10.2307/2964649openalex-snapshot
Transfinite recursive progressions of axiomatic theories
inferredcites →https://doi.org/10.2969/jmsj/00730249openalex-snapshot
On the fundamental conjecture of $GLC$ I.
inferredcites →https://doi.org/10.2969/jmsj/01340333openalex-snapshot
On the inductive definition with quantifiers of second order
inferredcites →https://doi.org/10.3792/pja/1195523627openalex-snapshot
On the fundamental conjecture of GLC, VI
inferredcites →https://doi.org/10.4064/fm-41-2-311-338openalex-snapshot
Elementarily definable analysis
inferredcites →https://doi.org/10.4099/jjm1924.28.0_1openalex-snapshot
Sur les Ensembles Nommables et le Fondement de l' Analyse Mathématique, I
inferredcites →https://doi.org/10.5840/thought194520130openalex-snapshot
The Philosophy of Bertrand Russell
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.19700160205openalex-snapshot
The Hyperprojective Hierarchy
inferred← citeshttps://doi.org/10.1002/malq.19710170144openalex-snapshot
An Extension of the Hyperprojective Hierarchy
inferred← citeshttps://doi.org/10.1002/malq.19720180403openalex-snapshot
Some Properties of the Extended Hyperprojective Hierarchy
inferred← citeshttps://doi.org/10.1002/malq.19740202803openalex-snapshot
Predicative Expansions of Axiomatic Theories
inferred← citeshttps://doi.org/10.1002/malq.19750210158openalex-snapshot
A note on the predicatively definable sets of N. N. Nepeîvoda
inferred← citeshttps://doi.org/10.1002/malq.19820281406openalex-snapshot
Calculation of an Order Type: An application of Non‐Standard Methods
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_126openalex-snapshot
IMPS : An interactive mathematical proof system
inferred← citeshttps://doi.org/10.1007/978-1-4612-2566-9_2openalex-snapshot
Predicative Recursion and The Polytime Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-030-19071-2_95-1openalex-snapshot
Finding a Fit Among Philosophical Finitisms
inferred← citeshttps://doi.org/10.1007/978-3-030-20447-1_12openalex-snapshot
From Mathesis Universalis to Provability, Computability, and Constructivity
inferred← citeshttps://doi.org/10.1007/978-3-030-30229-0_13openalex-snapshot
Well-Partial Orderings and their Maximal Order Types
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_10openalex-snapshot
The Limits of Predicativity Revisited
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_6openalex-snapshot
Reminiscences of Kurt Schütte
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_9openalex-snapshot
Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$
inferred← citeshttps://doi.org/10.1007/978-3-030-65824-3_2openalex-snapshot
Operation and Predicativity: Lorenzen’s Approach to Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-030-65824-3_4openalex-snapshot
Lorenzen and Constructive Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-030-77799-9_4openalex-snapshot
Well-Ordering Principles in Proof Theory and Reverse Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-030-84706-7_11openalex-snapshot
Predicativity and Constructive Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-030-88853-4_11openalex-snapshot
Analysis in a Formal Predicative Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-40846-5_95openalex-snapshot
Finding a Fit Among Philosophical Finitisms
inferred← citeshttps://doi.org/10.1007/978-3-031-54557-3_10openalex-snapshot
Perspectives on the Universe
inferred← citeshttps://doi.org/10.1007/978-3-031-54557-3_9openalex-snapshot
Mathematical Naturalism and Revisionism About Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-031-62387-5_11openalex-snapshot
What Is Forcing Potentialism?
inferred← citeshttps://doi.org/10.1007/978-3-0348-8278-1_10openalex-snapshot
Foundations of Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-00119-7_7openalex-snapshot
Consistency, Truth and Existence
inferred← citeshttps://doi.org/10.1007/978-3-319-09719-0_5openalex-snapshot
A Fortuitous Year with Leon Henkin
inferred← citeshttps://doi.org/10.1007/978-3-319-10434-8_8openalex-snapshot
Constructibility and Geometry
inferred← citeshttps://doi.org/10.1007/978-3-319-22156-4_9openalex-snapshot
Proof Theoretic Analysis by Iterated Reflection
inferred← citeshttps://doi.org/10.1007/978-3-319-28582-5_10openalex-snapshot
Diversity in Proof Appraisal
inferred← citeshttps://doi.org/10.1007/978-3-319-29198-7_7openalex-snapshot
The Operational Perspective: Three Routes
inferred← citeshttps://doi.org/10.1007/978-3-319-29198-7_9openalex-snapshot
From Subsystems of Analysis to Subsystems of Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-31644-4_14openalex-snapshot
More on Systems of Truth and Predicative Comprehension
inferred← citeshttps://doi.org/10.1007/978-3-319-42120-9_1openalex-snapshot
Part I: A sketch of Gentzen’s life and work
inferred← citeshttps://doi.org/10.1007/978-3-319-42120-9_3openalex-snapshot
Part III: The original writings
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3openalex-snapshot
Feferman on Foundations - Logic, Mathematics, Philosophy
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_14openalex-snapshot
Proof Theory of Constructive Systems: Inductive Types and Univalence
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_15openalex-snapshot
Predicativity and Feferman
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_19openalex-snapshot
Feferman on Set Theory: Infinity up on Trial
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_20openalex-snapshot
Feferman’s Skepticism About Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_8openalex-snapshot
Unfolding Schematic Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-72056-2_3openalex-snapshot
A Minimal Computational Theory of a Minimal Computational Universe
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_48openalex-snapshot
Binary Trees and (Maximal) Order Types
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_65openalex-snapshot
Theories and Ordinals: Ordinal Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_50openalex-snapshot
A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
inferred← citeshttps://doi.org/10.1007/978-3-662-21963-8_1openalex-snapshot
Gödel’s program for new axioms: Why, where, how and what?
inferred← citeshttps://doi.org/10.1007/978-3-662-22108-2_16openalex-snapshot
The Higher Infinite in Proof Theory
inferred← citeshttps://doi.org/10.1007/978-3-7091-6597-3_4openalex-snapshot
Turing in the Land of 0(z)
inferred← citeshttps://doi.org/10.1007/978-94-007-6534-4_6openalex-snapshot
An Argumentative Approach to Ideal Elements in Mathematics
inferred← citeshttps://doi.org/10.1007/978-94-009-2721-6_3openalex-snapshot
Motivating Ramified Type Theory
inferred← citeshttps://doi.org/10.1007/978-94-010-1999-6_13openalex-snapshot
On The Phenomenological Foundations of Mathematics
inferred← citeshttps://doi.org/10.1007/978-94-011-2496-6_5openalex-snapshot
Working Foundations - ’ 91
inferred← citeshttps://doi.org/10.1007/978-94-015-8273-5_8openalex-snapshot
Hilbert’s Program: Incompleteness Theorems vs. Partial Realizations
inferred← citeshttps://doi.org/10.1007/978-94-017-1592-8_10openalex-snapshot
Foundations for Analysis and Proof Theory
inferred← citeshttps://doi.org/10.1007/978-94-017-2109-7_3openalex-snapshot
Carnap’s Remarks on Impredicative Definitions and the Genericity Theorem
inferred← citeshttps://doi.org/10.1007/978-94-017-2796-9_10openalex-snapshot
Relationships between Constructive, Predicative and Classical Systems of Analysis
inferred← citeshttps://doi.org/10.1007/978-981-13-9949-7_1openalex-snapshot
Introduction and Preliminaries
inferred← citeshttps://doi.org/10.1007/978-981-16-4173-2_5openalex-snapshot
On Takeuti’s Early View of the Concept of Set
inferred← citeshttps://doi.org/10.1007/bf00485460openalex-snapshot
Foundations for analysis and proof theory
inferred← citeshttps://doi.org/10.1007/bf00485564openalex-snapshot
Representation, intentionality, and quantifiers
inferred← citeshttps://doi.org/10.1007/bf00881906openalex-snapshot
IMPS: An interactive mathematical proof system
inferred← citeshttps://doi.org/10.1007/bf01052728openalex-snapshot
Predicative foundations of arithmetic
inferred← citeshttps://doi.org/10.1007/bf01084980openalex-snapshot
Theory of proofs (arithmetic and analysis)
inferred← citeshttps://doi.org/10.1007/bf01147475openalex-snapshot
A new concept of predicative truth and definability
inferred← citeshttps://doi.org/10.1007/bf01404103openalex-snapshot
A majorizing semantics for hyperarithmetic sentences
inferred← citeshttps://doi.org/10.1007/bf01641707openalex-snapshot
Beweistheoretische Abgrenzung von Teilsystemen der Analysis
inferred← citeshttps://doi.org/10.1007/bf02007255openalex-snapshot
Eine Funktionalinterpretation der prädikativen Analysis
inferred← citeshttps://doi.org/10.1007/bf02007556openalex-snapshot
Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume
inferred← citeshttps://doi.org/10.1007/bf02011638openalex-snapshot
Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1
inferred← citeshttps://doi.org/10.1007/bf02485393openalex-snapshot
An ordinal bound for the set of polynomial functions with exponentiation
inferred← citeshttps://doi.org/10.1007/bf02564515openalex-snapshot
On the Finsler and Doner-Tarski arithmetical hierarchies
inferred← citeshttps://doi.org/10.1007/bf02566881openalex-snapshot
Über die FINSLERschen höheren arithmetischen Operationen
inferred← citeshttps://doi.org/10.1007/bf02671612openalex-snapshot
Infinite arithmetic formulas and the reflection principle
inferred← citeshttps://doi.org/10.1007/bfb0062852openalex-snapshot
A language and axioms for explicit mathematics
inferred← citeshttps://doi.org/10.1007/bfb0079691openalex-snapshot
Normal derivability in classical logic
inferred← citeshttps://doi.org/10.1007/bfb0080977openalex-snapshot
Impredicativity of the existence of the largest divisible subgroup of an Abelian p-group
inferred← citeshttps://doi.org/10.1007/s00029-025-01071-4openalex-snapshot
On inverse Goodstein sequences
inferred← citeshttps://doi.org/10.1007/s00153-002-0158-7openalex-snapshot
Proof-theoretic analysis by iterated reflection
inferred← citeshttps://doi.org/10.1007/s00153-004-0232-4openalex-snapshot
An ordinal analysis of parameter free ?12-comprehension
inferred← citeshttps://doi.org/10.1007/s00153-009-0170-2openalex-snapshot
An ordinal analysis for theories of self-referential truth
inferred← citeshttps://doi.org/10.1007/s00153-014-0392-9openalex-snapshot
From hierarchies to well-foundedness
inferred← citeshttps://doi.org/10.1007/s10670-009-9179-5openalex-snapshot
Predicativity and Structuralism in Dedekind’s Construction of the Reals
inferred← citeshttps://doi.org/10.1007/s10670-018-9987-6openalex-snapshot
The Implicit Commitment of Arithmetical Theories and Its Semantic Core
inferred← citeshttps://doi.org/10.1007/s10670-020-00296-3openalex-snapshot
The Modal Logic of Potential Infinity: Branching Versus Convergent Possibilities
inferred← citeshttps://doi.org/10.1007/s10670-022-00516-yopenalex-snapshot
Cognitive Projects and the Trustworthiness of Positive Truth
inferred← citeshttps://doi.org/10.1007/s10670-025-00985-xopenalex-snapshot
Implicit Commitments, Epistemic Stability, and the Acceptability of Consistency
inferred← citeshttps://doi.org/10.1007/s10992-015-9375-5openalex-snapshot
Predicativity, the Russell-Myhill Paradox, and Church’s Intensional Logic
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/s11098-018-1115-6openalex-snapshot
Reply to Crispin Wright and Richard Zach
inferred← citeshttps://doi.org/10.1007/s11225-017-9727-yopenalex-snapshot
Provably True Sentences Across Axiomatizations of Kripke’s Theory of Truth
inferred← citeshttps://doi.org/10.1007/s11229-005-3718-7openalex-snapshot
TRUTH, REFLECTION, AND HIERARCHIES
inferred← citeshttps://doi.org/10.1007/s11229-019-02234-5openalex-snapshot
Functional explanation in mathematics
inferred← citeshttps://doi.org/10.1007/s11229-022-03816-6openalex-snapshot
Gaps, gluts, and theoretical equivalence
inferred← citeshttps://doi.org/10.1007/s11229-023-04443-5openalex-snapshot
Definite totalities and determinate truth in conceptual structuralism
inferred← citeshttps://doi.org/10.1007/s11229-023-04465-zopenalex-snapshot
Components of arithmetic theory acceptance
inferred← citeshttps://doi.org/10.1007/s11787-012-0055-8openalex-snapshot
Jean van Heijenoort’s Conception of Modern Logic, in Historical Perspective
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90346-4openalex-snapshot
Fast growing functions based on Ramsey theorems
inferred← citeshttps://doi.org/10.1016/0168-0072(83)90012-xopenalex-snapshot
Countable algebra and set existence axioms11Research partially supported by NSF grants MCS-79-23743, MCS-78-02558, and MCS 8107867. Simpson's research was also supported by an Alfred P. Sloan Research Fellowship.
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90022-eopenalex-snapshot
What's so special about Kruskal's theorem and the ordinal Γo? A survey of some results in proof theory
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90031-8openalex-snapshot
Subsystems of true arithmetic and hierarchies of functions
inferred← citeshttps://doi.org/10.1016/b978-0-12-386980-7.50006-xopenalex-snapshot
Systems of Logic Based on Ordinals
inferred← citeshttps://doi.org/10.1016/b978-0-444-51555-1.50008-0openalex-snapshot
EMPIRICISM IN THE PHILOSOPHY OF MATHEMATICS
inferred← citeshttps://doi.org/10.1016/b978-0-444-51555-1.50012-2openalex-snapshot
CONSTRUCTIVISM IN MATHEMATICS
inferred← citeshttps://doi.org/10.1016/b978-0-444-51621-3.50011-6openalex-snapshot
Russell's Orders in Kripke's Theory of Truth and Computational Type 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/b978-044450813-3/50017-5openalex-snapshot
Classical Type Theory
inferred← citeshttps://doi.org/10.1016/j.aim.2022.108265openalex-snapshot
Minimal bad sequences are necessary for a uniform Kruskal theorem
inferred← citeshttps://doi.org/10.1016/j.apal.2007.03.004openalex-snapshot
A comparison of well-known ordinal notation systems for ε0
inferred← citeshttps://doi.org/10.1016/j.apal.2013.01.002openalex-snapshot
Hyperations, Veblen progressions and transfinite iteration of ordinal functions
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102890openalex-snapshot
Derivatives of normal functions in reverse mathematics
inferred← citeshttps://doi.org/10.1016/j.apal.2022.103093openalex-snapshot
Reflection algebras and conservation results for theories of iterated truth
inferred← citeshttps://doi.org/10.1016/j.apal.2023.103355openalex-snapshot
Generalized fusible numbers and their ordinals
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104758openalex-snapshot
Deducibility and independence in Beklemishev's autonomous provability calculus
inferred← citeshttps://doi.org/10.1016/j.shpsa.2010.03.005openalex-snapshot
Poincaréan intuition revisited: what can we learn from Kant and Parsons?
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70121-6openalex-snapshot
On the Foundations of Mathematics in 1987
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70131-9openalex-snapshot
Some Aspects of Impredicativity
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70270-2openalex-snapshot
Finitary inductively presented logics
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70761-4openalex-snapshot
Formal Theories for Transfinite Iterations of Generalized Inductive Definitions and Some Subsystems of Analysis
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70772-9openalex-snapshot
Applications of the Cut Elimination Theorem to Some Subsystems of Classical Analysis
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70773-0openalex-snapshot
Principles of Proof and Ordinals Implicit in Given Concepts
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70845-0openalex-snapshot
A Survey of Proof Theory II
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71190-xopenalex-snapshot
Autonomous Transfinite Progressions and the Extent of Predicative Mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71192-3openalex-snapshot
Functions, Ordinals, Species
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71364-8openalex-snapshot
Iterated Inductive Fixed-Point Theories: Application to Hancock's Conjecture
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71365-xopenalex-snapshot
A Finite Combinatorial Principle Which is Equivalent to the 1-Consistency of Predicative Analysis
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71689-6openalex-snapshot
Infinitely Long Terms of Transfinite Type
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71945-1openalex-snapshot
An Intuitionistic Theory of Types: Predicative Part
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70156-9openalex-snapshot
Nonprovability of Certain Combinatorial Properties of Finite Trees
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70158-2openalex-snapshot
Friedman's Research on Subsystems of Second Order Arithmetic
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70553-1openalex-snapshot
Some Proof-Theoretic Contributions to Theories of Sets
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80013-xopenalex-snapshot
Chapter 12 A bibliography of recursive analysis and recursive topology
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80018-9openalex-snapshot
Hierarchies of Provably Recursive Functions
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80019-0openalex-snapshot
Subsystems of Set Theory and Second Order Number Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80020-7openalex-snapshot
Gödel’s Functional (“Dialectica”) Interpretation
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00016-6openalex-snapshot
The non-constructive μ operator, fixed point theories with ordinals, and the bar rule
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00066-0openalex-snapshot
Ordinal notations and well-orderings in bounded arithmetic
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70020-2openalex-snapshot
Paradoxes, Self-Reference and Truth in the 20th Century
inferred← citeshttps://doi.org/10.1017/9781108657419.002openalex-snapshot
Structuralism without Structures
inferred← citeshttps://doi.org/10.1017/9781108657419.008openalex-snapshot
Predicative Foundations of Arithmetic
inferred← citeshttps://doi.org/10.1017/9781108657419.009openalex-snapshot
Challenges to Predicative Foundations of Arithmetic
inferred← citeshttps://doi.org/10.1017/9781316716830.019openalex-snapshot
The Higher Infinite in Proof Theory
inferred← citeshttps://doi.org/10.1017/9781316716939.002openalex-snapshot
Gödel's program for new axioms: Why, where, how and what?
inferred← citeshttps://doi.org/10.1017/9781316755884.011openalex-snapshot
Metapredicative and explicit Mahlo: a proof-theoretic perspective
inferred← citeshttps://doi.org/10.1017/9781316755983.004openalex-snapshot
Internal finite tree embeddings
inferred← citeshttps://doi.org/10.1017/9781316755983.007openalex-snapshot
Predicativity: The outer limits
inferred← citeshttps://doi.org/10.1017/bsl.2015.39openalex-snapshot
THE STRENGTH OF ABSTRACTION WITH PREDICATIVE COMPREHENSION
inferred← citeshttps://doi.org/10.1017/bsl.2017.27openalex-snapshot
IN MEMORIAM: SOLOMON FEFERMAN (1928–2016)
inferred← citeshttps://doi.org/10.1017/bsl.2020.23openalex-snapshot
WEYL REEXAMINED: “DAS KONTINUUM” 100 YEARS LATER
inferred← citeshttps://doi.org/10.1017/bsl.2021.30openalex-snapshot
GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION
inferred← citeshttps://doi.org/10.1017/bsl.2024.2openalex-snapshot
POINCARÉ–WEYL’S PREDICATIVITY: GOING BEYOND $\Gamma _{0}$
inferred← citeshttps://doi.org/10.1017/cbo9780511498534openalex-snapshot
Mathematical Thought and its Objects
inferred← citeshttps://doi.org/10.1017/cbo9780511570681.017openalex-snapshot
Challenges to Predicative Foundations of Arithmetic
inferred← citeshttps://doi.org/10.1017/cbo9780511750762.008openalex-snapshot
The Gödel hierarchy and reverse mathematics
inferred← citeshttps://doi.org/10.1017/jsl.2015.32openalex-snapshot
FRAGMENTS OF FREGE’SGRUNDGESETZEAND GÖDEL’S CONSTRUCTIBLE UNIVERSE
inferred← citeshttps://doi.org/10.1017/jsl.2017.30openalex-snapshot
PREDICATIVITY THROUGH TRANSFINITE REFLECTION
inferred← citeshttps://doi.org/10.1017/jsl.2018.6openalex-snapshot
A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC
inferred← citeshttps://doi.org/10.1017/s0012217300050034openalex-snapshot
Logique mathématique et philosophie des mathématiques
inferred← citeshttps://doi.org/10.1017/s0022481200028309openalex-snapshot
Partial realizations of Hilbert's program
inferred← citeshttps://doi.org/10.1017/s0022481200028310openalex-snapshot
Hilbert's program relativized; Proof-theoretical and foundational reductions
inferred← citeshttps://doi.org/10.1017/s0022481200051501openalex-snapshot
Normal functions and constructive ordinal notations
inferred← citeshttps://doi.org/10.1017/s1079898600010660openalex-snapshot
Interpretability in Robinson's Q
inferred← citeshttps://doi.org/10.1017/s1755020313000178openalex-snapshot
WHAT CAN A CATEGORICITY THEOREM TELL US?
inferred← citeshttps://doi.org/10.1017/s1755020316000411openalex-snapshot
THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
inferred← citeshttps://doi.org/10.1017/s1755020316000435openalex-snapshot
EQUIVALENCES FOR TRUTH PREDICATES
inferred← citeshttps://doi.org/10.1017/s1755020321000137openalex-snapshot
NONCLASSICAL TRUTH WITH CLASSICAL STRENGTH. A PROOF-THEORETIC ANALYSIS OF COMPOSITIONAL TRUTH OVER HYPE
inferred← citeshttps://doi.org/10.1017/s1755020321000423openalex-snapshot
PREDICATIVISM AS A FORM OF POTENTIALISM
inferred← citeshttps://doi.org/10.1017/s1755020321000538openalex-snapshot
SZEMERÉDI’S THEOREM: AN EXPLORATION OF IMPURITY, EXPLANATION, AND CONTENT
inferred← citeshttps://doi.org/10.1017/s1755020324000297openalex-snapshot
THE GENERIC MULTIVERSE IS NOT GOING AWAY
inferred← citeshttps://doi.org/10.1023/a:1011286100450openalex-snapshot
A Correspondence between Martin-Löf Type Theory, the Ramified Theory of Types and Pure Type Systems
inferred← citeshttps://doi.org/10.1080/01445340.2024.2375182openalex-snapshot
A Neglected Interpretation of Das Kontinuum
inferred← citeshttps://doi.org/10.1086/712942openalex-snapshot
Why Did Weyl Think That Emmy Noether Made Algebra the Eldorado of Axiomatics?
inferred← citeshttps://doi.org/10.1086/psaprocbienmeetp.1992.2.192856openalex-snapshot
Why a Little Bit Goes a Long Way: Logical Foundations of Scientifically Applicable Mathematics
inferred← citeshttps://doi.org/10.1090/proc/14813openalex-snapshot
Predicatively unprovable termination of the Ackermannian Goodstein process
inferred← citeshttps://doi.org/10.1090/s0002-9904-1966-11509-4openalex-snapshot
Predicative provability in set theory
inferred← citeshttps://doi.org/10.1093/0198250754.001.0001openalex-snapshot
Naturalism in Mathematics
showing the first 200 of 349 · page through all 349
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.