Computational Linguistics & Phonetics Computational Linguistics & Phonetics Fachrichtung 4.7 Universität des Saarlandes

Logical Grammar

Vorlesung: Computerlinguistik, M.Sc.

Leitung: Carl Pollard
Ort: Geb. C74, Raum 3.23
Zeit: Mon, Wed, Fri 11:45 - 14:15 Uhr (2 weeks)
Beginn: Mon 04.07.2011
Geeignet für: M.Sc.

In this two-week course, we introduce some basic tools of mathematical logic, and show how they can be applied to develop a simple yet powerful theory of natural language syntax, semantics, and their interface. The logical tools introduced include sequent-style natural deduction (ND), linear logic (LL), positive intuitionistic logic, typed lambda calculus, and higher order logic (HOL). We use these to develop an English grammar with only two rules in which syntactic categories are LL formulas abstract syntactic analyses (also called tectostructures) are ND proofs of them. At the same time, we use HOL to assign to each linguistic expression a concrete syntax (also called phenostructure) and a fine-grained (hyperintensional) semantic interpretation.

Will be announced in the first meeting.

This is a compact course with 6 meetings, 21/2 hours each: Mon, Wed, Fri (2 weeks), beginning on Mon July 4th.

Stellung im Studienplan
M.Sc. LST and LCT: Specialization course; areas L and CL

3 CP