Searcharxiv⌕ Search

arXiv · 2611.17165

Solovay's Construction via Proof Search

Abstract

Solovay's celebrated result establishes the arithmetical completeness of GL by embedding Kripke models into arithmetic. We provide an alternative proof of the arithmetical completeness of GL, in which we instead embed failed proof searches into arithmetic. Our methodology requires only a well-behaved sequent calculus and does not rely on completeness with respect to Kripke semantics or any of its variants. This approach is particularly interesting for logics that do not behave well semantically, such as ER, for which we also provide a new proof of arithmetical completeness.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Justus Becker, Borja Sierra Miranda. 2026-11-12. Solovay's Construction via Proof Search. https://searcharxiv.com/abs/2611.17165

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↗