IST is more than an algorithm to prove ZFC theorems
| dc.creator | Kanovei, Vladimir | |
| dc.date | 1993-10-26 | |
| dc.date.accessioned | 2026-07-07T09:14:58Z | |
| dc.date.available | 2026-07-07T09:14:58Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/math/9310213 | |
| dc.identifier | http://arxiv.org/abs/math/9310213 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/152872 | |
| dc.subject | Logic | |
| dc.title | IST is more than an algorithm to prove ZFC theorems | |
| dc.type | text |