Till startsida
To content Read more about how we use cookies on gu.se

The Logic Seminar 2017

The logic seminar takes place on alternate Thursdays between 13:15 and 15:00 at Olof Wijksgatan 6 in room T 307 (unless otherwises stated).

The archive of older seminars (starting 2005) is divided into two web pages: 2005-2013 Logic Seminars and 2014-2017.

Fall 2017 Logic Seminar Schedule

Tuesday 19 Sep: Bartosz Wcisło (Warsaw) NB. room T219

Propositional constructions in compositional truth theories

In our talk, we will describe a construction in propositional logic which proved very useful in the study of models of truth theories.

Many intuitive properties for the classical compositional theory of truth over Peano arithmetic called CT− fail because this theory does not enjoy the properties of disjunctive and conjunctive correctness. I.e., if M |= CT− is a model whose arithmetical part is nonstandard, we cannot typically expect that a disjunction of nonstandard length is true if and only if one of the disjuncts is true.

By a recent result of Pakhomov, compositional truth theory with the disjunctive correctness principle is in fact not conservative over Peano Arithmetic. However, in many applications we only in fact need a disjunctive correctness in a very specific circumstances, where we expect at most one disjunct to be true which is located at some standard syntactic depth of a given nonstandard disjunction. In such a case, the use of disjunctions may be replaced with another propositional construction invented by Smith (and preceded with a similar construction by Lachlan) which behaves in a controllable fashion already in CT−.

We show how this construction may be used to obtain a number of results on models of truth theories including more perspicuous proof of Lachlan’s Theorem on recursive saturation of models of CT−.

21 Sep: Mateusz Łełyk (Warsaw)

Compositional Truth Theories, Bounded Induction and Reflection Principles


One of the most important questions studied within the field of Axiomatic Truth Theories is to determine the arithmetical strength of various axioms for the truth predicate. In this talk we study three main types of such truth principles for the typed truth predicate: various kinds of compositionality, bounded induction and reflection principles, namely, we shall consider three basic compositional truth theories: CT-, in which the internal logic is classical, PT- and WPT-, in which the internal logic is modelled after the Strong and Weak Kleene Logic, respectively.

One of the surprising result explained in our talk is the theorem on multiple axiomatizations of CT- extended with a bounded induction (CT0): putting together the results of Cieśliński, Kotlarski, and myself we show that CT0 is deductively equivalent to extensions of CT- with various reflection principles.

Then we ask whether the above theorem is stable under weakening the compositional axioms: we investigate analogous extensions of PT- and WPT-. It turns out that adding bounded induction to PT- results in one more axiomatization of CT0, and the same is "almost true" for the Weak Kleene case. However differences between "completeness" and "closure" reflection principles become visible. We show that in general the former are much weaker then the latter.

5 Oct:

19 Oct:

2 Nov: Stergios Chatzikyriakidis (FLoV)

16 Nov: Albert Visser (Utrecht)

30 Nov: Øystein Linnebo (Oslo)

14 Dec: Peter Dybjer (Chalmers)

Mailing list

There is a mailing list used for spreading information about the logic seminar. Please use the above link to subscribe to it.


Page Manager: Monica Havström|Last update: 9/16/2017

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?