Hostname: page-component-6bf8c574d5-mggfc Total loading time: 0 Render date: 2025-02-20T23:42:23.147Z Has data issue: false hasContentIssue false
  • English
  • Français

Dennis F. Cudia and Wilson E. Singletary. The Post correspondence problem. The journal of symbolic logic, vol. 33 (1968), 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 (1968), pp. 680–692.

Review products

Dennis F. Cudia and Wilson E. Singletary. The Post correspondence problem. The journal of symbolic logic, vol. 33 (1968), 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 (1968), pp. 680–692.

Published online by Cambridge University Press:  12 March 2014

Ann Yasuhara
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
The Journal of Symbolic Logic , Volume 39 , Issue 1 , March 1974 , pp. 185 - 186
Copyright
Copyright © Association for Symbolic Logic 1974

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)