The 2017 Nordic Logic Summer School course on Natural Logic

The course studied logical systems which are relevant to natural language semantics and also logical systems which try to use surface forms directly. That is, it presented logical systems for natural language inference which are closer to actual language than to standard logical languages like first-order logic. I have taught this material to audiences closer to linguistics, and also to beginning logic students, and I'm excited now to teach it at the NLS.

Even if you are not interested in the overall topic of the course, it will introduce several topics that you might want to see: syllogistic logic, especially completeness theorems for various fragments; algebraic logic; decidable fragments of first-order logic; categorial grammar; the typed lambda calculus.

More specifically, the course is divided into a number of units. Some of these are independent after the first day.

Introduction: a list of test problems for natural logic, a summary of the results that we'll see in the course, and general history of the area. I also will present some background on decidable fragments of first-order logic.

Syllogistic proof systems: I'll summarize what is known about complete logical systems which can be called 'syllogistic' in the sense that they do not use variables or other devices besides the surface forms. It might be surprising that one can do any sort of linguistic reasoning this way. I will try to present a fair number of the completeness proofs themselves in this part of the course.

Logics with relations: Moving on to logics with verbs and relative clauses brings a set of extra problems and opportunities.

Logic beyond the Aristotle boundary: I will only teach this part if there's time. It presents natural deduction-style systems which can handle interesting linguistic phenomena and at the same time remain decidable.

The third day will focus on reasoning about the sizes of sets. This work concerns constructions like there are more books than magazines on the table. They are not expressible in first-order logic, yet their logic is decidable even when added to the other phenomena in this class. The last two days are devoted to

Monotonicity and Polarity: The best-known work in the area of natural logic is based on the monotonicity calculus first identified and studied by Johan van Benthem. This part of the course will present much of what has been done in the area As part of the course, I'll present the needed background on categorial grammars and polarity phenomena in language.

Lecture slides

My first lecture was an introduction to the topic as a whole. Also on Monday, I discussed the simplest logic in the world, the logic of sentences All x are y.

On Tuesday and Wednesday, I extended this to add verbs, relative clauses, negation, and existential assertions.

And here's Thursday's lecture on something on All p are q and Some p are q .

Here is the last day's lecture, featuring a bit on relational syllogistic logic, a bit on reasoning about cardinality, and a brisk discussion of the monotonicity calculus.

Homework

Here is the homework set for Monday after the first class.

Here are the answers to that first homework set.

Here is the homework set for Tuesday.

Here is the homework set for Wednesday.

The homework set for Thursday is a good preliminary set on preorders, containing facts used in Friday's lecture.

If anyone wants to ask me about our homework at any point, please feel free: lsm@cs.indiana.edu.

More homework is coming.

Resources

Johan van Benthem, A Brief History of Natural Logic.

For the first lecture, here is some text.

LM,Completeness Theorems for Syllogistic Fragments.

Many of the results in the second lecture may be found in Logics for the Relational Syllogistic by Ian Pratt-Hartmann and LM. I also have some text material that I can send out if you are interested.

For our last unit (monotonicity), here is Thomas Icard and LM, Recent Progress on Monotonicity.