Cover Image

The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Przybocki, Benjamin, Toledo, Guilherme, Zohar, Yoni, Barrett, Clark
Format:	Preprint
Published:	2024
Subjects:	Logic Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Shininess, strong politeness, and unicorns
by: Przybocki, Benjamin, et al.
Published: (2025)

Characterizing Sets of Theories That Can Be Disjointly Combined
by: Przybocki, Benjamin, et al.
Published: (2025)

Bringing closure to theory combination properties
by: Toledo, Guilherme V., et al.
Published: (2026)

Being polite is not enough (and other limits of theory combination)
by: Toledo, Guilherme V., et al.
Published: (2025)

Number theory combination: natural density and SMT
by: Toledo, Guilherme V., et al.
Published: (2025)

Combining Combination Properties: Minimal Models
by: de Toledo, Guilherme Vicentin, et al.
Published: (2024)

The termination of Nielsen transformations applied to word equations with length constraints
by: Przybocki, Benjamin, et al.
Published: (2025)

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

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

Upward Löwenheim-Skolem-Tarski Numbers for Abstract Logics
by: Gitman, Victoria, et al.
Published: (2024)

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

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)

Near-Optimal Encodings of Cardinality Constraints
by: Krapivin, Andrew, et al.
Published: (2026)

Operational semantics and program verification using many-sorted hybrid modal logic
by: Leustean, Ioana, et al.
Published: (2019)

Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics
by: Gamsakhurdia, Mariami, et al.
Published: (2025)

Automated Reencoding Meets Graph Theory
by: Przybocki, Benjamin, et al.
Published: (2026)

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

On the downward Löwenheim-Skolem Theorem for elementary submodels
by: Kunik, Matthias
Published: (2024)

A characterization of the $n$-ary many-sorted closure operators and a many-sorted Tarski irredundant basis theorem
by: Vidal, Juan Climent, et al.
Published: (2017)

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

Incompleteness theorems via Turing category
by: Savelyev, Yasha
Published: (2024)

A Cobham theorem for scalar multiplication
by: Hieronymi, Philipp, et al.
Published: (2024)

Generalized Optimization Modulo Theories
by: Tsiskaridze, Nestan, et al.
Published: (2024)

Satisfiability Modulo Extensional Constant Arrays (Extended Version)
by: Preiner, Mathias, et al.
Published: (2026)

Cubing for Tuning
by: Wu, Haoze, et al.
Published: (2025)

An abstract fixed-point theorem for Horn formula equations
by: Hetzl, Stefan, et al.
Published: (2025)

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

Ajtai's theorem for $T^2_2(R)$ and pebble games with backtracking
by: Ken, Eitetsu, et al.
Published: (2024)

Verifying SQL Queries using Theories of Tables and Relations
by: Mohamed, Mudathir, et al.
Published: (2024)

Automating Bitvector and Finite Field Equivalence Proofs in Lean
by: Pertseva, Elizaveta, et al.
Published: (2026)

Lean-auto: An Interface between Lean 4 and Automated Theorem Provers
by: Qian, Yicheng, et al.
Published: (2025)

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

Solving Set Constraints with Comprehensions and Bounded Quantifiers
by: Mohamed, Mudathir, et al.
Published: (2025)

Towards solid abelian groups: A formal proof of Nöbeling's theorem
by: Asgeirsson, Dagur
Published: (2023)

Towards SMT Solver Stability via Input Normalization
by: Amrollahi, Daneshvar, et al.
Published: (2024)

Relational Hoare Logic for Realistically Modelled Machine Code
by: Mazzucato, Denis, et al.
Published: (2025)

Integer Reasoning Modulo Different Constants in SMT
by: Pertseva, Elizaveta, et al.
Published: (2025)

Definable sets in Skolem arithmetic
by: Kamiński, Łukasz
Published: (2025)

Lean-SMT: An SMT tactic for discharging proof goals in Lean
by: Mohamed, Abdalrhman, et al.
Published: (2025)