{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T04:54:19Z","timestamp":1693457659808},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1975,3,1]],"date-time":"1975-03-01T00:00:00Z","timestamp":162864000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch math Logik"],"published-print":{"date-parts":[[1975,3]]},"DOI":"10.1007\/bf02280809","type":"journal-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T14:01:52Z","timestamp":1138197712000},"page":"25-33","source":"Crossref","is-referenced-by-count":3,"title":["Combinatorial systems defined over one- and two-letter alphabets"],"prefix":"10.1007","volume":"17","author":[{"given":"Charles E.","family":"Hughes","sequence":"first","affiliation":[]},{"given":"W. E.","family":"Singletary","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02280809_CR1","doi-asserted-by":"crossref","first-page":"520","DOI":"10.2307\/1970478","volume":"83","author":"W.W. Boone","year":"1966","unstructured":"Boone, W.W.: Word problems and recursively enumerable degrees of unsolvability. A first paper on Thue systems. Ann. Math.83 (1966), 520\u2013571.","journal-title":"Ann. Math."},{"key":"BF02280809_CR2","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01705888","volume":"4","author":"J.R. B\u00fcchi","year":"1970","unstructured":"B\u00fcchi, J.R., Hosken, W.H.: Canonical systems which produce periodic sets. Math. Systems Theory4 (1970), 81\u201390.","journal-title":"Math. Systems Theory"},{"key":"BF02280809_CR3","doi-asserted-by":"crossref","first-page":"418","DOI":"10.2307\/2270327","volume":"33","author":"D.F. Cudia","year":"1968","unstructured":"Cudia, D.F., Singletary, W.E.: The Post correspondence problem. J. Symb. Logic33 (1968), 418\u2013430.","journal-title":"J. Symb. Logic"},{"key":"BF02280809_CR4","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1073\/pnas.43.2.236","volume":"43","author":"R.M. Friedburg","year":"1957","unstructured":"Friedburg, R.M.: Two recursively enumerable sets of incomparable degrees of unsolvability (solution to Post's problem 1944). Proc. Nat'l. Acad. Sci.43 (1957), 236\u2013238.","journal-title":"Proc. Nat'l. Acad. Sci."},{"key":"BF02280809_CR5","unstructured":"Hopcroft,J.E., Ullman,J.D.: Formal Languages and their Relation to Automata. Addison-Wesley, 1969."},{"key":"BF02280809_CR6","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/BF00987253","volume":"1","author":"C.E. Hughes","year":"1972","unstructured":"Hughes, C.E.: Degrees of unsolvability associated with Markov algorithms. Internat. J. Comput. Information Sci.1 (1972), 355\u2013365.","journal-title":"Internat. J. Comput. Information Sci."},{"key":"BF02280809_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2271723","volume":"38","author":"C.E. Hughes","year":"1973","unstructured":"Hughes, C.E.: Many-one degrees associated with problems of tag. J. Symb. Logic.38 (1973), 1\u201317.","journal-title":"J. Symb. Logic."},{"key":"BF02280809_CR8","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1305\/ndjfl\/1093891701","volume":"16","author":"C.E. Hughes","year":"1975","unstructured":"Hughes, C.E.: The general decision problem for Markov algorithms with axiom. Notre Dame J. Formal Logic.16 (1975), 208\u2013216.","journal-title":"Notre Dame J. Formal Logic."},{"key":"BF02280809_CR9","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1305\/ndjfl\/1093890999","volume":"14","author":"C.E. Hughes","year":"1973","unstructured":"Hughes, C.E., Singletary, W.E.: Combinatorial systems with axiom. Notre Dame J. Formal Logic.14 (1973), 354\u2013360.","journal-title":"Notre Dame J. Formal Logic."},{"key":"BF02280809_CR10","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1090\/S0002-9904-1971-12742-8","volume":"77","author":"C.E. Hughes","year":"1971","unstructured":"Hughes, C.E., Overbeek, R., Singletary, W.E.: The many-one equivalence of some general combinatorial decision problems. Bull. Amer. Math. Soc.77 (1971), 467\u2013472.","journal-title":"Bull. Amer. Math. Soc."},{"key":"BF02280809_CR11","first-page":"194","volume":"108","author":"A.A. Mu\u010dnik","year":"1956","unstructured":"Mu\u010dnik A.A.: On the unsolvability of the problem of reducibility in the theory of algorithms. Dokl. Akad. Nauk SSR108 (1956), 194\u2013197.","journal-title":"Dokl. Akad. Nauk SSR"},{"issue":"3","key":"BF02280809_CR12","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1112\/plms\/s3-26.1.184","volume":"26","author":"Ross Overbeek","year":"1973","unstructured":"Overbeek, Ross: The representation of many-one degrees by the word problem for Thus systems. Proc. London Math. Soc. (3)26 (1973), 184\u2013192.","journal-title":"Proc. London Math. Soc."},{"key":"BF02280809_CR13","doi-asserted-by":"crossref","first-page":"197","DOI":"10.2307\/2371809","volume":"65","author":"E.L. Post","year":"1943","unstructured":"Post, E.L.: Formal reductions of the general combinatorial decision problem. Amer. J. Math.65 (1943), 197\u2013215.","journal-title":"Amer. J. Math."},{"key":"BF02280809_CR14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/malq.19650110210","volume":"11","author":"J.C. Shepherdson","year":"1965","unstructured":"Shepherdson, J.C.: Machine configuration and word problems of given degree of unsolvability. Z. Math. Logik Grundlagen11 (1965), 149\u2013175.","journal-title":"Z. Math. Logik Grundlagen"},{"key":"BF02280809_CR15","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1090\/S0002-9904-1967-11780-4","volume":"73","author":"W.E. Singletary","year":"1967","unstructured":"Singletary, W.E.: The equivalence of some general combinatorial decision problems. Bull. Amer. Math. Soc.73 (1967), 446\u2013451.","journal-title":"Bull. Amer. Math. Soc."}],"container-title":["Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02280809.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02280809\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02280809","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T16:53:45Z","timestamp":1558025625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02280809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,3]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1975,3]]}},"alternative-id":["BF02280809"],"URL":"https:\/\/doi.org\/10.1007\/bf02280809","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975,3]]}}}