{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T05:09:30Z","timestamp":1736140170492,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010027X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022506","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:49:12Z","timestamp":1132724952000},"page":"205-218","source":"Crossref","is-referenced-by-count":1,"title":["A criterion of undecidability of algorithmic theories"],"prefix":"10.1007","author":[{"given":"Wiktor","family":"Da\u0144ko","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"L. Banachowski, Investigations of properties of programs by means of extended algorithmic logic, Fundamenta Informaticae I, 1977","DOI":"10.3233\/FI-1977-1108"},{"key":"15_CR2","first-page":"315","volume":"23","author":"L. Banachowski","year":"1975","unstructured":"L. Banachowski, An axiomatic approach to the theory of data structures, Bull.Acad.Pol.Sci.S\u00e8r.Math.Astr.Phys. 23, 1975, 315\u2013323","journal-title":"Bull.Acad.Pol.Sci.S\u00e8r.Math.Astr.Phys."},{"key":"15_CR3","first-page":"575","volume":"20","author":"M. Grabowski","year":"1972","unstructured":"M. Grabowski, The set of tautologies of zero order algorithmic logic is decidable, Bull.Acad.Pol.Sci.S\u00e8r.Math.Astr.Phys. 20, 1972, 575\u2013582","journal-title":"Bull.Acad.Pol.Sci.S\u00e8r.Math.Astr.Phys."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"D.Harel, A.R.Meyer, V.R.Pratt, Computability and completeness in logic of programs, Proc. 9th Ann. ACM Symp. on Theory of Computing, 261\u2013268","DOI":"10.1145\/800105.803416"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.3233\/FI-1977-1103","volume":"I","author":"A. Kreczmar","year":"1977","unstructured":"A. Kreczmar, Effectivity problems of algorithmic logic, Funda menta Informaticae I, 1977, 19\u201332","journal-title":"Funda menta Informaticae"},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/FI-1977-1113","volume":"I","author":"A. Kreczmar","year":"1977","unstructured":"A. Kreczmar, Programmability in fields, Fundamenta Informaticae I, 1977, 195\u2013230","journal-title":"Fundamenta Informaticae"},{"key":"15_CR7","unstructured":"J.Matijasevi\u010d, Recursively enumerable relations are diophanic, Reports of Academy of Science of USSR 191, 279\u2013282"},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1977-1102","volume":"I","author":"G. Mirkowska","year":"1977","unstructured":"G. Mirkowska, Algorithmic logic and its applications in program theory, Fundamenta Informaticae I, 1977, 1\u201317, 147\u2013167","journal-title":"Fundamenta Informaticae"},{"key":"15_CR9","volume-title":"Mathematics of metamathematics","author":"H. Rasiowa","year":"1963","unstructured":"H. Rasiowa, R. Sikorski, Mathematics of metamathematics, PWN, Warszawa 1963"},{"key":"15_CR10","unstructured":"A.Salwicki, On algorithmic theory of stacks, CC PAS Reports"},{"key":"15_CR11","unstructured":"A. Salwicki, On algorithmic theory of dictionaries, Fundamenta Informaticae to appear"},{"key":"15_CR12","unstructured":"A.Salwicki, Programmability and recursiveness, Dissertationes Mathematicae, to appear"},{"key":"15_CR13","volume-title":"A decision method for elementary algebra and geometry","author":"A. Tarski","year":"1948","unstructured":"A. Tarski, A decision method for elementary algebra and geometry, RAND Corporation, Santa Monica, Calif. 1948"},{"key":"15_CR14","unstructured":"B.A.Trachtenbrot, There is no algorithm for deciding the validity of formulas in finite structures, Reports of Academy of Science of USSR, 70, 569\u2013572"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1980"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022506.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T21:26:00Z","timestamp":1736112360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010027X"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0022506","relation":{},"subject":[]}}