William W. Tait

Suggest Changes
Learn More
If the initial segment Σ of Ω is a set, then it has a least strict upper bound S(Σ) ∈ Ω. Thus, for numbers α = S(Σ) and β = S(Σ′), α < β iff α ∈ Σ′; α = β iff Σ = Σ′; S(∅) is the least number 0(More)
The background of these remarks is that in 1967, in ‘’Constructive reasoning” [27], I sketched an argument that finitist arithmetic coincides with primitive recursive arithmetic, PRA; and in 1981, in(More)