Searcharxiv⌕ Search

arXiv · 2611.19552

Determinateness in a classical theory of nonclassical truth

Abstract

Recent theories that take determinateness as primitive are either nonclassical theories of nonclassical truth, like Field's INT, or classical theories of classical truth, like Fujimoto and Halbach's CD and CD^+. This paper develops a third option: a classical theory of nonclassical truth. The theory, KFDcs, extends the Kripke-Feferman theory KFcs with a primitive determinateness predicate. Unlike CD^+, KFDcs keeps the iteration of truth unrestricted and gives up its completeness. With or without a consistency axiom, KFD is proof-theoretically equivalent to the theory \widehat{ID}_2 of twice iterated fixed points, with ordinal φ(φ({\varepsilon}_0, 0)0), thus stronger than CD^+. It is also shown that replacing full induction with internal induction yields ordinal φ(φ(ω, 0)0), and restricting internal induction to total formulae yields φ({\varepsilon_0},0), the ordinal of KF.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luca Castaldo. 2026-11-14. Determinateness in a classical theory of nonclassical truth. https://searcharxiv.com/abs/2611.19552

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↗