{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:45Z","timestamp":1725456105080},"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\/bfb0022527","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:49:12Z","timestamp":1132724952000},"page":"488-503","source":"Crossref","is-referenced-by-count":2,"title":["Completeness in classical logic of complex algorithms"],"prefix":"10.1007","author":[{"given":"Helena","family":"Rasiowa","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Blikle A.,Mazurkiewicz A., An algebraic approach to the theory of programs,algorithms,languages and recursiveness,Proc.Intern.Symp. and Summer School on MFCS,1972,CCPAS Reports 1972"},{"key":"36_CR2","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/366663.366704","volume":"6","author":"M.E. Conway","year":"1963","unstructured":"Conway M.E.,Design of a separable-transition diagram compliler, Comm.ACM 6,July 1963,396\u2013408","journal-title":"Comm.ACM"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Harel D., Meyer A.R., Pratt V.R., Computability,and Completeness in Logics of programs, Proc. 9th Annual ACM Symposium on Theory of Computing, Boulder,Colorado, May 1977,261\u2013268","DOI":"10.1145\/800105.803416"},{"issue":"1","key":"36_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.3233\/FI-1977-1110","volume":"1","author":"R. Janicki","year":"1977","unstructured":"Janicki R.,An algebraic approach to the theory of recursive coroutines,Fundamenta Informaticae 1,No 1 (1977),131\u2013145","journal-title":"Fundamenta Informaticae"},{"key":"36_CR5","first-page":"799","volume":"20","author":"A. Mazurkiewicz","year":"1972","unstructured":"Mazurkiewicz A.,Recursive algorithms and formal languages,Bull.Ac. Pol.Sci.,Ser.Sci.Math.Astron.Phys., 20(1972),799\u2013809","journal-title":"Bull.Ac. Pol.Sci.,Ser.Sci.Math.Astron.Phys."},{"key":"36_CR6","first-page":"17","volume":"343","author":"G. Mirkowska","year":"1979","unstructured":"Mirkowska G.,Algorithmic logic with nondeterministic programs,ICS PAS Reports 343 (1979),17","journal-title":"ICS PAS Reports"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Pratt V.R.,Semantical considerations in Floyd-Hoare Logic,Proc. 17th IEEE Symp. on FCS,1976","DOI":"10.1109\/SFCS.1976.27"},{"key":"36_CR8","unstructured":"Rasiowa H.,Sikorski R.,The Mathematics of Metamathematics,Warsaw, 3rd ed.1970"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Rasiowa H.,\u03c9+-valued algorithmic logic as a tool to investigate procedures,Proc.MFCS'74,Lecture Notes in Computer Sci 28(1974) Springer Verlag","DOI":"10.1007\/3-540-07162-8_702"},{"key":"36_CR10","first-page":"13","volume":"III","author":"H. Rasiowa","year":"1975","unstructured":"Rasiowa H.,Completeness theorem for extended algorithmic logic, Proc.Vth Int.Congress of Logic Methodology and Philosophy of Science,1975 III,13\u201315","journal-title":"Proc.Vth Int.Congress of Logic Methodology and Philosophy of Science"},{"issue":"4","key":"36_CR11","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF00370471","volume":"XXXVIII","author":"H. Rasiowa","year":"1979","unstructured":"Rasiowa H.,Algorithmic Logic.Multiple-valued extensions.Studia Logica,XXXVIII 4 (1979),317\u2013335","journal-title":"Studia Logica"},{"key":"36_CR12","unstructured":"Rasiowa H., Logic of complex algorithms,Proc.FCT'79,Berlin,ed.by L.Budach,Mathematische Forschung,2(1979),Akademie Verlag,370\u2013381"},{"key":"36_CR13","first-page":"227","volume":"18","author":"A. Salwicki","year":"1970","unstructured":"Salwicki A.,Formalized algorithmic languages,Bull.Ac.Pol.Sci.,Ser. Math.Astron.Phys.18 (1970),227\u2013232","journal-title":"Bull.Ac.Pol.Sci.,Ser. Math.Astron.Phys."},{"key":"36_CR14","unstructured":"Tiuryn J.,Logic of effective definitions,RWTH Aachen Schriften zur Informatik und Angewndten Mathematik,55,juli 1979; Fundamenta Informaticae,to appear"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1980"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0022527","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T15:33:08Z","timestamp":1683300788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022527"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010027X"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0022527","relation":{},"subject":[]}}