Logic at GU
Welcome to the webpage of the logic group at the University of Gothenburg. Information about our research and activities can be found through the links to the left. More detailed information is available through the personal pages of group members and our homepage at the University of Gothenburg.
Past talks can be found on the seminar page. Announcements of upcoming seminars and events are distributed via the seminar mailing list.
Anouk Oudshoorn (TU Wien) Reconciling SHACL and Ontologies
The World Wide Web Consortium (
Licentiate defence: Dominik Wehr (FLoV) Representation matters in cyclic proof theory
Public defence of Dominik Wehr’s Licentiate thesis.
Opponent Associate Professor Anupam Das, University of Birmingham
Examiner Docent Fredrik Engström, Göteborgs universitet
Rineke Verbrugge (University of Groningen) Combining probability and provability logic
It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in almost no models of that size. For modal logics, limit behavior for models and frames may differ. In 1994, Halpern and Kapron proved zero-one laws for classes of models corresponding to the modal logics K, T, S4, and S5. They also proposed zero-one laws for the corresponding classes of frames, but their zero-one law for K-frames has since been disproved, and so has more recently their zero-one law for S4-frames.
Rineke Verbrugge (University of Groningen) Aspects of provability and interpretability
In 1994, Rineke Verbrugge did a postdoc in Gothenburg, as a scientific guest of Professor Per Lindström, who was writing his landmark book Aspects of Incompleteness at the time. Even though the two of them did not co-author any papers that year, there was still significant mutual influence and there were very lively discussions in the weekly seminars of the logic group. In this research lecture, Rineke Verbrugge will present some of the questions and results around bounded arithmetic, provability and interpretability logic that she was working on that year, for example, a small reflection principle for bounded arithmetic and the lattice of feasible interpretability types.