3 papers
cs.LO2026
Goedel Logics: On the Elimination of The Absoluteness Operator
Matthias Baaz, Mariami Gamsakhurdia
We investigate the eliminability of the absoluteness operator Delta in Goedel logics. While Delta is not definable from the standard connectives and disrupts important proof-theore…
cs.LO2025
Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics
Mariami Gamsakhurdia, Matthias Baaz, Anela Lolic
In 1928, Bernays and Schoenfinkel proved the decidability of prenex sentences whose matrices contain no function symbols, now known as the Bernays-Schoenfinkel (BS) class. We inves…
cs.LO2025
Skolemization In Intermediate Logics
Matthias Baaz, Mariami Gamsakhurdia, Rosalie Iemhoff +1
Skolemization, with Herbrand's theorem, underpins automated theorem proving and various transformations in computer science and mathematics. Skolemization removes strong quantifier…