|
|
| PROGRAMME |
|---|
Alike the previous years, courses will be provided in six different sections :
Language, Logic, Computation, Language & Logic, Language & Computation,
and Logic & Computation. A timetable of the workshop is available.
Lexical Semantics of Predicative Forms (abstract)
Human Sentence Comprehension (abstract)
Grammatical Resources: Logic & Structure (abstract)
The Syntax and Semantics of Focus (abstract)
The Major Syntactic Structures of French (abstract)
Applications of Pragmatic Theories of Discourse to Natural Language Interpretation (abstract)
Formal elegance and natural complexity in morphology (abstract)
Circularity (abstract)
Applicative Theories and Variable Types (abstract)
Categorial Techniques for Combining Logics (abstract)
Finite Model Theory (abstract)
Provability and Reflection (abstract)
Topics in Polymodal Logic (abstract)
Translations, Reductions and Interpretations (abstract)
Programming in the Pi-Calculus (abstract)
Constraint Logic Programming (abstract)
Set Constraints, Their Use for Program Analysis and for Solving Constraint Problems over (Feature) Trees (abstract)
Computational Biology (abstract)
Constraint Reasoning (abstract)
Database theory (abstract)
Logical Aspects of the Semantics-Pragmatics Interface (abstract)
Update Semantics & Discourse Coherence(abstract)
Logics and Grammars as Deductive Systems (abstract)
Category-Theoretic Foundations of Formal Linguistics(abstract)
Mathematical Linguistics and Abstract Grammar(abstract)
AGM in and out of Focus(abstract)
Quantifiers, Collectivity and Reciprocals(abstract)
The Informal Language of Mathematics(abstract)
Compositionality(abstract)
Representation and Inference for Natural Languages: A First Course in Computational Semantics (abstract)
Grammar Development in Constraint-Based Grammar Formalisms (abstract)
Statistical Methods in Computational Linguistics (abstract)
Information Extraction (abstract)
Deductive Approaches to Constraint-Based Parsing and Generation (abstract)
Geometry of Language (abstract)
Application-Oriented Grammar Writing (abstract)
Natural Language Generation (abstract)
Terminological Reasoning (abstract)
Extended Logic Programming and Knowledge Representation (abstract)
Recursion Theory and Concurrency Models (abstract)
Logic and Computation with Finite Structures (abstract)
Nonmonotonic Reasoning : Computational Perspectives (abstract)
Domain Theory and Applications (abstract)
Generalized Quantifiers and Computation (abstract)
Logical Approaches to Agent Modelling (abstract)
Evening Lectures
All the evening lectures will take place in the Amphi GUYON, at 8 p.m.
Summary :
In his well-known 1936 paper on the notion of logical consequence, Tarski left unsettled (and perhaps unsettleable) the exact division between logical and non-logical notions of a formal language. But then in a lecture thirty years later (published only in 1986 as a posthumous paper), Tarski proposed an explication of what constitutes a logical notion applying to objects in a type hierarchy over any given domain M, as being one which is invariant under arbitrary permutations of M. This notion has been characterized by Vann McGee in a recent paper in the J. Philosophical Logic, in terms of very strong infinitary languages. Though Tarski's proposal is simple and has an immediate intuitive appeal, and has been influential in abstract model theory and logical linguistics, I am deeply dissatisfied with it, especially as a result of McGee's characterization. In my talk I will explain the reasons for my dissatisfaction, and suggest alternative approaches to the main question which remain to be explored.
This lecture is the first yearly SPINOZA lecture of ESSLLI. It has been made possible by the prize awarded to Johan van Benthem by the Dutch Research Council. More information about the SPINOZA project can be obtained from the 1997 yearbook of the assocation.
Summary :
In a much-quoted and discussed position paper, "What's Wrong with Non-monotonic Logic", circa 1980, David Israel gave a pungent critique of non-monotonic logic. In this talk, I will re-examine his arguments to see how well they apply to some of today's versions.