Constructive Mathematical Truth
| dc.creator | Taranovsky, Dmytro | |
| dc.date | 2006-05-04 | |
| dc.date | 2006-06-01 | |
| dc.date.accessioned | 2026-07-07T07:13:56Z | |
| dc.date.available | 2026-07-07T07:13:56Z | |
| dc.description | We define constructive truth for arithmetic and for intuitionistic analysis, and investigate its properties. We also prove that the set of constructively true (first order) arithmetical statements is Pi-1-2 and Sigma-1-2 hard, and we conjecture it to be complete for second order arithmetic. A statement is constructively true iff it is realized by a constructive function under continuous function realizability. | |
| dc.description | 23 pages; new results and references | |
| dc.identifier | https://arxiv.org/abs/math/0605138 | |
| dc.identifier | http://arxiv.org/abs/math/0605138 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/112667 | |
| dc.subject | Logic | |
| dc.subject | 03F55 | |
| dc.title | Constructive Mathematical Truth | |
| dc.type | text |