{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:28:05Z","timestamp":1725488885816},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422518"},{"type":"electronic","value":"9783540457381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45738-0_15","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T15:40:39Z","timestamp":1186760439000},"page":"251-265","source":"Crossref","is-referenced-by-count":3,"title":["Lambek Calculus Proofs and Tree Automata"],"prefix":"10.1007","author":[{"given":"Hans-Joerg","family":"Tiede","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,18]]},"reference":[{"key":"15_CR1","first-page":"1","volume":"1","author":"K. Ajdukiewicz","year":"1935","unstructured":"Ajdukiewicz, K. Die syntaktische Konnexit\u00e4t. In Studia Philosophica 1:1\u201327, 1935.","journal-title":"Studia Philosophica"},{"key":"15_CR2","unstructured":"Bar-Hillel, Y. Language and Information. Addison-Wesley, Reading, 1964"},{"issue":"2\/3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1515\/thli.1987.14.2-3.119","volume":"14","author":"J.. L. Syntax. I. Benthem van","year":"1987","unstructured":"Benthem, J. van. Logical Syntax. In Theoretical Linguistics 14(2\/3): 119\u2013142, 1987.","journal-title":"Theoretical Linguistics"},{"key":"15_CR4","volume-title":"Language in Action","author":"J. Benthem van","year":"1995","unstructured":"Benthem, J. van Language in Action. MIT Press, Cambridge, MA, 1995."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/B978-044481714-3\/50016-3","volume-title":"Handbook of Logic & Language","author":"W. Buszkowski","year":"1997","unstructured":"Buszkowski, W. Proof Theory and Mathematical Linguistics. In Benthem, J. and A. ter Meulen (eds.) Handbook of Logic & Language. MIT Press: 683\u2013736, Cambridge, 1997."},{"key":"15_CR6","volume-title":"Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birth-day","author":"R. T. T.-c. o. m. c. grammars. I. JFAK. Carpenter","year":"1999","unstructured":"Carpenter, R. The Turing-completeness of multimodal categorial grammars. In JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birth-day. Gerbrandy, J., M. Marx, M. de Rijke, and Y. Venema (eds.), Vossiuspers, Amsterdam University Press, 1999."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0304-3975(95)00211-1","volume":"164","author":"A. Finkel","year":"1996","unstructured":"Finkel, A. and I. Tellier. A polynomial algorithm for the membership problem with categorial grammars. In Theoretical Computer Science 164: 207\u2013221, 1996.","journal-title":"Theoretical Computer Science"},{"key":"15_CR8","unstructured":"G\u00e9cseg, F. and M. Steinby. Tree Automata, Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"15_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511608865","volume-title":"Basic Simple Type Theory","author":"J. R. Hindley","year":"1997","unstructured":"Hindley, J. R. Basic Simple Type Theory. Cambridge University Press, Cambridge, 1997."},{"key":"15_CR10","series-title":"IRCS Report 98-25, Institute for Research in Cognitive Science","volume-title":"On the generative capacity of multi-modal Categorial Grammars","author":"G. Jaeger","year":"1998","unstructured":"Jaeger, G. On the generative capacity of multi-modal Categorial Grammars. IRCS Report 98-25, Institute for Research in Cognitive Science, University of Pennsylvania, Philadelphia, 1998."},{"key":"15_CR11","volume-title":"Handbook of Logic & Language","author":"T. Janssen","year":"1997","unstructured":"Janssen, T. Compositionality. In Benthem, J. van, and A. ter Meulen (eds.) Handbook of Logic & Language. MIT Press, Cambridge, 1997."},{"key":"15_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1844-9","volume-title":"Automata and Computability","author":"D. Kozen","year":"1997","unstructured":"Kozen, D., Automata and Computability. Springer, Berlin, 1997."},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J. Lambek","year":"1958","unstructured":"Lambek, J. The Mathematics of Sentence Structure. In American Mathematical Monthly 65: 154\u2013169, 1958.","journal-title":"American Mathematical Monthly"},{"key":"15_CR14","series-title":"Unpublished Master\u2019s Thesis","volume-title":"Algorithmic and Formal Language Theoretic Aspects of Lambek Calculus","author":"O. Moerbeek","year":"1991","unstructured":"Moerbeek, O. Algorithmic and Formal Language Theoretic Aspects of Lambek Calculus. Unpublished Master\u2019s Thesis, Dept. of Logic and Theoretical Computer Science, University of Amsterdam, 1991."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/B978-044481714-3\/50005-9","volume-title":"Handbook of Logic & Language","author":"M. C. T. Logics. I. Moortgat","year":"1997","unstructured":"Moortgat, M. Categorial Type Logics. In Benthem, J. van, and A ter Meulen (eds.) Handbook of Logic & Language. Cambridge: MIT Press: 93\u2013178, 1997."},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Pentus, M. Lambek grammars are context-free. In Proc. 8th Annual IEEE Symposium on Logic in Computer Science., 1993.","DOI":"10.1109\/LICS.1993.287565"},{"key":"15_CR17","unstructured":"Rogers, J. A Descriptive Approach to Language Theoretic Complexity. CSLI Publications, 1998."},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0024-3841(93)90024-Q","volume":"90","author":"M. Steedman","year":"1993","unstructured":"Steedman, M. Categorial Grammar. In Lingua 90: 221\u2013258, 1993.","journal-title":"Lingua"},{"key":"15_CR19","volume-title":"Deductive Systems and Grammars","author":"H.-J. Tiede","year":"1999","unstructured":"Tiede, H.-J. Deductive Systems and Grammars. PhD Dissertation, Indiana University, 1999."},{"key":"15_CR20","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0022-0000(67)80022-9","volume":"1","author":"J. W. Thatcher","year":"1967","unstructured":"Thatcher, J. W. Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory. In J.Comput. System Sci. 1, 317\u2013322, 1967.","journal-title":"J.Comput. System Sci"},{"key":"15_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-56734-8","volume-title":"The Logic of Information Structures","author":"H. Wansing","year":"1993","unstructured":"Wansing, H. The Logic of Information Structures. Springer Verlag, Berlin, 1993."}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45738-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T09:42:02Z","timestamp":1550742122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45738-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422518","9783540457381"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45738-0_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}