From Numbers to Container Strings
Pith reviewed 2026-05-23 08:33 UTC · model grok-4.3
The pith
Markov coding of binary strings supplies an alternative proof that PA^- is sequential.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The paper establishes that the Markov representation of binary strings in the special linear monoid of the non-negative part of discretely ordered commutative rings creates ur-strings satisfying the properties required for sequence coding, thereby giving an alternative proof that PA^- is sequential.
What carries the argument
Markov coding, the representation of binary strings inside the special linear monoid of non-negative elements from discretely ordered commutative rings to form ur-strings.
If this is right
- PA^- admits sequence coding through the Markov-based ur-strings.
- The conditions under which Smullyan coding and Markov coding succeed are identified by direct comparison.
- The beta-function approach is set aside in favor of the string constructions for the main sequentiality result.
- String theories supply the data-type objects needed to code sequences inside number theories.
Where Pith is reading between the lines
- The same ring representation might be tested in other weak arithmetical theories to obtain sequentiality proofs.
- Algebraic embeddings of strings could link sequence coding to properties of ordered rings beyond the cases studied here.
- Direct comparison of Smullyan coding inside PA^- would clarify whether the Markov route is necessary or merely sufficient.
Load-bearing premise
The Markov representation of binary strings in the special linear monoid of the non-negative part of discretely ordered commutative rings succeeds in creating ur-strings that satisfy the required properties for sequence coding in the target arithmetical theories.
What would settle it
A concrete model of a discretely ordered commutative ring in which the Markov-defined ur-strings fail to preserve unique ordering or component extraction would show the construction does not work for PA^-.
read the original abstract
In this paper we examine two ways of coding sequences in arithmetical theories. We investigate under what conditions they work. To be more precise, we study the creation of objects of a data-type that we call ur-strings, roughly sequences where the components are ordered but where we do not have an explicitly given projection function. First, we have a brief look at the beta-function which was already carefully studied by Emil Je\v{r}\'abek. We study in detail our two target constructions. These constructions both employ theories of strings. The first is based on Smullyan coding and the second on the representation of binary strings in the special linear monoid of the non-negative part of discretely ordered commutative rings as introduced by Markov. We use the Markov coding to obtain an alternative proof that ${\sf PA}^{-}$ is sequential.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript examines codings of sequences (ur-strings: ordered sequences without explicit projection) in arithmetical theories. It reviews the beta-function (following Jeřábek), then details two string-based constructions: Smullyan coding and Markov's representation of binary strings inside the special linear monoid over the non-negative part of a discretely ordered commutative ring. The central claim is that the Markov construction supplies an alternative proof that PA^- is sequential.
Significance. If the Markov coding is shown to establish the required ur-string properties (concatenation, length, etc.) inside PA^- itself, the result would supply a useful alternative route to sequentiality for this weak theory, complementing Jeřábek's beta-function analysis and clarifying the boundary between what can be coded without induction.
major comments (2)
- [Markov coding construction (the section detailing the special linear monoid representation and its use for PA^-)] The central claim (alternative proof that PA^- is sequential via Markov coding) is load-bearing for the paper. The manuscript must demonstrate explicitly that the existence of concatenations, length functions, and the monoid decomposition into binary digits are all provable in PA^- without induction on string length or matrix size; standard arguments for these facts use induction, which is unavailable in PA^-.
- [Proof that PA^- is sequential (the section containing the alternative proof)] It is unclear whether the verification that the Markov ur-strings satisfy the sequentiality axioms for PA^- is carried out inside PA^- or only in a stronger metatheory. The paper should isolate the precise fragment of arithmetic needed for each step of the Markov construction.
minor comments (2)
- [Introduction to Markov coding] Notation for the special linear monoid and the non-negative part of the ring should be introduced with explicit definitions before first use.
- [Overview of the two target constructions] The relationship between the Smullyan construction and the Markov construction could be summarized in a short comparative table for clarity.
Simulated Author's Rebuttal
We thank the referee for the careful and constructive report. The two major comments correctly identify places where the manuscript would benefit from greater explicitness about the formalization in PA^-. We address each point below and will revise accordingly.
read point-by-point responses
-
Referee: [Markov coding construction (the section detailing the special linear monoid representation and its use for PA^-)] The central claim (alternative proof that PA^- is sequential via Markov coding) is load-bearing for the paper. The manuscript must demonstrate explicitly that the existence of concatenations, length functions, and the monoid decomposition into binary digits are all provable in PA^- without induction on string length or matrix size; standard arguments for these facts use induction, which is unavailable in PA^-.
Authors: We agree that the current text gives only a high-level outline of the Markov construction and does not supply line-by-line verifications inside PA^-. In the revision we will add a dedicated subsection that derives the required ur-string operations (concatenation, length, and binary decomposition) directly from the axioms of discretely ordered commutative rings and the definition of the special linear monoid. Because these operations are given by explicit matrix multiplication and entry-wise arithmetic, the proofs rely only on the quantifier-free ring axioms and the discreteness axiom; no induction on string length or matrix dimension is invoked. revision: yes
-
Referee: [Proof that PA^- is sequential (the section containing the alternative proof)] It is unclear whether the verification that the Markov ur-strings satisfy the sequentiality axioms for PA^- is carried out inside PA^- or only in a stronger metatheory. The paper should isolate the precise fragment of arithmetic needed for each step of the Markov construction.
Authors: The verification is intended to be formalizable in PA^-. In the revised manuscript we will annotate each step of the construction with the minimal fragment required (essentially the axioms of ordered commutative rings plus the definition of SL_2). We will also include a short table or paragraph that lists, for each property, the exact axioms used, thereby making clear that no induction schema is needed. revision: yes
Circularity Check
No circularity: alternative proof relies on independent prior constructions
full rationale
The paper's central claim is an alternative proof of sequentiality for PA^- via Markov coding of ur-strings in the special linear monoid over discretely ordered rings. This construction is drawn from prior independent work by Markov (and beta-function analysis from Jeřábek), with the paper examining conditions under which the coding yields the required sequence properties inside the target theory. No quoted step reduces a prediction or uniqueness claim to a self-fit, self-citation chain, or definitional renaming; the derivation is presented as importing an external representation rather than deriving the target result from its own fitted parameters or assumptions. The absence of load-bearing self-citations or ansatz smuggling keeps the argument self-contained against external benchmarks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.