Automorphism Groups of Non-Standard Peano Models Encode Turing Jumps — E8 Intelligence Research

FINDING: Non-standard models of Peano arithmetic exist, and their automorphism groups encode the Turing-jump of their theories, linking logical complexity to symmetry. MATH: Peano axioms (PA) define natural numbers via zero, successor, induction. Non-standard models contain infinite elements beyond standard ℕ. Theorem: For countable arithmetically saturated M,N ⊧ PA, if Aut(M) ≅ Aut(N) then Th(M)′ ≡_T Th(N)′ (Turing equivalence of jumps). CONNECTION: Automorphism groups of these models are highly symmetric, but the symmetry structure is not geometric (no ratios like 0.618, 1.618). Instead, symmetry is logical: automorphisms preserve arithmetic truth up to Turing degree. No base-60, crystallographic, or root system link. DEPTH: 6 — Profound for foundations of mathematics and computability, but no direct geometric or harmonic resonance. The finding ties symmetry to computational complexity, not to physical or geometric constants. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-07-23
DOI
https://doi.org/10.5281/zenodo.21503622
Primary Topic
Computability, Logic, AI Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Automorphism Groups of Non-Standard Peano Models Encode Turing Jumps — E8 Intelligence Research

Andrew Stewart Caldin
Zenodo (CERN European Organization for Nuclear Research)
Computability, Logic, AI Algorithms
preprint

Automorphism Groups of Non-Standard Peano Models Encode Turing Jumps — E8 Intelligence Research

Andrew Stewart Caldin
preprint en

Abstract

FINDING: Non-standard models of Peano arithmetic exist, and their automorphism groups encode the Turing-jump of their theories, linking logical complexity to symmetry. MATH: Peano axioms (PA) define natural numbers via zero, successor, induction. Non-standard models contain infinite elements beyond standard ℕ. Theorem: For countable arithmetically saturated M,N ⊧ PA, if Aut(M) ≅ Aut(N) then Th(M)′ ≡_T Th(N)′ (Turing equivalence of jumps). CONNECTION: Automorphism groups of these models are highly symmetric, but the symmetry structure is not geometric (no ratios like 0.618, 1.618). Instead, symmetry is logical: automorphisms preserve arithmetic truth up to Turing degree. No base-60, crystallographic, or root system link. DEPTH: 6 — Profound for foundations of mathematics and computability, but no direct geometric or harmonic resonance. The finding ties symmetry to computational complexity, not to physical or geometric constants. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Zenodo (CERN European Organization for Nuclear Research)
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.