- University of Gothenburg
- The Faculty of Arts
- Department of Philosophy, Linguistics and Theory of Science
- Research
- Seminars
- The Logic Seminar

To content
Read more abput how we use cookies on gu.se
# The Logic Seminar

## Schedule for Spring 2017

### Algebraic Set Theory for NF and some of its variants

### Intuitionistic Ramified Type Theory

### Compositional vs Game-Theoretic Semantics for the Alternating-Time Temporal Logic ATL

### Indefiniteness, definiteness and semi-intuitionistic theories of sets

## Mailing list

The logic seminar takes place on alternate Fridays between 10:15 and 12:00 at Olof Wijksgatan 6 in room T307.

**27th January**: Paul Gorbow (FLoV, Gothenburg)

**Abstract: **NFU is a set theory (with atoms) which allows unbounded comprehension in a restricted form. In particular, there is a universal set V, and each natural number n is implemented as the set of all sets with n elements. It can be axiomatized as stratified comprehension extensionality infinity. Any model of ZF that admits a non-trivial automorphism, may be turned into a model of NFU, by a simple reinterpretation of membership. NF is the strengthening of NFU, which does not allow for atoms. INF(U) is intuitionistic NF(U).

In this presentation, I give theories in the language of categories equiconsistent to each of (I)NF(U). The idea is to start from the axioms of a Heyting/Boolean category, which mirror a large chunk of the finite axiomatization of (I)NF(U). We add to this a predicate distinguishing the type-level morphisms, characterized by certain axioms, e.g. expressing that the type-level morphisms form a subcategory. This allows us to add a form of the axiom of power objects (familiar from topos theory) that is restricted to the type-level morphisms. The relationship between the subcategory of type-level morphisms and the full category, corresponds to the relationship between (I)NF(U) and its class theory (I)ML(U). As a corollary to the equiconsistency result, we obtain a simple proof of Con(NF) iff Con(NFU |V| = |P(V)|). Moreover, the subcategory of type-level morphisms has a natural subcategory of so called strongly Cantorian objects, which is a topos.

**10 February: **no seminar

**24 February: **Erik Palmgren (Stockholm)

**Abstract:** In this talk we examine the natural interpretation of a ramified type hierarchy into Martin-Löf type theory with an infinite sequence of universes. It is shown that under this interpretation some useful special cases of Russell’s reducibility axiom are valid. This is enough to make the type hierarchy usable for development of constructive mathematics. We present a ramified type theory IRTT suitable for this purpose. IRTT allows for all the basic set-theoretic constructions.

**10 March:** Valentin Goranko (Stockholm)

**Abstract**: In this talk I will first introduce multi-agent concurrent game models and the Alternating-time temporal logic ATL as the currently most popular logical system for formalizing reasoning about strategic abilities in multi-agent systems. Then, I will present the compositional semantics of ATL, will illustrate it with some examples and will discuss briefly the main logical decision problems for ATL. Next, I will present a recently developed game-theoretic semantics for ATL and will compare several versions of it: unbounded, ordinal-bounded and finitely bounded. The first two versions will be shown to be equivalent to the compositional semantics, whereas the last one is not. I will end with some open questions and brief concluding remarks.

**24 March:*** *Michael Rathjen (Leeds, UK)

**Abstract**: Brouwer argued that limitation to constructive reasoning is required when dealing with "unfinished" totalities. As a complement to that, the predicativists such as Poincaré and Weyl (of Das Kontinuum) accepted the natural numbers as a "finished" or definite totality, but nothing beyond that. In addition, the "semi-intuitionistic" school of descriptive set theory (DST) of Borel et al. in the 1920s took both the natural numbers and the real numbers as definite totalities and explored what could be obtained on that basis alone.

From a metamathematical point of view, these and other different levels of indefiniteness/definiteness can be treated in the single framework of semi-intuitionistic theories of sets, whose basic logic is intuitionistic, but for which the law of excluded middle is accepted for bounded formulas.

**7 April: **Fredrik Engström (FLoV, Gothenburg)

**21 April:**

**5 May:** Stergios Chatzikyriakidis (FloV, Gothenburg)

**19 May:** Peter Dybjer (CSE, Chalmers): TBC

**2 June:
**

**16 June:**

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