Undecidability of the Domino Problem

American Mathematical Soc. (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

ISBN(s)

0821812661   9780821812662
View all bargains

Buy this book

Links

PhilArchive



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

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

Degrees of unsolvability.Joseph Robert Shoenfield - 1972 - New York,: American Elsevier.
The elements of mathematical logic.Paul Charles Rosenbloom - 1950 - New York]: Dover Publications.
Undecidability Of Some Domino Connectability Problems.H.‐D. Ebbinghaus - 1982 - Mathematical Logic Quarterly 28 (22‐24):331-336.
Degrees of unsolvability: local and global theory.Manuel Lerman - 1983 - New York: Springer Verlag.
The decision problem: solvable classes of quantificational formulas.Burton Dreben - 1979 - Reading, Mass.: Addison-Wesley, Advanced Book Program. Edited by Warren D. Goldfarb.
Noncomputability, unpredictability, undecidability, and unsolvability in economic and finance theories.Ying-Fang Kao, V. Ragupathy, K. Vela Velupillai & Stefano Zambelli - 2013 - Complexity 18 (1):51-55.
Completeness, compactness, and undecidability: an introduction to mathematical logic.Alfred B. Manaster - 1975 - Englewood Cliffs, N.J.: Prentice-Hall.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.
Unsolvable classes of quantificational formulas.Harry R. Lewis - 1979 - Reading, Mass.: Addison-Wesley.
On the Unsolvability of the Word Problem for a Class of Semigroups with a Solvable Isomorphism Problem.E. I. Grindlinger & M. Greendlinger - 1968 - Journal of Symbolic Logic 33 (3):469-469.
A note on the undecidability of the reachability problem for o‐minimal dynamical systems.Thomas Brihaye - 2006 - Mathematical Logic Quarterly 52 (2):165-170.
Review: Alfred B. Manaster, Completeness, Compactness, and Undecidability: An Introduction to Mathematical Logic. [REVIEW]M. R. Krom - 1977 - Journal of Symbolic Logic 42 (2):320-320.
Set Theory and Logic.Robert Roth Stoll - 2012 - San Francisco and London: Courier Corporation.
On Algorithmic Unsolvability of the Word Problem.P. S. Novikov - 1954 - Journal of Symbolic Logic 19 (1):58-60.

Analytics

Added to PP
2015-02-03

Downloads
17 (#846,424)

6 months
11 (#222,787)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A model-theoretic characterisation of clique width.Achim Blumensath - 2006 - Annals of Pure and Applied Logic 142 (1):321-350.

View all 12 citations / Add more citations

References found in this work

No references found.

Add more references