TUTCRIS - Tampereen teknillinen yliopisto

TUTCRIS

A Simple Character String Proof of the "True but Unprovable'' Version of Gödel's First Incompleteness Theorem

Tutkimustuotosvertaisarvioitu

Standard

A Simple Character String Proof of the "True but Unprovable'' Version of Gödel's First Incompleteness Theorem. / Valmari, Antti.

julkaisussa: Electronic Proceedings in Theoretical Computer Science, Vuosikerta 151, 25, 2014, s. 355-369.

Tutkimustuotosvertaisarvioitu

Harvard

Valmari, A 2014, 'A Simple Character String Proof of the "True but Unprovable'' Version of Gödel's First Incompleteness Theorem', Electronic Proceedings in Theoretical Computer Science, Vuosikerta. 151, 25, Sivut 355-369. https://doi.org/10.4204/EPTCS.151.25

APA

Valmari, A. (2014). A Simple Character String Proof of the "True but Unprovable'' Version of Gödel's First Incompleteness Theorem. Electronic Proceedings in Theoretical Computer Science, 151, 355-369. [25]. https://doi.org/10.4204/EPTCS.151.25

Vancouver

Author

Valmari, Antti. / A Simple Character String Proof of the "True but Unprovable'' Version of Gödel's First Incompleteness Theorem. Julkaisussa: Electronic Proceedings in Theoretical Computer Science. 2014 ; Vuosikerta 151. Sivut 355-369.

Bibtex - Lataa

@article{b968b55213114825813578e831cd7b2d,
title = "A Simple Character String Proof of the {"}True but Unprovable'' Version of G{\"o}del's First Incompleteness Theorem",
author = "Antti Valmari",
note = "Paper presented also in the Proceedings of the 14th International Conference Automata and Formal Languages (AFL 2014).<br/>Contribution: organisation=mat,FACT1=1<br/>Portfolio EDEND: 2014-11-17<br/>Publisher name: Open Publishing Association",
year = "2014",
doi = "10.4204/EPTCS.151.25",
language = "English",
volume = "151",
pages = "355--369",
journal = "Electronic Proceedings in Theoretical Computer Science",
issn = "2075-2180",
publisher = "Open Publishing Association",

}

RIS (suitable for import to EndNote) - Lataa

TY - JOUR

T1 - A Simple Character String Proof of the "True but Unprovable'' Version of Gödel's First Incompleteness Theorem

AU - Valmari, Antti

N1 - Paper presented also in the Proceedings of the 14th International Conference Automata and Formal Languages (AFL 2014).<br/>Contribution: organisation=mat,FACT1=1<br/>Portfolio EDEND: 2014-11-17<br/>Publisher name: Open Publishing Association

PY - 2014

Y1 - 2014

U2 - 10.4204/EPTCS.151.25

DO - 10.4204/EPTCS.151.25

M3 - Article

VL - 151

SP - 355

EP - 369

JO - Electronic Proceedings in Theoretical Computer Science

JF - Electronic Proceedings in Theoretical Computer Science

SN - 2075-2180

M1 - 25

ER -