Strong completeness for CTL

Speaker(s)

Kordula Świętorzecka

Affiliation

UKSW

Language of the talk

English

Date

Nov. 21, 2025, 12:15 p.m.

Room

room 5450

Title in Polish

Silne twierdzenie o pełności dla CTL

Seminar

Seminar Semantics, Logic, Verification and its Applications

---

We will discuss the history of the development of Prior’s temporal logics, which are now used in computer science. Our main focus will be the branching-time logic CTL. We will examine issues related to completeness theorems for these logics – in particular, the lack of semantic compactness and the use of omega-rules in their proof systems. Our goal will be to prove a strong completeness theorem for CTL.

The first part of the talk will be presented by Kordula Świętorzecka, and the second part by Konrad Zdanowski.

---