From the 1 of 3 linked papers with an AI index.
3 papers
cs.LO2026
Schemata, Cyclic Proofs and Herbrand Systems
Alexander Leitsch, Anela Lolic, Stella Mahler
The paper introduces proof schemata based on point transition systems, shows how to compute Herbrand systems for skolemized schemata without quantified cuts, relates these schemata…
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
Towards an Analysis of Proofs in Arithmetic
Alexander Leitsch, Anela LoliÄ, Stella Mahler
Inductive proofs can be represented as proof schemata, i.e. as parameterized sequences of proofs defined in a primitive recursive way. Applications of proof schemata can be found i…