Dies ist nicht die neueste Version dieses Items. Die neueste Version finden Sie unter hier.
On a diophantine representation of the predicate of provability
| dc.contributor.author | Carl, Merlin | deu |
| dc.contributor.author | Moroz, Boris Zelikovich | deu |
| dc.date.accessioned | 2013-02-19T10:27:46Z | deu |
| dc.date.available | 2013-02-19T10:27:46Z | deu |
| dc.date.issued | 2012 | deu |
| dc.description.abstract | We construct a diophantine equation which is solvable if and only if ZFC is inconsistent. Accordingly, under the assumption of Con(ZFC), this equation is unsolvable, but not provably so, unless one assumes axioms going beyond ZFC. | eng |
| dc.identifier.citation | Zapiski Nauchnykh Seminarov POMI ; 407 (2012). - S. 77-104 | deu |
| dc.identifier.uri | http://kops.uni-konstanz.de/handle/123456789/21343 | |
| dc.language.iso | eng | deu |
| dc.legacy.dateIssued | 2013-02-19 | deu |
| dc.rights | terms-of-use | deu |
| dc.rights.uri | https://rightsstatements.org/page/InC/1.0/ | deu |
| dc.subject | Diophantine coding | deu |
| dc.subject | Matiyasevich's theorem | deu |
| dc.subject | Pell's equation | deu |
| dc.subject | Gödel–Bernays set theory | deu |
| dc.subject.ddc | 510 | deu |
| dc.title | On a diophantine representation of the predicate of provability | eng |
| dc.type | JOURNAL_ARTICLE | deu |
| dspace.entity.type | Publication | |
| kops.flag.knbibliography | true | |
| kops.identifier.nbn | urn:nbn:de:bsz:352-213438 | deu |
| kops.submitter.email | merlin.carl@uni-konstanz.de | deu |
| source.bibliographicInfo.fromPage | 77 | |
| source.bibliographicInfo.toPage | 104 | |
| source.bibliographicInfo.volume | 407 | |
| source.periodicalTitle | Zapiski Nauchnykh Seminarov POMI | |
| temp.submission.doi | ||
| temp.submission.source |
Dateien
Lizenzbündel
1 - 1 von 1
Vorschaubild nicht verfügbar
- Name:
- license.txt
- Größe:
- 1.92 KB
- Format:
- Plain Text
- Beschreibung:
