Abstract
Current research programs in the logic of language and computational linguistics employ certain methods characteristic of logical proof theory, a branch of logic devoted to fine structures of proofs. For instance, formal semantics of natural language applies the Curry-Howard correspondence between natural deduction proofs and typed lambda-terms to describe the process of computing semantic representations of expressions. Cut-free systems in the Gentzen form are used in standard axiomatizations of logical calculi of categorial grammar, closely related to substructural logics. Cut elimination and interpolation theorems play a significant part in some proofs of equivalence theorems for different kinds of formal grammar and in some proofs of completeness theorems for substructural logics. Proofs by resolution and unification, known from logic programming, are also a basic technique of unification systems in computational linguistics, as e.g. Definite Clause Grammars and Categorial Unification Grammars. Unification can also be used in learning algorithms for categorial grammars; see (1990), (1994), (1994) and (1997). A thorough account of interrelations between mathematical linguistics and proof theory can be found in (1997) (also see van Benthem, 1991).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajdukiewicz, K.: 1935, ‘Die syntaktische Konnexität’, Studio Philosophica 1, pp. 1–27.
Batóg, T.: 1994, ‘Ajdukiewicz and the development of formal logic’, Poznań Studies in the Philosophy of Sciences and the Humanities 40, pp. 53–67.
van Benthem, J.: 1991, Language in Action. Categories, Lambdas and Dynamic Logic, Elsevier, North Holland, Amsterdam.
Buszkowski, W.: 1987, ‘Solvable Problems for Classical Categorial Grammars’, Bull. Polish Academy of Sciences: Mathematics 35, pp. 373–382.
Buszkowski, W.: 1989, ‘Principles of Categorial Grammar in the Light of Current Formalisms’, in K. Szaniawski, (ed.), The Lvov-Warsaw School and the Vienna Circle, Nijhoff, Dordrecht, pp. 113–137.
Buszkowski, W.: 1995, ‘Grammatical Structures and Logical Deductions’, Logic and Logical Philosophy 3, pp. 47–86.
Buszkowski, W.: 1995a, ‘Categorial Grammars with Negative Information’, in Wansing, H. (ed.), Negation. A Notion in Focus, de Gruyter, Berlin, pp. 107–126.
Buszkowski, W.: 1997, ‘Mathematical Linguistics and Proof Theory’, in J. van Benthem and A. der Meulen (eds.), Handbook of Logic and Language, Elsevier, North Holland, pp. 683–736.
Buszkowski, W., Penn, G.: 1990, ‘Categorial Grammars Determined from Linguistic Data by Unification’, Studia Logica 49, pp. 431–454.
Curry, H. B., Feys, R.: 1958, Combinatory Logic, vol. 1, North Holland, Amsterdam.
Kanazawa, M.: 1994, Learnable Classes of Categorial Grammars, Ph.D. Thesis, Stanford University.
Lambek, J.: 1958, ‘The mathematics of sentence structure’, The American Mathematical Monthly 65, pp. 154–170.
Marciniec, J.: 1994, ‘Learning categorial grammars by unification with negative constraints’, Journal of Applied Non-Classical Logics 4, pp. 181–200.
Marciniec, J.: 1997, ‘Infinite set unification with application to categorial grammar’, Studia Logica 58, pp. 339–355.
Woleński, J.: 1985, Filozoficzna szkoła Iwowsko-warszawska, PWN, Warsaw. Eng. trans, as Woleński (1989).
Woleński, J.: 1989, Logic and Philosophy in the Lvov-Warsaw School, Kluwer Academic Publishers, Dordrecht.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Buszkowski, W. (1998). The Ajdukiewicz Calculus, Polish Notation and Hilbert-Style Proofs. In: Kijania-Placek, K., Woleński, J. (eds) The Lvov-Warsaw School and Contemporary Philosophy. Synthese Library, vol 273. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5108-5_20
Download citation
DOI: https://doi.org/10.1007/978-94-011-5108-5_20
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6146-9
Online ISBN: 978-94-011-5108-5
eBook Packages: Springer Book Archive