This is not the latest version of this item. The latest version can be found here.
On a diophantine representation of the predicate of provability
On a diophantine representation of the predicate of provability
No Thumbnail Available
Files
There are no files associated with this item.
Date
2012
Authors
Carl, Merlin
Moroz, Boris Zelikovich
Editors
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
International patent number
Link to the license
EU project number
Project
Open Access publication
Collections
Title in another language
Publication type
Journal article
Publication status
Published in
Zapiski Nauchnykh Seminarov POMI ; 407 (2012). - pp. 77-104
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.
Summary in another language
Subject (DDC)
510 Mathematics
Keywords
Diophantine coding,Matiyasevich's theorem,Pell's equation,Gödel–Bernays set theory
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690
BibTex
RDF
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes