Skip to content
DraconiticResearch
Search Sources API
194,161 studies31 sourcesUpdated 10 min ago
PreprintarXiv licencearXiv

The δ-calculus: from distinction to arithmetic

Abstract

Let δ denote the primitive act of distinction, formally realized as the one-step extension r↦ Sr of a finite record. We prove that the δ-orbit is initial among δ-algebras: every δ-algebra admits a unique structure-preserving map from the orbit. The map is injective when the successor operation is injective and the base point is not a successor. If the δ-algebra also satisfies induction for all predicates, the map is bijective and gives the unique isomorphism with the generated δ-orbit. The δ-calculus is an intuitionistic first-order proof system over the signature {0,S,+,·}. Each derivation carries a ledger recording the use of the law of excluded middle, the limited principle of omniscience, Markov's principle, and induction on quantified formulas. Every closed formula derivable in the forced fragment is true in the standard model. Starting from δ, we construct the choice-free number tower δleadsto ℕδ↪ ℤδ↪ ℚδ. The metatheoretic systems ℕ, ℤ, and ℚ each admit an explicit injection into ℕδ. Under the law of excluded middle, every recognizer is either injective or has kernel congruence ≡i,p for a unique pair i≥0, p≥1. In the noninjective case, the quotient is a finite monogenic monoid M(i,p). A decidable congruence together with an explicit pair of distinct related elements implies the classification without additional nonconstructive principles. For a decidable congruence different from equality, Markov's principle is needed. For an arbitrary congruence, the dichotomy requires the law of excluded middle. The reverse implications show that the last two prices are exact. They are distinct from the syntactic ledger of derivations in the δ-calculus.

Related

  1. The modulo distinction problem for D*
    Junyan Liu, Hengfei Lu
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. Generic distinction of induced representations: the case of symmetric spaces
    Pierre-Henri Chaudouard, Cheng Chen
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. Tempered Symplectic Distinction For Quaternionic GLn(D): A Conjecture of PRASAD
    Mahendra Kumar Verma
    arXivPreprintCC0Full textAlgebra & number theoryarXiv
  4. On the geometrical and dynamical distinction between Unimodular and General Relativistic wormholes
    Marco Bosquez, Erick Pastén, Mauricio Cataldo +1
    arXivPreprintCC BY 4.0Full textMathematical physicsGravitation & general relativityarXiv
  5. Differential calculus over double Lie algebroids
    Sophie Chemla
    Journal of Noncommutative GeometryPeer-reviewedLicence not statedMathematical physicsHAL
BibTeX
@misc{washburn2026δcalculus,
  title = {{The $δ$-calculus: from distinction to arithmetic}},
  author = {Jonathan Washburn and Milan Zlatanović},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2607.29349},
  eprint = {2607.29349},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2607.29349},
}
RIS
TY  - UNPB
TI  - The δ-calculus: from distinction to arithmetic
AU  - Jonathan Washburn
AU  - Milan Zlatanović
PY  - 2026
DA  - 2026/09/02
PB  - arXiv
DO  - 10.48550/arxiv.2607.29349
UR  - https://arxiv.org/abs/2607.29349
AB  - Let δ denote the primitive act of distinction, formally realized as the one-step extension r↦ Sr of a finite record. We prove that the δ-orbit is initial among δ-algebras: every δ-algebra admits a unique structure-preserving map from the orbit. The map is injective when the successor operation is injective and the base point is not a successor. If the δ-algebra also satisfies induction for all predicates, the map is bijective and gives the unique isomorphism with the generated δ-orbit. The δ-calculus is an intuitionistic first-order proof system over the signature {0,S,+,·}. Each derivation carries a ledger recording the use of the law of excluded middle, the limited principle of omniscience, Markov's principle, and induction on quantified formulas. Every closed formula derivable in the forced fragment is true in the standard model. Starting from δ, we construct the choice-free number tower δleadsto ℕ_δ↪ ℤ_δ↪ ℚ_δ. The metatheoretic systems ℕ, ℤ, and ℚ each admit an explicit injection into ℕ_δ. Under the law of excluded middle, every recognizer is either injective or has kernel congruence ≡_i,p for a unique pair i≥0, p≥1. In the noninjective case, the quotient is a finite monogenic monoid M(i,p). A decidable congruence together with an explicit pair of distinct related elements implies the classification without additional nonconstructive principles. For a decidable congruence different from equality, Markov's principle is needed. For an arbitrary congruence, the dichotomy requires the law of excluded middle. The reverse implications show that the last two prices are exact. They are distinct from the syntactic ledger of derivations in the δ-calculus.
ER  -