{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T16:10:16Z","timestamp":1736007016658,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_21","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"292-308","source":"Crossref","is-referenced-by-count":0,"title":["Decidability of Term Algebras Extending Partial Algebras"],"prefix":"10.1007","author":[{"given":"Bakhadyr","family":"Khoussainov","sequence":"first","affiliation":[]},{"given":"Sasha","family":"Rubin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0304-3975(01)00368-1","volume":"286","author":"E. Astesiano","year":"2002","unstructured":"Astesiano, E., Bidoit, M., Kirchner, H., Krieg-Br\u00fcckner, B., Mosses, P.D., Sannella, D., Tarlecki, A.: Casl: The Common Algebraic Specification Language. Theoretical Computer Science\u00a0286(2), 153\u2013196 (2002)","journal-title":"Theoretical Computer Science"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Blumensath, A., Gradel, E.: Automatic structures. In: Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 51\u201362 (2000)","DOI":"10.1109\/LICS.2000.855755"},{"issue":"1-2","key":"21_CR3","first-page":"165","volume":"122","author":"H. Comon","year":"1993","unstructured":"Comon, H.: Complete axiomatization of some quotient term algebras. Theoretical Computer Science\u00a0122(1-2), 165\u2013200 (1993)","journal-title":"Theoretical Computer Science"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(90)90080-L","volume":"48","author":"K. Compton","year":"1990","unstructured":"Compton, K., Henson, C.: A uniform method for proving lower bounds on computational complexity of logical theories. Annals of Pure and Applied Logic\u00a048, 1\u201379 (1990)","journal-title":"Annals of Pure and Applied Logic"},{"key":"21_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511551574","volume-title":"Model theory","author":"W. Hodges","year":"1993","unstructured":"Hodges, W.: Model theory. Cambridge University Press, Cambridge (1993)"},{"key":"21_CR6","unstructured":"Khoussainov, B., Rubin, S., Stephan, F.: Automatic Linear Orders and Trees. In: Kolaitis, P.G. (ed.) Transactions on Computational Logic (TOCL) special issue (selected papers from the LICS 2003 conference) (2003) (accepted)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B. Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic Presentations of Structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 367\u2013393. Springer, Heidelberg (1995)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Korovin, K., Voronkov, A.: A decision procedure for the existential theory of term algebra with the Knuth-Bendix ordering. In: Proceedings IEEE Conference on Logic in Computer Science, pp. 291\u2013302 (2000)","DOI":"10.1109\/LICS.2000.855777"},{"key":"21_CR9","unstructured":"Gr\u00e4tzer, G.: Universal Algebra. D. Van Nostrand Co., Inc., Princeton, N.J.-Toronto, Ont.-London (1968)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Complexity of finitely presented algebras. In: Proceedings of the 9th ACM symposium on theory of computing, pp. 164\u2013177 (1977)","DOI":"10.1145\/800105.803406"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Partial automata and finitely generated congruences: an extension of Nerode\u2019s theorem. In: Crossley, J., Remmel, J., Shore, R., Sweedler, M. (eds.) Logical methods: in honour of Anil Nerode\u2019s Siztieth Birthday, Birkhauser, pp. 490\u2013511 (1993)","DOI":"10.1007\/978-1-4612-0325-4_16"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Kuncak, V., Rinard, M.C.: Structural sybtyping of non-recursive types is decidable. In: Proceedings IEEE Conference on Logic in Computer Science, pp. 96\u2013107 (2003)","DOI":"10.1109\/LICS.2003.1210049"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-39813-4_25","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Lohrey","year":"2003","unstructured":"Lohrey, M.: Automatic structures of bounded degree. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 346\u2013360. Springer, Heidelberg (2003)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Maher, M.: A CLP view of logic programming. In: Algebraic and Logic Programming, pp. 364\u2013383 (1992)","DOI":"10.1007\/BFb0013838"},{"key":"21_CR15","unstructured":"A. Mal\u2019cev: Axiomatizable classes of locally free algebras of various types. In The Metamathimatics of Algebraic Systems. Anatoli\u012d Ivanovic\u0306 Mal\u2019cev. Collected papers: 1936-1967, B. Wells III, Ed. Vol. 66. North Holland. Chapter 23, 262\u2013281 (1971)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-540-30142-4_23","volume-title":"Theorem Proving in Higher Order Logics","author":"T. Zhang","year":"2004","unstructured":"Zhang, T., Sipma, H., Manna, Z.: Term algebras with length function and bounded quantifier alternation. In: Slind, K., Bunker, A., Gopalakrishnan, G.C. (eds.) TPHOLs 2004. LNCS, vol.\u00a03223, pp. 321\u2013336. Springer, Heidelberg (2004)"},{"issue":"2","key":"21_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/371316.371494","volume":"2","author":"T. Rybina","year":"2001","unstructured":"Rybina, T., Voronkov, A.: A Decision procedure for term algebras with queues. ACM Transaction on Computational Logic\u00a02(2), 155\u2013181 (2001)","journal-title":"ACM Transaction on Computational Logic"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/3-540-61511-3_91","volume-title":"Automated Deduction - Cade-13","author":"S. Vorobyov","year":"1996","unstructured":"Vorobyov, S.: An improved lower bound for the elementary theories of trees. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol.\u00a01104, pp. 275\u2013287. Springer, Heidelberg (1996)"},{"issue":"1-2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(01)00185-2","volume":"275","author":"I. Walukiewicz","year":"2002","unstructured":"Walukiewicz, I.: Monadic second order logic on tree-like structures. Theoretical computer science\u00a0275(1-2), 311\u2013346 (2002)","journal-title":"Theoretical computer science"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T15:38:34Z","timestamp":1736005114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11538363_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}