"Next" and "until" in relevant temporal logic
- LecturerProf. Igor Sedlár (Institute of Computer Science and the Institute of Philosophy, The Czech Academy of Sciences in Prague)
Host: Churn-Jung Liau - Time2026-11-19 (Thu.) 14:00 ~ 15:15
- LocationAuditorium 106 at IIS new Building
Abstract
Linear temporal logic (LTL) is the most widely used modal logic in computer science. I review existing work on non-classical versions of LTL and I present a completeness proof for a henceforth-free fragment of relevant LTL based on non-deterministic frames (which turns out to be equivalent to the existential fragment of relevant Computation tree logic, CTL.)