Dennis F. Cudia and Wilson E. Singletary. The Post correspondence problem. The journal of symbolic logic, vol. 33 , pp. 418–430. - Dennis F. Cudia and Wilson E. Singletary. Degrees of unsolvability in formal grammars. Journal of the Association for Computing Machinery, vol. 15 , pp. 680–692 [Book Review]

Journal of Symbolic Logic 39 (1):185-186 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272378

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,907

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

Cudia Dennis F. and Singletary Wilson E.. The Post correspondence problem.Ann Yasuhara - 1974 - Journal of Symbolic Logic 39 (1):185-186.
The Post Correspondence Problem.Dennis F. Cudia & Wilson E. Singletary - 1974 - Journal of Symbolic Logic 39 (1):185-186.
The post correspondence problem.Dennis F. Cudia & Wilson E. Singletary - 1968 - Journal of Symbolic Logic 33 (3):418-430.
A Complex of Problems Proposed by Post.Wilson E. Singletary - 1966 - Journal of Symbolic Logic 31 (2):273-274.
Review: Wilson E. Singletary, A Complex of Problems Proposed by Post. [REVIEW]Martin Davis - 1966 - Journal of Symbolic Logic 31 (2):273-274.
Review: J. Hartmanis, F. D. Lewis, The Use of Lists in the Study of Undecidable Problems in Automata Theory. [REVIEW]Dennis F. Cudia - 1974 - Journal of Symbolic Logic 39 (2):347-347.
Hartmanis J. and Lewis F. D.. The use of lists in the study of undecidable problems in automata theory. Journal of computer and system sciences, vol. 5 , pp. 54–66. [REVIEW]Dennis F. Cudia - 1974 - Journal of Symbolic Logic 39 (2):347-347.
Review: M. D. Gladstone, Some Ways of Constructing a Propositional Calculus of any Required Degree of Unsolvability. [REVIEW]W. E. Singletary - 1969 - Journal of Symbolic Logic 34 (3):505-506.
Many-one degrees associated with partial propositional calculi.W. E. Singletary - 1974 - Notre Dame Journal of Formal Logic 15 (2):335-343.
Gladstone M. D.. Some ways of constructing a propositional calculus of any required degree of unsolvability. Transactions of the American Mathematical Society, vol. 118 , pp. 192–210. [REVIEW]W. E. Singletary - 1969 - Journal of Symbolic Logic 34 (3):505-506.
Rogers Hartley Jr., Computing degrees of unsolvability. Mathematische Annalen, vol. 138 . pp. 125–140.Rogers Hartley Jr., Computing degrees of unsolvability. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 277–283. [REVIEW]Steven Orey - 1960 - Journal of Symbolic Logic 25 (4):363-364.
Review: W. L. Duda, Post Canonical Language. [REVIEW]W. E. Singletary - 1971 - Journal of Symbolic Logic 36 (2):343-343.
Introduction to the Fiftieth Anniversary Issues.Ignacio Angelelli, Robert Bull, Jean E. Rubin, F. Gonzalez Asenjo, John Thomas Canty, Luis Elpidio Sanchis, Nuel D. Belnap, George Goe, Wilson E. Singletary & Ivan Boh - 2010 - Notre Dame Journal of Formal Logic 51 (1).
Yasuhara Ann. A remark on Post normal systems. Journal of the Association for Computing Machinery, vol. 14 , pp. 167–171. [REVIEW]M. D. Gladstone - 1968 - Journal of Symbolic Logic 33 (1):116-117.
Greibach Sheila A.. The unsolvability of the recognition of linear context-free languages. Journal of the Association for Computing Machinery, vol. 13 , pp. 582–587. [REVIEW]Seymour Ginsburg - 1971 - Journal of Symbolic Logic 36 (4):693-693.

Analytics

Added to PP
2013-11-03

Downloads
27 (#606,449)

6 months
11 (#270,425)

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