{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:12:18Z","timestamp":1725631938904},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540071624"},{"type":"electronic","value":"9783540374923"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07162-8_702","type":"book-chapter","created":{"date-parts":[[2011,11,9]],"date-time":"2011-11-09T16:16:43Z","timestamp":1320855403000},"page":"423-450","source":"Crossref","is-referenced-by-count":5,"title":["\u03c9+ -valued algorithmic logic as a tool to investigate procedures"],"prefix":"10.1007","author":[{"given":"H.","family":"Rasiowa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"BLIKLE,A.; MAZURKIEWICZ,A. An algebraic approach to the theory of programs,algorithms,languages and recursiveness.Proc.Intern. Symp.and Summer School on Math.Found.of Comp.Sci.,Warsaw,Jab\u0142onna, August 21\u201327,1972, CCPAS Reports,1972","DOI":"10.1016\/S0019-9958(72)90063-0"},{"key":"42_CR2","unstructured":"CADIOU,J.M. Recursive definitions of partial functions and their computations. Ph.D.Thesis,Computer Science Dept.,Stanford Univ."},{"key":"42_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01705528","volume":"1","author":"E. Engeler","year":"1967","unstructured":"ENGELER, E. Algorithmic properties of structures,Math.Syst. Theory 1 \/1967\/, 183\u2013195","journal-title":"Math.Syst. Theory"},{"key":"42_CR4","volume-title":"Languages with expressions of infinite length","author":"C. R. Karp","year":"1964","unstructured":"KARP, C.R. Languages with expressions of infinite length. North-Holland Publishing Co., Amsterdam 1964"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"KRECZMAR,A. Effectivity problems in algorithmic logic. Ph.D.Thesis,Faculty of Mathematics and Mechanics,University of Warsaw, 1973","DOI":"10.1007\/978-3-662-21545-6_45"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"MANNA, Z.; VUILLEMIN,J.Fixpoint approach to the theory of computation.Stanford Artificial Intelligence Project,Computer Science Department,School of Humanities and Sciences,Stanford University, Unpublished memo,1972","DOI":"10.1145\/361454.361460"},{"key":"42_CR7","first-page":"421","volume":"19","author":"G. Mirkowska","year":"1971","unstructured":"MIRKOWSKA, G. On formalized systems of algorithmic logic, Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys.,19 \/1971\/,421\u2013428","journal-title":"Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys."},{"key":"42_CR8","unstructured":"MIRKOWSKA-SALWICKA, G.Algorithmic logic and its applications in the programming theory. Ph.D.Thesis,Faculty of Mathematics and Mechanics,University of Warsaw,1972"},{"key":"42_CR9","first-page":"717","volume":"20","author":"E. Perkowska","year":"1972","unstructured":"PERKOWSKA, E. On algorithmic m-valued logics.Bull.Ac.Pol. Sci.,Ser.Sci.Math.Astron.Phys.,20 \/1972\/,717\u2013719","journal-title":"Bull.Ac.Pol. Sci.,Ser.Sci.Math.Astron.Phys."},{"key":"42_CR10","first-page":"319","volume":"20","author":"H. Rasiowa","year":"1972","unstructured":"RASIOWA, H. On logical structure of programs,ibid.,20 \/1972\/, 319\u2013324","journal-title":"Bull.Ac.Pol. Sci.,Ser.Sci.Math.Astron.Phys."},{"key":"42_CR11","unstructured":"RASIOWA,H. On a logical structure of programs,Proc.Intern. Symp.and Summer School on Math.Found.of Comp.Sci.,Warsaw,Jab\u0142onna, August 21\u201327,1972,CCPAS Reports,1972"},{"key":"42_CR12","first-page":"209","volume":"21","author":"H. Rasiowa","year":"1973","unstructured":"RASIOWA, H. On generalized Post algebras of order \u03c9+ and \u03c9+-valued predicate calculi.Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys., 21 \/1973\/,209\u2013219","journal-title":"Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys."},{"key":"42_CR13","first-page":"451","volume":"21","author":"H. Rasiowa","year":"1973","unstructured":"RASIOWA, H. On logical structure of mix-valued programs and \u03c9+-valued algorithmic logic.ibid., 21 \/1973\/,451\u2013458","journal-title":"Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys."},{"key":"42_CR14","first-page":"559","volume":"21","author":"H. Rasiowa","year":"1973","unstructured":"RASIOWA, H. Formalized \u03c9+-valued algorithmic systems.ibid., 21 \/1973\/,559\u2013565","journal-title":"Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys."},{"key":"42_CR15","unstructured":"RASIOWA,H. On \u03c9+-valued algorithmic logic and related problems. CCPAS Reports,1974"},{"key":"42_CR16","first-page":"595","volume":"22","author":"H. Rasiowa","year":"1974","unstructured":"RASIOWA, H. A simplified formalization of \u03c9+-valued algorithmic logic. Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys.,22 \/1974\/,595\u2013603","journal-title":"Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys."},{"key":"42_CR17","first-page":"605","volume":"22","author":"H. Rasiowa","year":"1974","unstructured":"RASIOWA, H. Extended \u03c9+-valued algorithmic logic. ibid. 22 \/1974\/,605\u2013610","journal-title":"Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys."},{"key":"42_CR18","unstructured":"Scott,D. An outline of a Mathematical Theory of Computation. Oxford University computing Laboratory,Programming Research Group, Technical Monograph PRG 2 \/November 1970\/"},{"key":"42_CR19","first-page":"227","volume":"18","author":"A. Salwicki","year":"1970","unstructured":"SALWICKI, A. Formalized algorithmic languages. Bull.Ac.Pol. Sci.,Ser.Sci.Math.Astron.Phys.,18 \/1970\/,227\u2013232","journal-title":"Bull.Ac.Pol. Sci.,Ser.Sci.Math.Astron.Phys."},{"key":"42_CR20","first-page":"275","volume":"18","author":"A. Salwicki","year":"1970","unstructured":"SALWICKI, A. On the equivalence of FS-expressions and programs. ibid. 18 \/1970\/,275\u2013278","journal-title":"Bull.Ac.Pol. Sci.,Ser.Sci.Math.Astron.Phys."},{"key":"42_CR21","first-page":"279","volume":"18","author":"A. Salwicki","year":"1970","unstructured":"SALWICKI, A. On the predicate calculi with the iteration quantifiers.ibid. 18 \/1970\/,279\u2013285","journal-title":"Bull.Ac.Pol. Sci.,Ser.Sci.Math.Astron.Phys."},{"key":"42_CR22","unstructured":"SALWICKI,A. Programmability and Recursiveness \/an application of algorithmic logic to procedures\/. To appear in Dissertationes Mathematicae"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07162-8_702.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T17:52:47Z","timestamp":1639590767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07162-8_702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540071624","9783540374923"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-07162-8_702","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}