{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T05:40:47Z","timestamp":1698298847529},"reference-count":5,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,11,13]],"date-time":"2006-11-13T00:00:00Z","timestamp":1163376000000},"content-version":"vor","delay-in-days":5064,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[1993,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show that the problem of deciding if a finite set of closed terms in normal form is a basis is recursively unsolvable. The restricted problem concerning one element sets is still recursively unsolvable. MSC: 03B40, 03D35.<\/jats:p>","DOI":"10.1002\/malq.19930390120","type":"journal-article","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T01:23:22Z","timestamp":1180833802000},"page":"178-180","source":"Crossref","is-referenced-by-count":0,"title":["The basis decision problem in \u03bb\u2010calculus"],"prefix":"10.1002","volume":"39","author":[{"given":"Benedetto","family":"Intrigila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,11,13]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Lambda Calculus","author":"Barendregt H. P.","year":"1984"},{"key":"e_1_2_1_3_2","volume-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers H.","year":"1967"},{"key":"e_1_2_1_4_2","unstructured":"Sacchetti G. Introduzione alla programmazione funzionale. Master Thesis University of Rome 1990."},{"key":"e_1_2_1_5_2","unstructured":"Statman R. Normal varieties of combinators. Research Report no. 89\u201361 Department of Mathematics Carnegie Mellon University October1989."},{"key":"e_1_2_1_6_2","unstructured":"Statman R. On translating terms into combinators: The basis problem. In: Proceedings IEEE Symposium \u2018Logic in Computer Science\u2019 Boston1986 pp.378\u2013382."}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.19930390120","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.19930390120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T20:58:32Z","timestamp":1698267512000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.19930390120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["10.1002\/malq.19930390120"],"URL":"https:\/\/doi.org\/10.1002\/malq.19930390120","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}