Definability by turing machines

Mathematical Logic Quarterly 15 (20-22):325-332 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19690152002

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,607

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

Universal turing machines: An exercise in coding.Hao Wang - 1957 - Mathematical Logic Quarterly 3 (6-10):69-80.
Quantificational variants on the halting problem for turing machines.Patrick C. Fischer - 1969 - Mathematical Logic Quarterly 15 (13-15):211-218.
The Halting Problem of one State Turing Machines with n‐Dimensional Tape.G. T. Herman - 1968 - Mathematical Logic Quarterly 14 (7-12):185-191.
Turing A. M.. Computability and λ-definability.Rózsa Péter - 1938 - Journal of Symbolic Logic 3 (2):89-89.
On a Conjecture of Kleene and Post.S. Barry Cooper - 2001 - Mathematical Logic Quarterly 47 (1):3-34.
Universal First‐Order Definability in Modal Logic.R. E. Jennings, D. K. Johnston & P. K. Schotch - 1980 - Mathematical Logic Quarterly 26 (19-21):327-330.
Definability on Formulas With Single Quantifier.Shih-Ping Tung - 1988 - Mathematical Logic Quarterly 34 (2):105-108.
R. Fréjvald. Složnost' raspoznavaniá simmétrii na mašinah T'uringa s vhodom (Complexity of recognition of symmetry on Turing machines with input). Algébra l logika, Séminar, vol. 4 no. 1 (1965), pp. 47–58. - Á. M. Barzdin'. Složnost' raspoznavaniá simmétrii na mašinah T'úringa (Complexity of recognition of symmetry on Turing machines). Problémy kibérnětiki, vol. 15 (1965), pp. 245–248. [REVIEW]A. M. Barzdin - 1970 - Journal of Symbolic Logic 35 (1):159-159.
Model Theoretic Approaches to Definability.J. Richard Büchi & Kenneth J. Danhof - 1972 - Mathematical Logic Quarterly 18 (4‐6):61-70.

Analytics

Added to PP
2013-11-24

Downloads
50 (#431,619)

6 months
7 (#673,909)

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

Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.

Add more references