@article{Buszkowski_2003, title={Grammatical structures and logical deductions}, url={https://apcz.umk.pl/LLP/article/view/LLP.1995.004}, DOI={10.12775/LLP.1995.004}, abstractNote={The three essays presented here concern natural connections between grammatical derivations and structures provided by certain standard grammar formalisms, on the one hand, and deductions in logical systems, on the other hand. In the first essay we analyse the adequacy of Polish notation for higher-order languages. The Ajdukiewicz algorithm (Ajdukiewicz 1935) is discussed in terms of generalized MP-deductions. We exhibit a failure in Ajdukiewicz’s original version of the algorithm and give a correct one; we prove that generalized MP-deductions have the frontier property, which is essential for the plausibility of Polish notation. The second essay deals with logical systems corresponding to different grammar formalisms, as e.g. Finite State Acceptors, Context-Free Grammars, Categorial Grammars, and others. We show how can logical methods be used to establish certain linguistically significant properties of formal grammars. The third essay discusses the interplay between Natural Deduction proofs in grammar oriented logics and semantic structures expressible by typed lambda terms and combinators.}, number={3}, journal={Logic and Logical Philosophy}, author={Buszkowski, Wojciech}, year={2003}, month={Jan.}, pages={47–86} }