Bas's number

Bas's number Defined by Bas, November 20, 2026. Setup. Let L₀ be first-order set theory. For each k, let L_{k+1} be L_k extended with a truth predicate for L_k. Let R_k(n) be the smallest number greater than every number definable by a formula of L_k with at most n symbols (so R₀(10^100) is Rayo's number). Diagonal. B(n) = R_n(n): the language level and the symbol budget are both n. Feedback. a₀ = R₀(10^100), and a_{k+1} = B(a_k). Bas's number = a_N, where N = a₀ (Rayo's number). Each number in the sequence picks both the language level and the symbol budget for the next step, so every step uses a strictly stronger language than the one before. Challenge. Define a number larger than Bas's number in at most 200 characters. You may use any formal system, but you must state it explicitly, and the number must be well-defined. Trivial modifications of Bas's number (+1, ×2, a_{N+1}, and so on) don't count.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24407305
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Bas's number

Bastiaan Cornelius Eugenius Maria Akkerman
3 links
Zenodo (CERN European Organization for Nuclear Research)
Computability, Logic, AI Algorithms
article

Bas's number

Bastiaan Cornelius Eugenius Maria Akkerman
article en

Abstract

Bas's number Defined by Bas, November 20, 2026. Setup. Let L₀ be first-order set theory. For each k, let L_{k+1} be L_k extended with a truth predicate for L_k. Let R_k(n) be the smallest number greater than every number definable by a formula of L_k with at most n symbols (so R₀(10^100) is Rayo's number). Diagonal. B(n) = R_n(n): the language level and the symbol budget are both n. Feedback. a₀ = R₀(10^100), and a_{k+1} = B(a_k). Bas's number = a_N, where N = a₀ (Rayo's number). Each number in the sequence picks both the language level and the symbol budget for the next step, so every step uses a strictly stronger language than the one before. Challenge. Define a number larger than Bas's number in at most 200 characters. You may use any formal system, but you must state it explicitly, and the number must be well-defined. Trivial modifications of Bas's number (+1, ×2, a_{N+1}, and so on) don't count.

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.

Laika access coming soon