Pith. sign in

REVIEW 2 major objections 4 minor 1 cited by

Plato and the foundations of mathematics

T0 review · 2 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A single higher-order axiom, BOOT, is equivalent to the monotone convergence theorem for nets and, under the ECF-translation, becomes arithmetical comprehension, anchoring a hierarchy that maps to the Big Five of reverse mathematics.

desk verdict Solid higher-order reverse mathematics: the BOOT/MCTC_net equivalences are genuine and the proofs look right; the only real caveat is that the 'maps to the Big Five' slogan depends on the ECF coding convention, which the paper itself qualifies in Remark 1.1. read the letter →

arxiv 1908.05676 v6 pith:ZQ5IMAY2 submitted 2019-08-15 math.LO

Sam Sanders This is my paper · ORCID
classification math.LO MSC 03B3003D6503F35
keywords reversemathematicshigher-orderarithmeticnetsMoore-SmithsequencesbootstrapaxiomECF-translationBigFiveneighbourhoodfunctionprinciple
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper aims to show that the Big Five systems of second-order reverse mathematics are not the ground floor of foundations: they are the reflections, under a coding translation called ECF, of a hierarchy of principles stated in higher-order arithmetic. The engine of that hierarchy is the bootstrap axiom BOOT, which asserts that for every functional $Y$ from Baire space to numbers and every number $n$, the set of $n$ for which some $f$ satisfies $Y(f,n)=0$ exists. Over the higher-order base theory $\mathrm{RCA}_0^\omega$, BOOT is proved equivalent to the monotone convergence theorem for increasing nets in Cantor space indexed by subsets of Baire space. This single equivalence generates a parallel hierarchy in which convergence theorems for nets, Heine-Borel compactness for uncountable covers, the gauge integral, and open sets as uncountable unions replace their countable second-order counterparts. If the picture is correct, ordinary reverse mathematics is the ECF-shadow of a richer hierarchy that can be formulated through classically valid continuity principles from intuitionistic mathematics.

What carries the argument

The load-bearing machinery is the bootstrap axiom BOOT, a comprehension principle for type-two functionals, together with the ECF-translation that converts higher-order objects into countable continuous representatives. BOOT supplies the exact set-existence strength; ECF is what turns higher-order equivalences into second-order ones, which is why the Big Five appear on the second-order side. A second piece of machinery is the replacement of sequences by nets indexed by subsets of Baire space: directed sets of finite sequences in Baire space, ordered by inclusion, turn a functional $Y$ into an increasing net whose limit encodes the required set. Later sections add fragments of the neighbourhood function principle, a classically valid continuity schema, to re-express BOOT and Heine-Borel compactness without discontinuous functions.

What would settle it

Build a model of $\mathrm{RCA}_0^\omega$ in which the monotone convergence theorem for increasing nets in Cantor space indexed by subsets of Baire space holds, yet for some type-two functional $Y$ no set $X$ collects exactly the $n$ with $(\exists f^1)(Y(f,n)=0)$; Theorem 3.7 says such a model cannot exist. A forcing or realizability construction producing such a model would refute the central equivalence, and a computational check is whether the Specker-net reversal of Theorem 3.19 can be carried out without countable choice.

Watch

Extended reading notes

Core claim

The paper's central result is Theorem 3.7: over $\mathrm{RCA}_0^\omega$, the monotone convergence theorem for increasing nets in Cantor space indexed by subsets of Baire space, $\mathrm{MCTC}_{\mathrm{net}}$, is equivalent to BOOT. BOOT is the comprehension axiom $(\forall Y^2)(\exists X^1)(\forall n^0)(n\in X \leftrightarrow (\exists f^1)(Y(f,n)=0))$. The proof splits by the law of excluded middle: if the discontinuous existential functional $\exists^2$ is available, the BOOT-set is read off as the limit of an increasing net built from finite initial segments of witnesses; if not, all functionals on Baire space are continuous, and both BOOT and $\mathrm{MCTC}_{\mathrm{net}}$ reduce to arithmetical comprehension. Under ECF, which replaces higher-type objects by countable continuous codes, this equivalence becomes the classical equivalence between the monotone convergence theorem for sequences and $\mathrm{ACA}_0$. The paper further shows that combining these convergence theorems with weak comprehension axioms produces a 'bootstrap' hierarchy, that the hierarchy has natural formulations via the neighbourhood function principle, and that it extends naturally to open sets given by uncountable unions and to index sets beyond Baire space.

Load-bearing premise

The comparison between the higher-order hierarchy and the Big Five depends on treating the ECF-translation, which replaces uncountable objects by countable continuous codes, as the canonical embedding that preserves the intended meaning; if that identification is too lossy, the mathematical equivalences remain but the claim that the Big Five are shadows of the hierarchy weakens.

Editorial extensions

If this is right

  • Over $\mathrm{RCA}_0^\omega$ plus $\Pi^1_k$-comprehension, adding BOOT proves $\Pi^1_{k+1}$-comprehension, so convergence theorems for nets bootstrap to the next comprehension level.
  • The monotone convergence theorem for nets in the unit interval indexed by subsets of Baire space is equivalent to BOOT, and its version with a modulus of convergence is equivalent to BOOT plus countable choice.
  • BOOT implies Heine-Borel compactness for uncountable canonical covers, and the ECF translation of this implication is the classical step from arithmetical comprehension to weak König's lemma.
  • The Cantor-Bendixson and perfect set theorems, formulated for open sets as uncountable unions of open intervals, split into $\Pi^1_1$-comprehension plus BOOT and $\mathrm{ATR}_0$ plus BOOT respectively.
  • Fragments of the neighbourhood function principle are equivalent to BOOT and to Heine-Borel compactness, giving the whole hierarchy a continuity-based formulation.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial inference: if the Plato hierarchy is taken as the intended object, the Big Five are artefacts of choosing countable codes, and one should expect natural theorems of analysis to change their classification when nets and uncountable unions are primitive.
  • Editorial inference: a testable extension is to replace the directed sets of finite sequences in Baire space by other directed sets, such as lexicographic orders on countable ordinals, and compare the resulting monotone convergence principles; the paper's Remark 4.8 already indicates that index-set structure, not cardinality, drives the strength.
  • Editorial inference: the lossiness of ECF, conceded in the paper, suggests that a refined translation preserving more higher-type information could produce intermediate hierarchies between this Plato hierarchy and the Big Five; whether such a translation exists is left open.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper introduces a hierarchy in higher-order arithmetic, called the 'Plato hierarchy', built around the bootstrap comprehension axiom BOOT: (∀Y^2)(∃X^1)(∀n)(n∈X ↔ (∃f^1)(Y(f,n)=0)). Its central result is Theorem 3.7, which proves over RCA_0^ω that the monotone convergence theorem for increasing nets in Cantor space indexed by subsets of Baire space (MCTC_net) is equivalent to BOOT. The paper then derives a series of related equivalences involving the Bolzano-Weierstrass theorem for nets, moduli of convergence, the Moore-Osgood theorem, open sets given by uncountable unions, the Cantor-Bendixson theorem, the perfect set theorem, and Heine-Borel compactness. It also develops fragments of the neighbourhood function principle (NFP) and the axioms A_0, A_1, A_2, and claims that under the ECF translation the Plato hierarchy maps to the Big Five of second-order reverse mathematics.

Significance. If the results hold, this is a substantial contribution to higher-order reverse mathematics: it gives a genuinely new hierarchy based on convergence of nets and continuity principles, rather than on discontinuous functionals as in Kohlenbach's hierarchy. The proof of Theorem 3.7 is detailed and the equivalence MCTC_net ↔ BOOT is a striking and nontrivial result. The Specker-net lifting in Theorem 3.19, which recycles a classical second-order reversal, is also a valuable contribution. The paper is ambitious and will interest researchers in reverse mathematics, higher-order arithmetic, and the foundational interpretation of the Big Five. However, the manuscript's central 'mapping to the Big Five' claim depends on an informal coding convention that is only stated as a remark, and one of the derived equivalences (Corollary 3.14) has a proof gap in the ¬(∃2) case.

major comments (2)
  1. [Section 3.2.2, Corollary 3.14] In the proof of Corollary 3.14, the case ¬(∃2) asserts that QF-AC^{0,1} 'is immediate from QF-AC^{0,0} (included in RCA_0^ω)'. This is not a valid inference: the statement that all functionals on Baire space are continuous does not give a uniform way to select a witness f ∈ N^N for each n, and QF-AC^{0,1} is not a theorem of ACA_0. Since Corollary 3.14 and Corollary 3.16 depend on this step, the authors must either supply a direct proof that CAUmod implies QF-AC^{0,1} in the ¬(∃2) case or weaken the statements of these corollaries.
  2. [Abstract and Section 1.3, Figure 2; Remark 1.1] The paper's central claim that the Plato hierarchy 'maps to' the Big Five under ECF is stronger than what is formally established. Remark 1.1 explicitly concedes that [BOOT]^ECF is not verbatim ACA_0 and that an additional step identifying continuous objects with their countable codes is needed. As stated, Figure 2 invites the reader to read the correspondence as a theorem, but it is an interpretive convention. The paper should state a precise preservation claim, such as: for each equivalence A↔B proved in the hierarchy, RCA_0 proves [A]^ECF↔[B]^ECF up to the coding conventions of Remark 1.1. Alternatively, the 'maps to' formulation should be explicitly downgraded to 'corresponds under ECF plus representation conventions'. The mathematical theorems, including Theorem 3.7, are unaffected by this point, but the paper's title and framing depend on it.
minor comments (4)
  1. [Theorem 3.19 proof] There is a missing closing parenthesis in the definition of the directed set D: the condition should read '(∀i,j<|w|)(Y(w(i))=Y(w(j))→i=j)'. The current text 'Y(w(i) = Y(w(j)))' is a typo.
  2. [Theorem 4.23 proof] In the proof of Theorem 4.23, the text says 'Applying QF-AC^{1,1}, we obtain G : C → N'. Since the choice is of a natural number for each function in C, the principle used should be QF-AC^{1,0}, not QF-AC^{1,1}.
  3. [Remark 4.20] Remark 4.20 states that the generalisation to uncountable unions is '(technically) superfluous' because the open sets used in Section 4.2 can be expressed as countable unions under the mainstream definition of 'countable'. This sits uneasily with Section 4.2's claim that uncountable unions are the 'correct' notion of open set; the authors should clarify how the two statements are to be reconciled.
  4. [Section 2.1, Definition 2.2] The notation QF-AC^{σ,τ} is used systematically, but in the base theory RCA_0^ω only QF-AC^{1,0} is included, while QF-AC^{0,1} is later used as an extra axiom. A short table or explanation fixing which instances are assumed and which are added would help avoid confusion, since the superscript order is easy to misread.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the central BOOT/MCTC_net equivalence is proved directly, and the ECF hierarchy-mapping claim is an explicitly qualified interpretive framing, not a derivation from its own conclusion.

full rationale

The paper's load-bearing mathematical result, Theorem 3.7, proves RCA_0^omega + MCTC_net <-> BOOT by a genuine excluded-middle argument: under (exists^2), the monotone convergence theorem for nets is used to construct the set required by BOOT, and conversely BOOT is used to run the interval-halving construction of the net limit; under not-(exists^2), both principles reduce separately to known second-order equivalents via cited results such as Simpson's [82, III.2]. No parameter is fitted, and neither principle is defined in terms of the other. The claim that ECF maps the Plato hierarchy to the Big Five is explicitly qualified in Remark 1.1, which states that [BOOT]^ECF is 'not verbatim ACA0' and that the mapping requires the standard identification of continuous objects with their countable codes; this is an interpretative convention about ECF, not a circular derivation, and Theorem 3.2 independently shows RCA0 proves ACA0 <-> [BOOT]^ECF. Self-citations to prior work (e.g. [60,63] for the non-provability of HBU) are used as external published results, not as substitutes for the present derivations, and the paper supplies direct proofs for the main new equivalences. The 'correct notion of open set' discussion is justified by criteria (I)-(II) and by the theorems that follow, not by renaming a known result. Overall, no circular step satisfying the required quote-and-reduction standard is present.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

No fitted parameters or invented entities. The paper introduces a named hierarchy and new axioms (BOOT, A0, etc.), but these are logical principles studied for their strength, not entities postulated to explain data. The main background assumptions are the ECF interpretation's role, the continuity/neg(exists^2) fact, and reliance on previously established non-provability results.

assumptions (4)
  • domain assumption The ECF interpretation is the canonical embedding of higher-order arithmetic into second-order arithmetic, and it preserves the intended equivalences.
    The paper's central mapping from the Plato hierarchy to the Big Five depends on ECF. Remark 1.1 admits the translation is not literal: [BOOT]^ECF is not verbatim ACA0, but follows via representing continuous functionals by codes. This makes the mapping interpretive rather than formal.
  • standard math In the absence of (exists^2), all functionals on Baire space are continuous.
    Used repeatedly in case splits (e.g., Theorems 3.7, 3.14, 4.4, 5.16). Cited to Kohlenbach [42, sec.3]. This is an established theorem in higher-order RM.
  • standard math The non-provability results for HBU and BOOT in Z_2^omega + QF-AC^{0,1} hold.
    The paper relies on [60,63] for the claim that HBU (and hence BOOT) is not provable in Z_2^omega + QF-AC^{0,1}. These are published results by the same research group, not proved in this paper.
  • domain assumption The 'correct' notion of open set in higher-order RM is uncountable unions of open balls, rather than characteristic functions.
    Section 4 argues for this choice based on criteria (I) and (II). It is a methodological assumption that drives the equivalences in Section 4, though Remark 4.20 shows the uncountable union can be coded as countable in the usual sense.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Plato and the foundations of mathematics." pith.science (2026). https://pith.science/paper/ZQ5IMAY2

@misc{pith2026190805676,
  author       = {Pith},
  title        = {Pith review of: Plato and the foundations of mathematics},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ZQ5IMAY2}},
  note         = {Machine review of arXiv:1908.05676}
}
read the original abstract

Plato is well-known in mathematics for the eponymous foundational philosophy Platonism based on ideal objects. Plato's allegory of the cave provides a powerful visual illustration of the idea that we only have access to shadows or reflections of these ideal objects. An inquisitive mind might then wonder what the current foundations of mathematics, like e.g. Reverse Mathematics and the associated Goedel hierarchy, are reflections of. In this paper, we identify a hierarchy in higher-order arithmetic that maps to the Big Five of Reverse Mathematics under the canonical embedding of higher-order into second-order arithmetic. Conceptually pleasing, the latter mapping replaces uncountable objects by countable 'codes', i.e. the very practise of formalising mathematics in second-order arithmetic. This higher-order hierarchy can be defined in Hilbert-Bernays' Grundlagen, the spiritual ancestor of second-order arithmetic, while the associated embedding preserves equivalences. Also, in contrast to Kohlenbach's hierarchy based on discontinuity, our hierarchy can be formulated in terms of (classically valid) continuity axioms from Brouwer's intuitionistic mathematics. Moreover, the higher-order counterpart of sequences is provided by nets, aka Moore-Smith sequences, while the gauge integral is the correct generalisation of the Riemann integral. For all these reasons, we baptise our higher-order hierarchy the Plato hierarchy.

Figures

Figures reproduced from arXiv: 1908.05676 by the authors.

Figure 1
Figure 1. The G¨odel hierarchy (taken from [83, p. 111]) We now discuss the systems in [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 3
Figure 3. The G¨odel hierarchy (based on inclusion and higher types) with a parallel branch for the medium range ❄ MCTC net[↔ BOOT] ✲ ❄ Π1 k+1-CA0 ✘✘✘ ✘✘✘ ✘✘✘ ✘✘✘ ✘✘✘ ✘✾ ✲ ✘✘✘✘✿ ✛ ❨ ❜ ❜ ✏✏ ✏✏ ✏✮✏ ✏✏✏✏✏✶ ❜ ❜ Of course, [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 2
Figure 2. We sketch these results in this section for completeness. [PITH_FULL_IMAGE:figures/full_fig_p045_2.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Another higher-order hierarchy mapping to the Big Five Clearly, [PITH_FULL_IMAGE:figures/full_fig_p046_4.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Lifting countable to uncountable mathematics

    math.LO 2019-08 conditional novelty 4.0 of 10

    Reversals and recursive counterexamples from countable mathematics are lifted to higher-order theorems about nets, yielding principles like BOOT from monotone convergence for nets.

Reference graph

Works this paper leans on

97 extracted references · 71 canonical work pages · cited by 1 Pith paper

  1. [1]

    3, Handb

    Samson Abramsky and Achim Jung, Domain theory, Handbook of logic in computer science, Vol. 3, Handb. Log. Comput. Sci., vol. 3, Oxford Univ. Press, 1994, pp. 1–168

    1994

  2. [2]

    Pure Appl

    Toshiyasu Arai, Epsilon substitution method for ID1(Π0 1 ∨ Σ0 1), Ann. Pure Appl. Logic 121 (2003), no. 2-3, 163–208

    2003

  3. [3]

    Dialectica

    Jeremy Avigad and Solomon Feferman, G¨ odel’s functional(“Dialectica”) interpretation, Handbook of proof theory, Stud. Logic Found. Math., vol. 137, 1998, pp. 337–405

    1998

  4. [4]

    Bartle, Nets and filters in topology , Amer

    Robert G. Bartle, Nets and filters in topology , Amer. Math. Monthly 62 (1955), 551–557

    1955

  5. [5]

    , Return to the Riemann integral , Amer. Math. Monthly 103 (1996), no. 8

    1996

  6. [6]

    32, American Mathematical Society, 2001

    , A modern theory of integration, Graduate Studies in Mathematics, vol. 32, American Mathematical Society, 2001

    2001

  7. [7]

    Ralf Beckmann and Anton Deitmar, Two applications of nets , Ann. Funct. Anal. 6 (2015), no. 3, 176–190

    2015

  8. [8]

    Paul Benacerraf and Hilary Putnam, Philosophy of Mathematics: Selected Readings, 2nd ed., Cambridge University Press, 1984

    1984

Show all 97 references
  1. [9]

    Formal Logic 47 (2006), no

    Josef Berger and Peter Schuster, Classifying Dini’s theorem, Notre Dame J. Formal Logic 47 (2006), no. 2, 253–262. PLATO AND THE FOUNDATIONS OF MATHEMATICS 47

    2006

  2. [10]

    Libr., vol

    , Dini’s theorem in the light of reverse mathematics , Logicism, intuitionism, and for- malism, Synth. Libr., vol. 341, Springer, 2009, pp. 153–166

    2009

  3. [11]

    Paul Bernays, Sur le Platonisme Dans les Math´ ematiques, L’Enseignement Math´ ematique 34 (1935), 52–69

    1935

  4. [12]

    154, Springer, 1995

    Arlen Brown and Carl Pearcy, An introduction to analysis, Graduate Texts in Mathematics, vol. 154, Springer, 1995

    1995

  5. [13]

    Brown, Notions of closed subsets of a complete separable metric space in weak subsystems of second-order arithmetic, Logic and computation (Pittsburgh, PA, 1987), Con- temp

    Douglas K. Brown, Notions of closed subsets of a complete separable metric space in weak subsystems of second-order arithmetic, Logic and computation (Pittsburgh, PA, 1987), Con- temp. Math., vol. 106, Amer. Math. Soc., Providence, RI, 1990, pp. 39–50

    1987

  6. [14]

    Notes Log., vol

    , Notions of compactness in weak subsystems of second order arithmetic , Reverse mathematics 2001, Lect. Notes Log., vol. 21, Assoc. Symbol. Logic, 2005, pp. 47–66

    2001

  7. [15]

    Burgess, Fixing Frege, Princeton Monographs in Philosophy, Princeton University Press, 2005

    John P. Burgess, Fixing Frege, Princeton Monographs in Philosophy, Princeton University Press, 2005

    2005

  8. [16]

    Buss, An introduction to proof theory , Handbook of proof theory, Stud

    Samuel R. Buss, An introduction to proof theory , Handbook of proof theory, Stud. Logic Found. Math., vol. 137, North-Holland, Amsterdam, 1998, pp. 1–78

    1998

  9. [17]

    19 (1895), 1–61

    Pierre Cousin, Sur les fonctions de n variables complexes, Acta Math. 19 (1895), 1–61

  10. [18]

    Solomon Feferman, How a Little Bit goes a Long Way: Predicative Foundations of Analysis ,

  11. [19]

    C., 1974), Vol

    Harvey Friedman, Some systems of second order arithmetic and their use , Proceedings of the International Congress of Mathematicians (Vancouver, B. C., 1974), Vol. 1, 1975, pp. 235–242

    1974

  12. [20]

    , Systems of second order arithmetic with restricted induction, I & II (Abstracts) , Journal of Symbolic Logic 41 (1976), 557–559

    1976

  13. [21]

    , Interpretations, According to Tarski, Interpretations of Set Theory in Discrete Math- ematics and Informal Thinking, The Nineteenth Annual Tarski Lectures, http://u.osu.edu/ friedman.8/files/2014/01/Tarski1052407-13do0b2.pdf 1 (2007), pp. 42

    2007

  14. [22]

    Robin Gandy, General recursive functionals of finite type and hierarchies of functions , Ann. Fac. Sci. Univ. Clermont-Ferrand No. 35 (1967), 5–24

    1967

  15. [23]

    Gierz, K

    G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott, A com- pendium of continuous lattices , Springer, 1980

    1980

  16. [24]

    93, Cambridge University Press, 2003

    , Continuous lattices and domains, Encyclopedia of Mathematics and its Applications, vol. 93, Cambridge University Press, 2003

    2003

  17. [25]

    Simpson, Located sets and reverse mathematics, J

    Mariagnese Giusto and Stephen G. Simpson, Located sets and reverse mathematics, J. Sym- bolic Logic 65 (2000), no. 3, 1451–1480

    2000

  18. [26]

    Kurt G¨ odel,Collected works. Vol. III , Oxford University Press, 1995

    1995

  19. [27]

    I , in: From Frege to G¨ odel

    Kurt G¨ odel, On formally undecidable propositions of Principia Mathematica and related systems. I , in: From Frege to G¨ odel. A sourcebook in mathematical logic, 1879–1931, 1967, pp. 592–617

    1931

  20. [28]

    22, Cambridge University Press, 2013

    Jean Goubault-Larrecq, Non-Hausdorff topology and domain theory , New Mathematical Monographs, vol. 22, Cambridge University Press, 2013

    2013

  21. [29]

    Graves, The Theory of Functions of Real Variables , McGraw-Hill, 1946

    Lawrence M. Graves, The Theory of Functions of Real Variables , McGraw-Hill, 1946

    1946

  22. [30]

    1876, Springer, 2006

    Horst Herrlich, Axiom of choice , Lecture Notes in Mathematics, vol. 1876, Springer, 2006

    2006

  23. [31]

    David Hilbert, Mathematical problems, Bull. Amer. Math. Soc. (N.S.) 37 (2000), no. 4, 407–

    2000

  24. [32]

    , ¨Uber das Unendliche , Math. Ann. 95 (1926), no. 1, 161–190 (German)

    1926

  25. [33]

    I , Zweite Auflage

    David Hilbert and Paul Bernays, Grundlagen der Mathematik. I , Zweite Auflage. Die Grundlehren der mathematischen Wissenschaften, Band 40, Springer, 1968

    1968

  26. [34]

    II , Zweite Auflage

    , Grundlagen der Mathematik. II , Zweite Auflage. Die Grundlehren der mathematis- chen Wissenschaften, Band 50, Springer, 1970

    1970

  27. [35]

    Hirschfeldt, Slicing the truth , Lecture Notes Series, Institute for Mathematical Sci- ences, National University of Singapore, vol

    Denis R. Hirschfeldt, Slicing the truth , Lecture Notes Series, Institute for Mathematical Sci- ences, National University of Singapore, vol. 28, World Scientific Publishing, 2015

    2015

  28. [36]

    Thesis (Ph.D.)–The University of Wisconsin - Madison

    James Hunter, Higher-order reverse topology, ProQuest LLC, Ann Arbor, MI, 2008. Thesis (Ph.D.)–The University of Wisconsin - Madison

    2008

  29. [37]

    Hajime Ishihara, Reverse mathematics in Bishop’s constructive mathematics , Philosophia Scientiae (Cahier Sp´ ecial)6 (2006), 43-59

    2006

  30. [38]

    Thomas Jech, Set theory, Springer Monographs in Mathematics, Springer, 2003

    2003

  31. [39]

    Kelley, General topology, Springer-Verlag, 1975

    John L. Kelley, General topology, Springer-Verlag, 1975. Reprint of the 1955 edition; Graduate Texts in Mathematics, No. 27. 48 PLATO AND THE FOUNDATIONS OF MATHEMATICS

    1975

  32. [40]

    https://plato.stanford.edu/archives/spr2014/entries/ large-cardinals-determinacy/

    Peter Koellner, Large Cardinals and Determinacy , The Stanford Encyclope- dia of Philosophy, 2014. https://plato.stanford.edu/archives/spr2014/entries/ large-cardinals-determinacy/

    2014

  33. [41]

    Notes Log., vol

    Ulrich Kohlenbach, Foundational and mathematical uses of higher types , Reflections on the foundations of mathematics, Lect. Notes Log., vol. 15, ASL, 2002, pp. 92–116

    2002

  34. [42]

    Notes Log., vol

    , Higher order reverse mathematics , Reverse mathematics 2001, Lect. Notes Log., vol. 21, ASL, 2005, pp. 281–295

    2001

  35. [43]

    Kreisel and A

    G. Kreisel and A. S. Troelstra, Formal systems for some branches of intuitionistic analysis , Ann. Math. Logic 1 (1970), 229–387

    1970

  36. [44]

    Kreuzer, The cohesive principle and the Bolzano-Weierstraßprinciple , MLQ Math

    Alexander P. Kreuzer, The cohesive principle and the Bolzano-Weierstraßprinciple , MLQ Math. Log. Q. 57 (2011), no. 3, 292–298

    2011

  37. [45]

    242, Marcel Dekker, Inc., New York, 2001

    Solomon Leader, The Kurzweil-Henstock integral and its differentials, Monographs and Text- books in Pure and Applied Mathematics, vol. 242, Marcel Dekker, Inc., New York, 2001. A unified theory of integration on R and Rn

    2001

  38. [46]

    Ernst Lindel¨ of,Sur Quelques Points De La Th´ eorie Des Ensembles, Comptes Rendus (1903), 697–700

    1903

  39. [47]

    John Longley and Dag Normann, Higher-order Computability, Theory and Applications of Computability, Springer, 2015

    2015

  40. [48]

    Shore,The limits of determinacy in second-order arith- metic, Proc

    Antonio Montalb´ an and Richard A. Shore,The limits of determinacy in second-order arith- metic, Proc. Lond. Math. Soc. (3) 104 (2012), no. 2, 223–252

    2012

  41. [49]

    E. H. Moore, On a Form of General Analysis with Aplication to Linear Differential and Integral Equations, Atti IV Cong. Inter. Mat. (Roma,1908) 2 (1909), 98–114

    1909

  42. [50]

    , Introduction to a Form of General Analysis , Yale University Press, 1910

    1910

  43. [51]

    12, 628–632

    , Definition of Limit in General Integral Analysis , Proceedings of the National Acad- emy of Sciences of the United States of America 1 (1915), no. 12, 628–632

    1915

  44. [52]

    E. H. Moore and H. Smith, A General Theory of Limits, Amer. J. Math. 44 (1922), 102–121

    1922

  45. [53]

    E. H. Moore, General Analysis. Part I. The Algebra of Matrices , Memoirs of the American Philosophical Society, Philadelophia, Vol. 1, 1935

    1935

  46. [54]

    Muldowney, A general theory of integration in function spaces, including Wiener and Feynman integration, Vol

    P. Muldowney, A general theory of integration in function spaces, including Wiener and Feynman integration, Vol. 153, Longman Scientific & Technical, Harlow; John Wiley, 1987

    1987

  47. [55]

    Nathanson, Path integration with non-positive distributions and applications to the Schr¨dinger equation, PhD (Doctor of Philosophy) thesis, University of Iowa, https://doi

    E. Nathanson, Path integration with non-positive distributions and applications to the Schr¨dinger equation, PhD (Doctor of Philosophy) thesis, University of Iowa, https://doi. org/10.17077/etd.k483ok3i. (2014)

    2014 doi

  48. [56]

    Nathanson and P

    E. Nathanson and P. Jørgensen, A global solution to the Schr ¨dinger equation: From Henstock to Feynman, Journal of Mathematical Physics 56 (2015)

    2015

  49. [57]

    , Trotter’s limit formula for the Schr¨ odinger equation with singular potential, Journal of Mathematical Physics 58 (2017)

    2017

  50. [58]

    Symbolic Logic 84 (2019), no

    Dag Normann and Sam Sanders, Nonstandard Analysis, Computability Theory, and their connections, J. Symbolic Logic 84 (2019), no. 4, 1422–1465

    2019

  51. [59]

    , The strength of compactness in Computability Theory and Nonstandard Analysis , Annals of Pure and Applied Logic, Article 102710 170 (2019), no. 11

    2019

  52. [60]

    , On the mathematical and foundational significance of the uncountable , Journal of Mathematical Logic, https://doi.org/10.1142/S0219061319500016 (2019)

    2019 doi

  53. [61]

    , On the mathematical and foundational significance of the uncountable , Updated version of [61], arxiv: https://arxiv.org/abs/1711.08939 (2019)

    2019 arXiv

  54. [62]

    , Representations in measure theory , Submitted, arXiv: https://arxiv.org/abs/ 1902.02756 (2019)

    2019 arXiv

  55. [63]

    Pure Appl

    , Pincherle’s theorem in reverse mathematics and computability theory , Ann. Pure Appl. Logic 171 (2020), no. 5, 102788, 41

    2020

  56. [64]

    , Open sets in Reverse Mathematics and Computability Theory , Journal of Logic and Computability 30 (2020), no. 8, pp. 40

    2020

  57. [65]

    , On the uncountability of R, Submitted, arxiv: https://arxiv.org/abs/2007.07560 (2020), pp. 29

    2020 arXiv

  58. [66]

    W. F. Osgood, Lehrbuch der Funktionentheorie. Erster Band , Chelsea Publishing Co., New York, 1965 (German)

    1965

  59. [67]

    W. N. Polyzou and Ekaterina Nathanson, Scattering using real-time path integrals , arXiv: https://arxiv.org/abs/1712.00046 (2017). PLATO AND THE FOUNDATIONS OF MATHEMATICS 49

    2017 arXiv

  60. [68]

    Pao Ming Pu and Ying Ming Liu, Fuzzy topology. I. Neighborhood structure of a fuzzy point and Moore-Smith convergence, J. Math. Anal. Appl. 76 (1980), no. 2, 571–599

    1980

  61. [69]

    99-116, 2003

    Paul Rusnock, Bolzano’s contributions to real analysis , Academia Verlag, Beitr¨ age zur Bolzano-Forschung, Band 16, p. 99-116, 2003

    2003

  62. [70]

    Nobuyuki Sakamoto and Takeshi Yamazaki, Uniform versions of some axioms of second order arithmetic, MLQ Math. Log. Q. 50 (2004), no. 6, 587–593

    2004

  63. [71]

    Sam Sanders, Reverse Mathematics of topology: dimension, paracompactness, and splittings , Submitted, arXiv: https://arxiv.org/abs/1808.08785 (2018), pp. 17

    2018 arXiv

  64. [72]

    , Nets and Reverse Mathematics: initial results , Proceedings of CiE19, Lecture Notes in Computer Science 11558, Springer (2019), pp. 12

    2019

  65. [73]

    , Reverse Mathematics and computability theory of domain theory , Proceedings of WoLLIC19, Lecture Notes in Computer Science 11541, Springer (2019), pp. 20

    2019

  66. [74]

    , Nets and Reverse Mathematics: a pilot study , To appear in Computability, arxiv: https://arxiv.org/abs/1905.04058 (2019), pp. 34

    2019 arXiv

  67. [75]

    , Lifting recursive counterexamples to higher-order arithmetic, To appear in Proceed- ings of LFCS2020, Lecture Notes in Computer Science, Springer (2019)

    2019

  68. [76]

    org/abs/1908.05677 (2019), pp

    , Lifting countable to uncountable mathematics , Submitted, arxiv: https://arxiv. org/abs/1908.05677 (2019), pp. 21

    2019 arXiv

  69. [77]

    org/abs/1910.07913 (2019), pp

    , The law of excluded middle as a no-go theorem , Submitted, arXiv: https://arxiv. org/abs/1910.07913 (2019), pp. 12

    2019 arXiv

  70. [78]

    Eric Schechter, Handbook of analysis and its foundations , Academic Press, Inc., San Diego, CA, 1997

    1997

  71. [79]

    Simpson, Nonprovability of certain combinatorial properties of finite trees, Harvey Friedman’s research on the foundations of mathematics, Stud

    Stephen G. Simpson, Nonprovability of certain combinatorial properties of finite trees, Harvey Friedman’s research on the foundations of mathematics, Stud. Logic Found. Math., vol. 117, 1985, pp. 87–117

    1985

  72. [80]

    Symbolic Logic 53 (1988), no

    , Partial realizations of Hilbert’s Program, J. Symbolic Logic 53 (1988), no. 2, 349–363

    1988

  73. [81]

    21, ASL, La Jolla, CA, 2005

    (ed.), Reverse mathematics 2001, Lecture Notes in Logic, vol. 21, ASL, La Jolla, CA, 2005

    2001

  74. [82]

    , Subsystems of second order arithmetic , 2nd ed., Perspectives in Logic, CUP, 2009

    2009

  75. [83]

    Essays for his centennial, 2010, pp

    , The G¨ odel hierarchy and reverse mathematics., Kurt G¨ odel. Essays for his centennial, 2010, pp. 109–127

    2010

  76. [84]

    Symbolic Logic 14 (1949), 145–158 (German)

    Ernst Specker, Nicht konstruktiv beweisbare S¨ atze der Analysis, J. Symbolic Logic 14 (1949), 145–158 (German)

    1949

  77. [85]

    Stillwell, Reverse mathematics, proofs from the inside out , Princeton Univ

    J. Stillwell, Reverse mathematics, proofs from the inside out , Princeton Univ. Press, 2018

    2018

  78. [86]

    Charles Swartz, Introduction to gauge integrals, World Scientific, 2001

    2001

  79. [87]

    Tait, Finitism, The Journal of Philosophy 78 (1981), 524-564

    William W. Tait, Finitism, The Journal of Philosophy 78 (1981), 524-564

    1981

  80. [88]

    George Tourlakis, Lectures in logic and set theory. Vol. 2 , Cambridge Studies in Advanced Mathematics, vol. 83, Cambridge University Press, 2003. Set theory

    2003

  81. [89]

    Lecture Notes in Mathematics, Vol

    Anne Sjerp Troelstra, Metamathematical investigation of intuitionistic arithmetic and anal- ysis, Springer Berlin, 1973. Lecture Notes in Mathematics, Vol. 344

    1973

  82. [90]

    A. S. Troelstra, Choice sequences, Clarendon Press, Oxford, 1977. A chapter of intuitionistic mathematics; Oxford Logic Guides

    1977

  83. [91]

    Anne Sjerp Troelstra and Dirk van Dalen, Constructivism in mathematics. Vol. I , Studies in Logic and the Foundations of Mathematics, vol. 121, North-Holland, 1988

    1988

  84. [92]

    Tukey, Convergence and Uniformity in Topology , Annals of Mathematics Studies, no

    John W. Tukey, Convergence and Uniformity in Topology , Annals of Mathematics Studies, no. 2, Princeton University Press, Princeton, N. J., 1940

    1940

  85. [93]

    Leopold Vietoris, Stetige Mengen, Monatsh. Math. Phys. 31 (1921), no. 1, 173–204 (German)

    1921

  86. [94]

    Hao Wang, Eighty years of foundational studies , Dialectica 12 (1958), 466–497

    1958

  87. [95]

    L. A. Zadeh, Fuzzy sets, Information and Control 8 (1965), 338–353

    1965

  88. [436]

    Reprinted from Bull. Amer. Math. Soc. 8 (1902), 437–479

    1902

  89. [2013]

    http://home.inf.unibe.ch/~ltg/em_bibliography/feferman13.pdf

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.