{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T18:20:50Z","timestamp":1747592450713},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch Math Logic"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1007\/bf01370691","type":"journal-article","created":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T11:36:01Z","timestamp":1112355361000},"page":"1-17","source":"Crossref","is-referenced-by-count":2,"title":["Quantifier elimination for infinite terms"],"prefix":"10.1007","volume":"31","author":[{"given":"G.","family":"Marongiu","sequence":"first","affiliation":[]},{"given":"S.","family":"Tulipani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"3","volume":"8","author":"O.V. Belegradek","year":"1988","unstructured":"[Be] Belegradek, O.V.: Theory of models of locally free algebras. Tr. Inst. Mat.8, 3?25 (1988)","journal-title":"Tr. Inst. Mat."},{"issue":"2","key":"CR2","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1017\/S0022481200028383","volume":"53","author":"E. Bouscaren","year":"1988","unstructured":"[BP] Bouscaren, E., Poizat, B.: Des belles paires aux beaux uples. J. Symb. Logic53(2), 434?442 (1988)","journal-title":"J. Symb. Logic"},{"key":"CR3","volume-title":"Logic and databases","author":"K.L. Clark","year":"1978","unstructured":"[Cl] Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and databases. New York: Plenum Press 1978"},{"key":"CR4","unstructured":"[Col] Colmerauer, A.: Equations and inequations on finite and infinite trees. FGCS'84 Proc., pp. 85?99 (1984)"},{"key":"CR5","first-page":"375","volume":"7","author":"H. Comon","year":"1989","unstructured":"[CL] Comon, H., Lescanne, P.: Equational problems and disunification. J. Sym. Comput.7, 375?426 (1989)","journal-title":"J. Sym. Comput."},{"key":"CR6","unstructured":"[Com] Comon, H.: Disunification: a Survey. Preprint Draft Version 1.5, 1990"},{"issue":"2","key":"CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1985","unstructured":"[Co] Courcelle, B.: Fundamentals properties of infinite trees. Theor. Comput. Sci.25(2), 95?169 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","volume":"2","author":"M.R. Fitting","year":"1985","unstructured":"[Fi] Fitting, M.R.: A Kripke-Kleene semantics for logic programs. J. Logic Program2, 295?312 (1985)","journal-title":"J. Logic Program"},{"key":"CR9","first-page":"XI","volume-title":"Lect. Notes Comput. Sci., vol. 99","author":"I. Guessarian","year":"1981","unstructured":"[Gu] Guessarian, I.: Algebraic semantics. In: Goos, G., Hartmanis, J. (ed.) (Lect. Notes Comput. Sci., vol. 99, pp. XI, 158) Berlin Heidelberg New York: Springer 1981"},{"key":"CR10","first-page":"275","volume-title":"Formal descriptions of programming Concepts III","author":"J. Jaffar","year":"1987","unstructured":"[JLM] Jaffar, J., Lassez, J.-L., Maher, M.J.: Prolog-II as an instance of the logic programming language scheme. In: Wirsing, M. (ed.) Formal descriptions of programming Concepts III, pp. 275?299. Amsterdam: North-Holland 1987"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"[Ku] Kunen, K.: Negation in logic programming. J. Logic Program4, 289?308 (1987)","journal-title":"J. Logic Program"},{"key":"CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundation of logic programming","author":"J.W. Lloyd","year":"1984","unstructured":"[Ll] Lloyd, J.W.: Foundation of logic programming. Berlin Heidelberg New York: Springer 1984"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"[Ma] Maher, M.J.: Complete axiomatizations of the algebras of finite, infinite, and rational trees. Proc. 3rd IEEE Symp. Logic in Computer Science, pp. 348?357. Edinburgh 1988","DOI":"10.1109\/LICS.1988.5132"},{"key":"CR14","first-page":"768","volume":"138","author":"A.I. Mal'cev","year":"1961","unstructured":"[Mal1] Mal'cev, A.I.: On the elementary theories of locally free algebras. Sov. Math. Dokl.138, 768?771 (1961)","journal-title":"Sov. Math. Dokl."},{"key":"CR15","series-title":"Studies in Logic","first-page":"262","volume-title":"The metamatematics of algebraic systems: collected papers","author":"A.I. Mal'cev","year":"1971","unstructured":"[Mal2] Mal'cev, A.I.: Axiomatizable classes of locally free algebras of various types. In: Wells, B.F. (ed.) The metamatematics of algebraic systems: collected papers, Studies in Logic, pp. 262?281. Amsterdam: North-Holland 1971"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0743-1066(88)90013-1","volume":"5","author":"P. Mancarella","year":"1988","unstructured":"[MMP] Mancarella, P., Martini, S., Pedreschi, D.: Complete logic programs with domain-closure-axiom. J. Logic Program5, 263?276 (1988)","journal-title":"J. Logic Program"},{"issue":"3","key":"CR17","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/322203.322204","volume":"27","author":"D.C. Oppen","year":"1980","unstructured":"[Op] Oppen, D.C.: Reasoning about recursively defined data structures. J. ACM27(3), 403?411 (1980)","journal-title":"J. ACM"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/S0049-237X(08)71116-9","volume-title":"Handbook of Mathematical Logic, Studies in Logic, vol. 90","author":"M.O. Rabin","year":"1977","unstructured":"[Ra] Rabin, M.O.: Decidable theories. In: Barwise, J. (ed.) Handbook of Mathematical Logic, Studies in Logic, vol. 90, pp. 595?630. Amsterdam: North-Holland 1977"},{"key":"CR19","first-page":"277","volume-title":"Logic Colloquium '86, Studies in Logic, vol. 124","author":"J.C. Shepherdson","year":"1988","unstructured":"[Sh] Shepherdson, J.C.: Introduction to the theory of logic programming. In: Drake, F.R., Truss, J.K. (ed.) Logic Colloquium '86, Studies in Logic, vol. 124, pp. 277?318. Amsterdam: North-Holland 1988"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01370691.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01370691\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01370691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T05:35:42Z","timestamp":1556861742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01370691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["BF01370691"],"URL":"https:\/\/doi.org\/10.1007\/bf01370691","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}