Skip to main navigation Skip to search Skip to main content

The Nonexistence of Unicorns and Many-Sorted Löwenheim–Skolem Theorems

  • Benjamin Przybocki
  • , Guilherme Toledo
  • , Yoni Zohar
  • , Clark Barrett

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Stable infiniteness, strong finite witnessability, and smoothness are model-theoretic properties relevant to theory combination in satisfiability modulo theories. Theories that are strongly finitely witnessable and smooth are called strongly polite and can be effectively combined with other theories. Toledo, Zohar, and Barrett conjectured that stably infinite and strongly finitely witnessable theories are smooth and therefore strongly polite. They called counterexamples to this conjecture unicorn theories, as their existence seemed unlikely. We prove that, indeed, unicorns do not exist. We also prove versions of the Löwenheim–Skolem theorem and the Łoś–Vaught test for many-sorted logic.

Original languageEnglish
Title of host publicationFormal Methods - 26th International Symposium, FM 2024, Proceedings
EditorsAndré Platzer, Kristin Yvonne Rozier, Matteo Pradella, Matteo Rossi
PublisherSpringer Science and Business Media Deutschland GmbH
Pages658-675
Number of pages18
ISBN (Print)9783031711619
DOIs
StatePublished - 2025
Event26th International Symposium on Formal Methods, FM 2024 - Milan, Italy
Duration: 9 Sep 2024 → 13 Sep 2024

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14933 LNCS

Conference

Conference26th International Symposium on Formal Methods, FM 2024
Country/TerritoryItaly
CityMilan
Period9/09/24 → 13/09/24

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'The Nonexistence of Unicorns and Many-Sorted Löwenheim–Skolem Theorems'. Together they form a unique fingerprint.

Cite this