{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T18:50:32Z","timestamp":1672426232857},"reference-count":34,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7106,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0304-3975(94)90057-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"149-168","source":"Crossref","is-referenced-by-count":4,"title":["Which data types have \u03c9-complete initial algebra specifications?"],"prefix":"10.1016","volume":"124","author":[{"given":"J.A.","family":"Bergstra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Heering","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90057-4_BIB1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0304-3975(87)90123-X","article-title":"Algebraic specifications of computable and semicomputable data types","volume":"50","author":"Bergstra","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90057-4_BIB2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.2307\/2964289","article-title":"Finite axiomatizability using additional predicate symbols","volume":"23","author":"Craig","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(94)90057-4_BIB3","series-title":"Mathematical Developments Arising from Hilbert Problems","first-page":"323","article-title":"Hilbert's tenth problem: positive aspects of a negative solution","author":"Davis","year":"1976"},{"key":"10.1016\/0304-3975(94)90057-4_BIB4","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1090\/S0002-9947-1960-0112855-8","article-title":"The lattice theory of Post algebras","volume":"95","author":"Epstein","year":"1960","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(94)90057-4_BIB5","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/T-C.1973.223731","article-title":"An equational axiomatization for the disjoint system of Post algebras","volume":"C-22","author":"Epstein","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(94)90057-4_BIB6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0304-3975(82)90111-6","article-title":"Mixed computation: Potential applications and problems for study","volume":"18","author":"Ershov","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90057-4_BIB7","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1051\/ita\/1990240504291","article-title":"On algebraic specifications of computable algebras with the discriminator technique","volume":"24","author":"Gagliardi","year":"1990","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/0304-3975(94)90057-4_BIB8","series-title":"CONCUR '90 \u2014 Theories of Concurrency: Unification and Extension","first-page":"314","article-title":"A new strategy for proving \u03c9-completeness applied to process algebra","volume":"Vol. 458","author":"Groote","year":"1990"},{"key":"10.1016\/0304-3975(94)90057-4_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(90)90049-8","article-title":"Equational theory of positive numbers with exponentiation is not finitely axiomatizable","volume":"49","author":"Gurevi\u010d","year":"1990","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(94)90057-4_BIB10","series-title":"Mathematics of Program Construction","first-page":"239","article-title":"Deriving mixed evaluation from standard evaluation for a simple functional language","volume":"Vol. 375","author":"Hannan","year":"1989"},{"key":"10.1016\/0304-3975(94)90057-4_BIB11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(86)90173-8","article-title":"Partial evaluation and \u03c9-completeness of algebraic specifications","volume":"43","author":"Heering","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90057-4_BIB12","doi-asserted-by":"crossref","first-page":"597","DOI":"10.2307\/2321009","article-title":"The logic of equality","volume":"84","author":"Henkin","year":"1977","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0304-3975(94)90057-4_BIB13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0004-3702(87)90017-8","article-title":"Proof by consistency","volume":"31","author":"Kapur","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(94)90057-4_BIB14","first-page":"27","article-title":"Finite axiomatizability of theories in the predicate calculus using additional predicate symbols","volume":"10","author":"Kleene","year":"1952","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(94)90057-4_BIB15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0890-5401(90)90033-E","article-title":"Tools for proving inductive equalities, relative completeness, and \u03c9-completeness","volume":"84","author":"Lazrek","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/0304-3975(94)90057-4_BIB16","series-title":"Model Theory and Arithmetic","first-page":"185","article-title":"The laws of exponentiation","volume":"Vol. 890","author":"Macintyre","year":"1981"},{"key":"10.1016\/0304-3975(94)90057-4_BIB17","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1109\/TSE.1985.232484","article-title":"Completeness of proof systems for equational specifications","volume":"SE-11","author":"MacQueen","year":"1985","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0304-3975(94)90057-4_BIB18","series-title":"TAPSOFT '87 Vol. I","first-page":"111","article-title":"Finite algebraic specifications of semicomputable data types","volume":"Vol. 249","author":"Marongiu","year":"1987"},{"key":"10.1016\/0304-3975(94)90057-4_BIB19","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0304-3975(89)90024-8","article-title":"On a conjecture of Bergstra and Tucker","volume":"67","author":"Marongiu","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90057-4_BIB20","series-title":"Rewriting Techniques and Applications","first-page":"234","article-title":"An equational logic sampler","volume":"Vol. 355","author":"McNulty","year":"1989"},{"key":"10.1016\/0304-3975(94)90057-4_BIB21","series-title":"Algebraic Methods in Semantics","first-page":"459","article-title":"Initially, induction, and computability","author":"Meseguer","year":"1985"},{"key":"10.1016\/0304-3975(94)90057-4_BIB22","series-title":"Ph.D. Thesis","article-title":"Axioms for concurrency","author":"Moller","year":"1989"},{"key":"10.1016\/0304-3975(94)90057-4_BIB23","first-page":"815","article-title":"The existence in three-valued logic of a closed class with finite basis, not having a finite complete system of identities","volume":"163","author":"Murski\u01d0","year":"1965","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0304-3975(94)90057-4_BIB24","first-page":"51","article-title":"On induction for programming logic syntax, semantics, and inductive closure","volume":"13","author":"Nourani","year":"1981","journal-title":"Bull. Eur. Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90057-4_BIB25","series-title":"9th Colloq. on Trees in Algebra and Programming","first-page":"211","article-title":"Proof by induction in equational theories with relations between constructors","author":"Paul","year":"1984"},{"key":"10.1016\/0304-3975(94)90057-4_BIB26","doi-asserted-by":"crossref","first-page":"313","DOI":"10.2307\/2272645","article-title":"The \u03bb-calculus is \u03c9-incomplete","volume":"39","author":"Plotkin","year":"1974","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(94)90057-4_BIB27_1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.2307\/2370324","article-title":"Introduction to a general theory of elementary propositions","volume":"43","author":"Post","year":"1921","journal-title":"Amer. J. Math."},{"key":"10.1016\/0304-3975(94)90057-4_BIB27_2","series-title":"From Frege to G\u00f6del","first-page":"264","year":"1967"},{"key":"10.1016\/0304-3975(94)90057-4_BIB28","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/malq.19690152003","article-title":"Solution of the identity problem for integral exponential functions","volume":"15","author":"Richardson","year":"1969","journal-title":"Zeitschr. f. math. Logik und Grundlagen d. Math."},{"key":"10.1016\/0304-3975(94)90057-4_BIB29","series-title":"Computer Science and Multiple-Valued Logic","article-title":"Completeness properties of multiple-valued logic algebras","author":"Rosenberg","year":"1977"},{"key":"10.1016\/0304-3975(94)90057-4_BIB30_1","article-title":"Equational logic","author":"Taylor","year":"1979","journal-title":"Houston J. Math."},{"key":"10.1016\/0304-3975(94)90057-4_BIB30_2","series-title":"Universal Algebra","author":"Gr\u00e4tzer","year":"1979"},{"key":"10.1016\/0304-3975(94)90057-4_BIB31","first-page":"147","article-title":"An equational definition of a class of Post algebras","volume":"XII","author":"Traczyk","year":"1964","journal-title":"Bulletin de l'Acad\u00e9mie Polonaise des Sciences, S\u00e9rie des sciences math., astr. et phys."},{"key":"10.1016\/0304-3975(94)90057-4_BIB32","doi-asserted-by":"crossref","first-page":"193","DOI":"10.2307\/2371067","article-title":"Definition of Post's generalized negative and maximum in terms of one binary operation","volume":"58","author":"Webb","year":"1936","journal-title":"Amer. J. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900574?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900574?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:26:14Z","timestamp":1555115174000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900574"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0304397594900574"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90057-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}