Uspensky V. A.. Gödel's incompleteness theorem. English translation by Neal Koblitz of Téoréma Gëdélá o népolnoté. Little mathematics library. Mir Publishers, Moscow 1987, also distributed by Imported Publications, Chicago, 104 pp [Book Review]

Journal of Symbolic Logic 55 (2):889-891 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274683

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

V. A. Uspensky. Post's machine. English translation by R. Alavina of Mašina Posta. Little mathematics library. Mir Publishers, Moscow, also distributed by Imported Publications, Chicago, 1983, 88 pp. - Emil L. Post. Finite combinatory processes—formulation 1. A reprint of II 43. Therein, pp. 84–88. [REVIEW]T. Thacher Robinson - 1986 - Journal of Symbolic Logic 51 (1):253-254.
Review: V. A. Uspensky, Neal Koblitz, Godel's Incompleteness Theorem. [REVIEW]George Boolos - 1990 - Journal of Symbolic Logic 55 (2):889-891.
Review: V. A. Uspenskij, Teorema Gedela o Nepolnote; Frank Jackson, Conditionals. [REVIEW]Donald Nute - 1990 - Journal of Symbolic Logic 55 (2):891-892.
Téoréma Gëdélá o Népolnoté.Frank Jackson - 1990 - Journal of Symbolic Logic 55 (2):891-892.
V. A. Uspénskij. Téoréma Gëdélá o népolnoté. Russian original of the preceding. Populárnyé lékclii po matématiké, no. 57. “Nauka,” Moscow1982, 112 pp. - Frank Jackson. Conditionals. Philosophical theory series. Basil Blackwell, Oxford and New York1987, viii + 148 pp. [REVIEW]Donald Nute - 1990 - Journal of Symbolic Logic 55 (2):891-892.
Vladimir A. Uspensky. Godel's incompleteness theorem. A reprint of LV 889 with minor corrections. Theoretical computer science, vol. 130 , pp. 239–319. [REVIEW]H. B. Enderton - 1995 - Journal of Symbolic Logic 60 (4):1320.
Gödel’s second incompleteness theorem: How it is derived and what it delivers.Saeed Salehi - 2020 - Bulletin of Symbolic Logic 26 (3-4):241-256.
A Note on Boolos' Proof of the Incompleteness Theorem.Makoto Kikuchi - 1994 - Mathematical Logic Quarterly 40 (4):528-532.
Rieger Ladislav. 0 sčétnyh obobščénnyh σ-algébrah i novom dokazatélstvé téorémy Gédéla o polnoté. Časopis pro pěstováni matematiky a fysiky , vol. 1 no. 1 , pp. 33–49.Rieger Ladislav. On countable generalised σ-algebras, with a new proof of Gödel's completeness theorem. English translation of the preceding. Czechoslovak mathematical journal, vol. 1 no. 1 , pp. 29–40. [REVIEW]Leon Henkin - 1955 - Journal of Symbolic Logic 20 (3):281-282.
Yu. L. Ershov and E. A. Palyutin. Mathematical logic. Revised English translation by Vladimir Shokurov of the preceding. Mir Publishers, Moscow1984, 303 pp. [REVIEW]Elliott Mendelson - 1986 - Journal of Symbolic Logic 51 (3):829-829.

Analytics

Added to PP
2016-06-30

Downloads
17 (#867,977)

6 months
17 (#204,297)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references