Undecidable theories

Amsterdam,: North-Holland Pub. Co.. Edited by Andrzej Mostowski & Raphael M. Robinson (1953)
  Copy   BIBTEX

Abstract

This book is well known for its proof that many mathematical systems - including lattice theory and closure algebras - are undecidable. It consists of three treatises from one of the greatest logicians of all time: "A General Method in Proofs of Undecidability," "Undecidability and Essential Undecidability in Mathematics," and "Undecidability of the Elementary Theory of Groups."

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

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

Through your library

Analytics

Added to PP
2009-09-15

Downloads
78 (#209,650)

6 months
15 (#159,128)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Representation and Invariance of Scientific Structures.Patrick Suppes - 2002 - CSLI Publications (distributed by Chicago University Press).
Propositional quantifiers in modal logic.Kit Fine - 1970 - Theoria 36 (3):336-346.
How truthlike can a predicate be? A negative result.Vann McGee - 1985 - Journal of Philosophical Logic 14 (4):399 - 410.
An ascending chain of S4 logics.Kit Fine - 1974 - Theoria 40 (2):110-116.

View all 76 citations / Add more citations

References found in this work

No references found.

Add more references