Searcharxiv⌕ Search

arXiv · 2611.14552

Piecewise Interpretations in Many-Sorted Logic

Abstract

Piecewise interpretations, introduced by Visser, generalize ordinary interpretations between first-order theories by allowing formulae to be interpreted using disjoint unions of definable sets. This makes it possible to capture natural constructions, such as the projective completion of an affine plane, but also leads to a notion of equivalence of theories, namely piecewise bi-interpretability. We develop the theory of piecewise interpretations systematically in the many-sorted setting. Each piecewise interpretation induces a semantic dual, a functor between categories of models. In addition, we introduce a syntactic notion of morphism between piecewise interpretations, which likewise has a semantic dual. Using these semantic duals, we collect theories, piecewise interpretations, and morphisms between them into a bicategory, in particular defining a well-behaved notion of composition of interpretations, associative up to coherent isomorphism. As an application, we consider a familiar idea, championed by Quine, namely that one can replace any many-sorted theory with a corresponding single-sorted one by replacing sorts with sortal predicates. We show that this leads to a biequivalence between the developed bicategories of theories with finitely many sorts and single-sorted theories, thereby providing an argument for the dispensability of sorts.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benjamin Zayton. 2026-11-02. Piecewise Interpretations in Many-Sorted Logic. https://searcharxiv.com/abs/2611.14552

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗