1 citations · 2 across the 4 of their papers we have counts for
5 papers
Reverse Formalism 16
Sam Sanders
In his remarkable paper Formalism64, Robinson defends his philsophocal position as follows: (i) Any mention of infinite totalities is literally meaningless. (ii) We should act as i…
The computational content of Nonstandard Analysis
Sam Sanders
Kohlenbach's proof mining program deals with the extraction of effective information from typically ineffective proofs. Proof mining has its roots in Kreisel's pioneering work on t…
Searching through the reals
Sam Sanders
It is a commonplace to say that `one can search through the natural numbers', by which is meant the following: For a property, decidable in finite time and which is not false for a…
Uniform and nonstandard existence in Reverse Mathematics
Sam Sanders
Reverse Mathematics is a program in the foundations of mathematics which provides an elegant classification of theorems of ordinary mathematics based on computability. Our aim is t…
Reverse Mathematics of Brouwer's continuity theorem and related principles
Sam Sanders
In intuitionistic mathematics, the Brouwer Continuity Theorem states that all total real functions are (uniformly) continuous on the unit interval. We study this theorem and relate…