IST is more than an algorithm to prove ZFC theorems
Vladimir Kanovei
Abstract
There is a sentence in the language of IST, Nelson's internal set theory, which is not equivalent in IST to a sentence in the ZFC language. Thus the Reduction algorithm of Nelson, that converts bounded IST formulas with standard parameters to provably (in IST) equivalent formulas in the ZFC language, cannot be extended to all formulas of the IST language. Therefore, certain IST sentences are "meaningless" from the point of view of the standard universe.
Create a lesson
Related papers
The universal measure of nonstochastic objects
Vladimir Vovk
Hyperarithmetic directions can all be exceptional for Marstrand's projection theorem
Noam Greenberg, Daniel Turetsky
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He et al.
An easy proof that there may be no P-points
David Chodounský, Osvaldo Guzmán, Jonathan Verner
Comments on Choiceless Chain Conditions
Constance Bromham, Asaf Karagila
Localic Esakia Duality via Conic Frames
Nesta van der Schaaf