Special Session
Noetherian Gödel Logics
On-site
Noetherian Gödel logics are many-valued logics where the set of truth values is a closed subset of [0,1] without infinite ascending sequences. These logics are parametrized by countable ordinals, so that Gα↓ is the logic with truth values inversely isomorphic to α+1. In this talk we discuss the complexity of satisfiability and validity for each Noetherian Gödel logic, strengthening and generalizing results of Baaz-Leitsch-Zach and Hájek. Specifically, we show that the complexity of satisfiability and validity in Gα↓ are related to Σ11 and Π11 formulas, respectively, over (𝕃β)β≤α.
This is joint work with Juan P. Aguilera and Jan Bydzovsky.
This document was translated from LATEX by HEVEA.