{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:50Z","timestamp":1725483770548},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_30","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:28:20Z","timestamp":1178357300000},"page":"343-352","source":"Crossref","is-referenced-by-count":1,"title":["Iteration Theories of Boolean Functions"],"prefix":"10.1007","author":[{"given":"Zolt\u00e1n","family":"\u00c9sik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"30_CR1","volume-title":"Technical Report","author":"H. Beki\u0107","year":"1969","unstructured":"H. Beki\u0107, Definable operations in general algebras, and the theory of automata and flowcharts, Technical Report, IBM Laboratory, Vienna, 1969."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"S. L. Bloom and Z. \u00c9sik, Iteration Theories: The Equational Logic of Iterative Processes, Springer, 1993.","DOI":"10.1007\/978-3-642-78034-9"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(96)00248-4","volume":"179","author":"S. L. Bloom","year":"1997","unstructured":"S. L. Bloom and Z. \u00c9sik, The equational logic of fixed points, Theoretical Computer Science, 179(1997), 1\u201360.","journal-title":"Theoretical Computer Science"},{"key":"30_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/10719839_36","volume-title":"proc. LATIN 2000","author":"S. L. Bloom","year":"2000","unstructured":"S. L. Bloom and Z. \u00c9sik, There is no finite axiomatization of iteration theories, in: proc. LATIN 2000, LNCS 1776, Springer, 2000, 367\u2013376."},{"key":"30_CR5","volume-title":"A theory of programs","author":"J. W. Bakker de","year":"1969","unstructured":"J. W. de Bakker and D. Scott, A theory of programs. IBM, Vienna, 1969."},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/inco.1998.2746","volume":"148","author":"Z. \u00c9sik","year":"1999","unstructured":"Z. \u00c9sik, Group axioms for iteration, Information and Computation, 148(1999), 131\u2013180.","journal-title":"Information and Computation"},{"key":"30_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-16066-3_16","volume-title":"Computation Theory, Zabor\u00f3w, 1984","author":"D. Niwinski","year":"1985","unstructured":"D. Niwinski, Equational \u03bc-calculus, Computation Theory, Zabor\u00f3w, 1984, LNCS 208, Springer, 1985, 169\u2013176."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"E. L. Post, The Two-Valued Iterative Systems of Mathematical Logic, Princeton University Press, 1941.","DOI":"10.1515\/9781400882366"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:41:41Z","timestamp":1556376101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}