Cover Image

Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gamsakhurdia, Mariami, Baaz, Matthias, Lolic, Anela
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Goedel Logics: On the Elimination of The Absoluteness Operator
by: Baaz, Matthias, et al.
Published: (2026)

Goedel logics: Prenex fragments
by: Baaz, Matthias, et al.
Published: (2024)

Skolemization In Intermediate Logics
by: Baaz, Matthias, et al.
Published: (2025)

Epsilon Calculus Provides Shorter Cut-Free Proofs
by: Baaz, Matthias, et al.
Published: (2024)

Towards an Analysis of Proofs in Arithmetic
by: Leitsch, Alexander, et al.
Published: (2025)

Herbrand's Theorem in Refutation Schemata
by: Leitsch, Alexander, et al.
Published: (2024)

Decidability of Quantum Modal Logic
by: Tokuo, Kenji
Published: (2026)

Dynamic Probability Logic: Decidability & Computability
by: Chopoghloo, Somayeh, et al.
Published: (2024)

Decidability of Quasi-Dense Modal Logics
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)

The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems
by: Przybocki, Benjamin, et al.
Published: (2024)

An Approximate Skolem Function Counter
by: Shaw, Arijit, et al.
Published: (2023)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
by: Artale, Alessandro, et al.
Published: (2025)

Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization
by: Li, Yongming
Published: (2025)

Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions
by: Su, Wanyun, et al.
Published: (2024)

Deciding Predicate Logical Theories of Real-Valued Functions
by: Ratschan, Stefan
Published: (2023)

Decidability of Graph Neural Networks via Logical Characterizations
by: Benedikt, Michael, et al.
Published: (2024)

Skolem and Positivity Completeness of Ergodic Markov Chains
by: Vahanwala, Mihir
Published: (2023)

On Robustness for the Skolem, Positivity and Ultimate Positivity Problems
by: Akshay, S., et al.
Published: (2022)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

On the Complexity of the Skolem Problem at Low Orders
by: Bacik, Piotr, et al.
Published: (2025)

Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
by: Kurucz, Agi, et al.
Published: (2023)

Deciding Boolean Separation Logic via Small Models (Technical Report)
by: Dacík, Tomáš, et al.
Published: (2024)

Decidability for Sturmian words
by: Hieronymi, Philipp, et al.
Published: (2021)

The Skolem Problem in rings of positive characteristic
by: Dong, Ruiwen, et al.
Published: (2025)

Generalized Decidability via Brouwer Trees
by: de Jong, Tom, et al.
Published: (2026)

Deciding Equations in the Time Warp Algebra
by: van Gool, Sam, et al.
Published: (2023)

Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property
by: Elad, Neta, et al.
Published: (2026)

On the Subspace Orbit Problem and the Simultaneous Skolem Problem
by: Bacik, Piotr, et al.
Published: (2026)

Deciding subspace reachability problems with application to Skolem's Problem
by: Everett, Samuel
Published: (2024)

A Decidable Bundled Fragment of First-Order Modal Logic Without Finite Model Property
by: Joshi, Varad, et al.
Published: (2025)

The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
by: Pratt-Hartmann, Ian
Published: (2017)

Auto formalisation of Goedel's Second Incompleteness Theorem in Binary Recursive Arithmetic
by: Coquand, Thierry
Published: (2026)

Blurred Drinker Paradoxes and Blurred Choice Axioms: Constructive Reverse Mathematics of the Downward Löwenheim-Skolem Theorem
by: Kirst, Dominik, et al.
Published: (2026)

Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster
by: Lutz, Carsten, et al.
Published: (2024)

Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization
by: Chatterjee, Krishnendu, et al.
Published: (2024)

Measuring Decidability as Related to Busy Beaver Numbers
by: Tandi, Gurpreet, et al.
Published: (2026)

Towards Counting Markov Equivalence Classes with Logical Constraints
by: Bizzaro, Davide, et al.
Published: (2024)

Deciding Termination of Simple Randomized Loops
by: Meyer, Éléanore, et al.
Published: (2025)

On the Decidability of Monadic Theories of Arithmetic Predicates
by: Berthé, Valérie, et al.
Published: (2024)

On the Decidability of Presburger Arithmetic Expanded with Powers
by: Karimov, Toghrul, et al.
Published: (2024)