One useful logic that defines its own truth
| dc.creator | Blass, Andreas | |
| dc.creator | Gurevich, Yuri | |
| dc.date | 2008-11-06 | |
| dc.date.accessioned | 2026-07-07T10:16:25Z | |
| dc.date.available | 2026-07-07T10:16:25Z | |
| dc.description | Existential fixed point logic (EFPL) is a natural fit for some applications, and the purpose of this talk is to attract attention to EFPL. The logic is also interesting in its own right as it has attractive properties. One of those properties is rather unusual: truth of formulas can be defined (given appropriate syntactic apparatus) in the logic. We mentioned that property elsewhere, and we use this opportunity to provide the proof. | |
| dc.identifier | https://arxiv.org/abs/0811.0964 | |
| dc.identifier | http://arxiv.org/abs/0811.0964 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/173500 | |
| dc.subject | Logic in Computer Science | |
| dc.title | One useful logic that defines its own truth | |
| dc.type | text |