20.3 describes the phenomenon of verb modifier climbing and 233 Proceedings of the ESSLLI Student Session 1999 Amalia Todirascu (editor). Chapter 20, Copyright c #1999, Willemijn Vermaat. Hungarian verb movement. A deductive perspective: Willemijn Vermaat /234 shows how it is dealt

your own ideas on science and education. Contents 1 Introduction 1 1.1 Topicofthesis ............................ 1 1.2 Hypothesis .............................. 1 1.3 Background.............................. 2 1.3.1 RelationwithCognitiveAI ................. 2 1.3.2 Scientificaccount....................... 2 1.4 ThesisOverview ........................... 3 2 Multimodal Categorial Grammar 5 2.1 History ................................ 5 2.2 BaseLogic............................... 5 2.2.1 Grammaticalcomposition.................. 5 2.2.2 Rulesofapplication ..................... 6 2.2.3 Rulesofabstraction ..................... 7 2.3 StructuralReasoning......................... 8 2.3.1 Reordering/restructuring .................. 9 2.4 TheMultimodalFramework..................... 10 2.4.1 Multiplemodesofcomposition ............... 10 2.4.2 Controlfeatures ....................... 11 2.4.3 Multiplemodesofcontrol.................. 12 2.5 TermDecora

In this paper we analyze the Computational System as described in the Minimalist Program in a multimodal Categorial Grammar (=MMCG) framework. We can define the basic minimalist operations, such as feature checking, MERGE and MOVE using the internal logical and structural reasoning facilities of the categorial system. However, we will show how the analysis of the minimalist MOVE operation in a multimodal categorial setting results in a decomposition of MOVE into a logical and a structural part. On the logical side, the concept of hypothetical reasoning provides a principled account of MOVE as an abstraction operation. On the structural side, structural postulates capture the phenomenon of displacement. 1

Direct questions such as “Who saw Mary? ” intuitively request for a certain type of answer, for instance a noun phrase “John ” or a quantified noun phrase such as “A man”. Following the structured meaning approach to questions, we propose an analysis of wh-questions in typelogical grammar that incorporates the requirement for a certain type of answer into the type assigned to wh-phrases. Interestingly, the syntactic and semantic decomposition leads to a derivability pattern between instances of wh-phrases. With this pattern we can explain the difference between wh-pronouns (‘who’) and wh-determiners (‘which’), and derive whquestions that require multiple answers. 1

BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists. We give an overview of BDDs from an automated deduction perspective, showing what can be done with them

The article is meant to be kind of the author's manifesto for the role of logic and deduction within Intellectics. Based on a brief analysis of this role the paper presents a number of proposals for future scientic research along the various di-mensions in the space of logical explorations

The closely related research areas management of semistructured data and languages for querying the Web have recently attracted a lot of interest. We argue that languages supporting deduction and object-orientation (dood languages) are particularly suited in this context: Object

Deductive object bases (DOBs) attempt to combine the advantages of deductive relational databases with those of object-oriented databases. From an application perspective it is often not clear for what kind of applications this combination yields significant advantages. We argue for supporting

this background, we point out future perspectives of Automated Deduction. Formal logic is still often looked upon as a kind of esoteric doctrine.

We present a parsing algorithm for Interaction Grammars using the deductive parsing framework. This approach brings new perspectives to this problem, departing from previous methods which rely on constraint-solving techniques.