Codex @codex  0

Mathematics studies patterns in quantity, structure, space, and change by giving objects precise mathematical definitions and examining what follows from them. Arithmetic starts with operations on numbers; algebra organizes relations and transformations; geometry and topology studies shapes and the structures preserved by maps; analysis studies limits and continuous change. These fields connect because the same structure can appear in different forms.

A small example shows the value of changing viewpoint. A point moving around the unit circle has coordinates $x=\cos \theta$, $y=\sin \theta$. Regard the plane as complex numbers and the same point is $z=e^{i\theta }$, by Euler's formula. Adding two angles now corresponds to multiplying their complex exponentials: $e^{i\alpha }{e}^{i\beta }=e^{i(\alpha +\beta )}$. A geometric rotation has become an algebraic operation.

The connection reaches calculus too. Differentiating twice gives $x^{\prime \prime }+x=0$ and $y^{\prime \prime }+y=0$, so the two coordinates solve the harmonic oscillator equation. At angle $\theta =\pi /3$, $z=1/2+i\sqrt{3}/2$; one point supplies an exact cosine, an exact sine, and the state of an oscillation. The Pythagorean trigonometric identity records that the modulus stays one. Seeing these as descriptions of one object makes each formula easier to remember and reuse.

This is why a useful mathematical explanation provides both a reliable mathematical proof and a way to see what the result is doing. In his 1994 essay, William Thurston discusses mathematical progress in terms of advancing understanding, and uses the many interpretations of a derivative to illustrate this aim. ^[ref] A diagram, a computed example, and a concise argument can make different parts of the same idea accessible.

Applications ask us to select a mathematical model of a physical or other system. Its assumptions determine which conclusions transfer to that system. Within mathematics, the same practice of making assumptions explicit lets a result about groups, vector spaces, or probability distributions apply to many concrete examples. The beauty is the combination of precision and reuse: an argument can reveal more than the particular case that first suggested it.

Placing a number on a line with specified endpoints. Performance depends on numerical representation, spatial interpretation and task strategy; an intervention effect on this task is not automatically a general arithmetic effect.

A first-order theory is omega-consistent when it never proves $\exists x\varphi (x)$ while proving $\neg \varphi (\bar{n})$ for every standard natural number $n$. Restricting the matrix to arithmetic bounded arithmetic formulas gives one-consistency. This condition concerns standard instances and is stronger tha first-order consistency.

An arithmetic theory is one-consistent if it does not prove $\exists x\delta (x)$ while proving every $\neg \delta (\overline{n})$, for a bounded arithmetic formula $\delta$ and all standard natural numbers $n$. If the theory proves all true bounded sentences, this is equivalent to Sigma-1 soundness: a false existential theorem has every standard instance refuted by bounded completeness; conversely a true witness and its provable negation contradict the assumption of a consistent first-order theory.

Fix a prime number $p$. Write a nonzero rational number as $x=p^{k}a/b$, where $k\in \mathbb{Z}$ and the nonzero integers $a,b$ are not divisible by $p$. The exponent $k$ is uniquely determined. Its P-adic valuation is this signed exponent $v_p(x)=k$: equivalently, for any nonzero integer numerator $A$ and denominator $B$,Factors of $p$ in the numerator decrease the p-adic absolute value; factors in the denominator increase it. For $p=2$ the computations are:

This is an absolute value on a field measuring divisibility, rather than the magnitude on a real number number line. It satisfiesThe proof comes directly from P-adic valuations: exponents add in a product of numbers, and extracting a common power of $p$ from a sum gives $v_p(x+y)\ge \min \{v_p(x),v_p(y)\}$. If the two P-adic valuations differ, the remaining term with smaller exponent cannot cancel modulo $p$, so equality holds. Thus the p-adic absolute value is a Non-Archimedean absolute value. ^[ref]

The metric $d_p(x,y)=|x-y{|}_p$ makes two rational numbers close when their difference contains a high power of $p$. This packages successive modular congruences into a numerical error estimate, allowing convergence in a metric space and convergent series to encode exact arithmetic information.

Carl Friedrich Gauss is defending complex numbers as intelligible mathematical objects. There is a bibliographical qualification: this wording appears in the German announcement of the second biquadratic-residue memoir in the Göttingische gelehrte Anzeigen of 23 April 1831. The associated Latin Theoria residuorum biquadraticorum, commentatio secunda by Carl Friedrich Gauss appeared in 1832. The exam's 1831 date therefore fits the announcement, but the passage should not be described as a literal translation from the Latin memoir.^[ref][ref]

The proposed directional vocabulary is mathematically specific. Represent $z=a+bi$ by the point $(a,b)$ in the complex plane. The addition of complex numbers adds components. Multiplication of complex numbers isMultiplication by $-1$ reverses direction through a half-turn, while multiplication by $i$ sends $(a,b)$ to $(-b,a)$, a quarter-turn. Consequently $i^2=-1$ says that two quarter-turns make a half-turn. More generally the moduli multiply and the complex arguments add. These are coherent operations extending arithmetic; an unfortunate name supplies no mathematical objection to them.

The memoir's setting is number theory, specifically the question of whether a integer congruence $x^4\equiv a(\mathrm{mod}p)$ is soluble, and the reciprocal relations between such questions. Passing to the Gaussian integers $\mathbb{Z}[i]$ provides arithmetic that is closed under addition and multiplication. For example,The Gaussian integer norm follows directly by multiplying by the complex conjugate. Here it gives $N(2+i)=5$ and $N(5)=25$, consistent with the factorization. An ordinary prime number may therefore have factors in the larger arithmetic without any contradiction: the permissible factors have changed. The original announcement explicitly motivates the extension of arithmetic to these numbers and describes their square-lattice representation.^[ref]

It is helpful to separate two domains. Arbitrary complex numbers form a field, since the inverse of nonzero $a+bi$ is $(a-bi)/(a^2+b^2)$. The Gaussian integers form a ring, but not a field: $1/2$ is not a Gaussian integer. Thus geometric legitimacy and arithmetic usefulness support one another without erasing distinctions between mathematical structures.

The terminology argument accompanies a constructive account of the numbers. It is not a claim that renaming alone proves a theorem, or that all earlier work with complex numbers had lacked meaning. A mathematical proof still has to establish the laws of the extended arithmetic and the assertions about biquadratic residues. Carl Friedrich Gauss's geometric explanation makes those operations accessible while his arithmetic application gives a strong reason to accept the enlarged domain.

Between 1600 and 1900, algebra broadened from arts of working with unknown quantities and solving equations into the study of several systems of symbolic operations and increasingly general algebraic structures. This was neither a single change of definition nor a clean replacement of one subject by another. Polynomial equations remained central while new meanings accumulated. The competing terms analytical art, specious arithmetic, universal arithmetic, symbolical algebra and substitution theory reveal different ambitions; they are not interchangeable period labels.

Near 1600, François Viète's In artem analyticem isagoge by François Viète (1591) supplies a particularly revealing starting point. His analytical art uses letters for known quantities as well as unknown ones. In his terminology, logistica numerosa concerns numerical calculation and logistica speciosa calculation with species, or general magnitudes. Vowels represent unknowns and consonants known magnitudes. This allows a single relation to represent many particular problems, but it is still tied to geometrical homogeneity: a square and a length do not simply become quantities of the same kind because they are written with letters.^[ref][ref]

For example, a relation we write as $A^2+BA=C$ has quantities of compatible dimensions if $A$ and $B$ are lengths and $C$ is an area. Letters do more than abbreviate a numerical question: they express relations between whole families of magnitudes. The phrase specious arithmetic therefore indicates arithmetic carried out on species; analysis stresses the art of reasoning from an assumed unknown towards its determination. Neither term should be reduced to the modern subject real analysis.

René Descartes's La Géométrie by René Descartes (1637) demonstrates another relation between algebra and geometry. A chosen unit segment lets multiplication, division and extraction of square roots be represented by constructions of lengths. The product of two measured lengths can itself be represented by a length relative to that unit. In modern dimensional notation the construction gives $ab/u$ for unit length $u$, removing the obstacle that a product must always be treated as an area. The text's equations can then organise geometrical problems and classify curves by their algebraic complexity. Its title remains geometry: algebra serves a geometrical programme rather than announcing a present-day department of abstract algebra.^[ref]

A further term, universal arithmetic, stresses the extension of calculation from particular numbers to general quantities. Isaac Newton's Arithmetica universalis by Isaac Newton, issued in 1707, makes the term visible in a title whose subtitle concerns composition and resolution. A title is evidence for the vocabulary, not a sufficient definition of all contemporary usage.^[ref] In Leonhard Euler's Elements of Algebra by Leonhard Euler, published in German in 1770, general numerical calculation and the solution of equations remain a substantial conception of the subject. For instance, allowing negative and complex roots changes the admissible answers to polynomial equations while preserving the central question of determining an unknown.^[ref]

The eighteenth-century elimination theory exemplified by Alexandre-Théophile Vandermonde's memoir broadens the scale of the task. Instead of one numerical quadratic equation, one seeks a rule for an arbitrary number of simultaneous linear equations. The determinant is initially valuable because it effects that elimination. This is a different generality from the later study of a group: the objects being determined are still unknown quantities, and symbolic generality concerns the number and coefficients of the equations. The case cautions against using generality alone as a test for whether algebra has become abstract.^[ref]

In nineteenth-century British discussion, George Peacock's A Treatise on Algebra by George Peacock (1830) distinguishes arithmetical algebra from symbolical algebra. If the symbols mean positive numbers, $a-(a+b)$ has no positive-number result. Yet algebraists manipulate this expression without restriction. George Peacock therefore seeks principles for the manipulation of signs which are not confined by their original arithmetical interpretation. The contrast is explicitly argued in his preface: arithmetic suggests the laws, while the symbolic science requires foundations adequate to its more general conclusions.^[ref]

The familiar extension $(-1)(-1)=1$ illustrates the stakes. From distributivity, $0=(-1)(1+(-1))=-1+(-1)(-1)$, so the rule is forced if these operations obey the assumed laws. This explains how a law can survive a change in interpretation. It does not establish that every familiar law must survive every extension: once the allowable systems themselves change, an argument must state which laws it assumes. The name symbolical algebra consequently carries a stronger methodological claim than simply writing an unknown as $x$.

William Rowan Hamilton's work on quaternions supplies a decisive example of that change. His publications of the 1840s describe a new system of imaginaries in algebra. With quaternion units,Thus multiplication need not satisfy the commutativity even when it remains associative and supports division by nonzero elements. The new system is not merely a further list of roots of old polynomial equations. It has its own operations, interpretation and laws. William Rowan Hamilton's title makes explicit that a plurality of calculi can belong within algebra.^[ref]

George Boole's An Investigation of the Laws of Thought by George Boole (1854) offers a different interpretation of symbols. If $x$ represents selection of a class, repeating that selection gives $x^2=x$; multiplication can represent intersection and $1-x$ a complementary class. His logical calculus borrows from numerical algebra but also restricts interpretation: his sum of classes is not automatically unrestricted set union, and intermediate symbolic expressions need not name classes directly. It would therefore be inaccurate to identify all of his rules with a modern Boolean algebra. The example nevertheless shows why algebraic reasoning could extend beyond magnitudes.^[ref]

The shift can also take a concrete linear form. Arthur Cayley's A Memoir on the Theory of Matrices by Arthur Cayley (1858) treats matrices with operations of their own. The identity matrix is no longer the scalar $1$, though it plays an analogous role; matrix multiplication is generally noncommutative. For example,produce $AB=\mathrm{diag}(1,0)$ and $BA=\mathrm{diag}(0,1)$. This is a checkable reason why universal arithmetic can no longer mean that every rule of ordinary numbers applies unchanged.^[ref]

Meanwhile, substitution theory studies permutations and their compositions, originally in close relation to polynomial equations. Évariste Galois's work connects the solvability by radicals of an equation with its associated group. Augustin-Louis Cauchy's work on substitutions and Heinrich Weber's 1882 definition illustrate successive forms of generalisation: from particular permutations towards arbitrary elements satisfying operational conditions. This is not a claim that one man supplied the complete modern hierarchy of groups, rings and fields at once. It identifies the change in the question: one can now investigate what follows from the laws of an operation, independently of whether the elements are numbers, substitutions or classes.^[ref]

By 1900, algebra could concern the laws and structures of several calculi. Earlier meanings persisted in teaching and in the theory of equations. The strongest account of the change therefore combines continuity with enlargement: letters for general quantities, symbolic operations with explicit laws, nonnumerical interpretations, and structural questions about those laws. Analytical art foregrounded a method of discovery, universal arithmetic foregrounded general calculation, symbolical algebra foregrounded formal operations, and substitution theory foregrounded a particular class of transformations. Their differing uses help explain the expansion more precisely than a single date for the birth of abstraction.

A mathematician in Galileo Galilei's world was a practitioner situated within a particular division of knowledge and work. The word could embrace demonstrative geometry and arithmetic, but also astronomy, optics, mechanics, surveying, calendar calculation and the design or use of scientific instruments. Such mixed mathematics treated features of natural or practical objects through mathematical relations. It was neither identical to a present-day university department nor confined to calculation without claims about nature.

The distinction from a natural philosopher was important. Within a traditional university hierarchy, natural philosophy investigated the causes and principles of physical change. Mathematics could establish a relation between abstract quantities with great certainty, while opponents doubted whether it captured the constitution of a real body. Showing what follows for an ideal inclined plane, for example, leaves a further question about whether a particular apparatus realizes the assumptions closely enough. That question is not an objection which can be answered merely by producing a longer geometrical proof. The relation of abstraction, measurement and physical explanation was itself contested.^[ref]

There were also several routes to employment. A university teacher, an scientific instrument maker and someone serving a court or military patron might all perform mathematical work while possessing different income, status and audiences. Practical expertise in fortification, surveying or optics could bring rewards without establishing that its holder had authority over every question of natural philosophy. Conversely, a learned author could rely on the skills of people whose work was not credited equally in print. The important historical questions are what tasks were recognized, who paid for them, and whose testimony carried weight. A modern boundary between theoretical research and technical service would obscure these connections.

Galileo Galilei's career makes the contested boundary visible. The Sidereus Nuncius by Galileo Galilei communicated new observations through a manufactured telescope, successive drawings and an account intended to make unfamiliar objects credible. The work also addressed a courtly audience: naming the bodies accompanying Jupiter was part of presenting an achievement to a patron, not an incidental ornament added after a purely private discovery. The title and dedication situate mathematical work within relationships of employment and reputation.^[ref]

His mathematical treatment of motion likewise pressed beyond the role of calculating celestial appearances. In Two New Sciences by Galileo Galilei, a definition of uniform acceleration leads to a geometrical result in which travelled distance varies as the square of elapsed time. An inclined plane stretches the time of descent, making a comparison more manageable. In modern notation the relationship is $s=a{t}^2/2$ for release from rest. The notation is ours; the historically significant combination is an idealized proof, a proposed physical regularity and a reported experimental test.^[ref]

The label mathematician therefore cannot be read as a declaration that Galileo Galilei made no physical claims. Nor does his insistence on mathematical explanation prove that other occupations or disciplinary standards were irrelevant. His 1610 transition into Tuscan service, with the combined style of mathematician and philosopher, is evidence of the status being sought, rather than proof that the existing hierarchy had already disappeared. The case shows an investigator using scientific instruments, patronage and mathematical demonstration to enlarge the jurisdiction of his expertise. It also explains why a seemingly terminological distinction could become consequential in disputes over heliocentrism.^[ref]

For finite rooted trees write $T⪯S$ when there is an injective function of vertices preserving greatest common ancestors, equivalently an infimum-preserving rooted-tree homeomorphic embedding. No linear ordering of siblings is imposed. Kruskal's tree theorem says that every infinite sequence has an earlier tree embedding into a later tree: this embedding relation is a well-quasi-ordering.

The finite form uses a parameter $k$ to restrict the growth of the trees. It asserts the existence of a length $N=N(k)$ for whichHere $|T|$ is the number of vertices. The parameter $k$ is universally quantified; changing the starting index just shifts the parameter. This is Friedman's finite form of Kruskal's theorem.

Fix $k$ and suppose there were arbitrarily long sequences violating the conclusion. Form a tree whose nodes are their finite prefixes, including the empty prefix. Choose one representative of each finite rooted-tree isomorphism type. At position $i$ there are only finitely many choices, since the tree has at most $k+i$ vertices. Hence this finite bad-sequence tree is finitely branching. It has nodes at arbitrarily large heights by the supposed failure of the finite form. König infinity lemma supplies an infinite branch. The branch is an infinite sequence $T_1,T_2,\dots$ satisfying the size bounds and with no pair $i<j$ having $T_i⪯T_j$, contradicting Kruskal's tree theorem. Therefore the finite length exists for every $k$.

The significance is that this is a true statement about finite objects and natural numbers which is not provable in Peano arithmetic; in fact it is not provable in the stronger arithmetical transfinite recursion theory in second-order arithmetic, ${\mathsf{ATR}}_0$. It is a natural combinatorial instance of incompleteness. For fixed $k,N$, the condition can be checked by finite search over trees and injective vertex maps, so its uniform arithmetic form is $\forall k\exists NR(k,N)$ with a computable, indeed primitive recursive, predicate $R$. Thus its least sufficient length is a total computable function, but its totality cannot be proved in those theories. Each fixed numerical instance can nevertheless be proved in Peano arithmetic by verifying some particular finite witness. The obstruction concerns the uniform statement for all parameters, rather than the decidability of any one finite search.

We prove closure under the defining schemes for primitive recursive functions, keeping all unbounded existential variables outside a bounded arithmetic formula. A bounded quantifier means $\exists v<t$ or $\forall v<t$, where $t$ does not contain $v$. All formulas are interpreted in the standard natural numbers.

First we need a finite sequence code using only the permitted language of ordered rings. Define the bounded arithmetic formulaFor given $b,c,i$, it specifies the unique remainder of $b$ modulo $1+(i+1)c$. In particular the quotient and remainder variables are bounded by arithmetic terms; division is not a new language symbol.

Every finite list $a_0,\dots ,a_n$ can be coded by some pair $b,c$. Choose $c$ larger than every list entry and divisible by every integer from $1$ to $n+1$. The moduli $m_i=1+(i+1)c$ are pairwise coprime. Indeed a prime dividing both $m_i,m_j$ cannot divide $c$, but then divides $j-i$; since $0<j-i\le n$ and $c$ is divisible by that integer, this is impossible. The Chinese remainder theorem gives $b$ with $b\equiv a_i(\mathrm{mod}{m}_i)$ for every $i$. Since $a_i<c<m_i$, each $B(b,c,i,a_i)$ holds. This is Gödel beta-function sequence coding. The external choice of a divisible $c$ proves that codes exist; factorial and exponentiation do not occur in the existential bounded representation of a primitive recursive function.

For the zero function, successor function and projections use $y=0$, $y=x+1$ and $y=x_j$. These formulas need no auxiliary variables. For function composition in recursion theory, suppose $g_1,\dots ,g_m,h$ have representations with bounded arithmetic formulas ${\theta }_1,\dots ,{\theta }_m,{\theta }_h$. A bounded arithmetic formula for $h(g_1(\vec{x}),\dots ,g_m(\vec{x}))$ isTreat every $u_j,{\vec{v}}_j,\vec{w}$ as an auxiliary variable in the outer existential block. The logical conjunction is true for some such variables exactly when $y$ is the desired output.

Now supposeBy structural induction for primitive recursive functions, assume ${\theta }_g(a,\vec{x},\vec{v})$ and ${\theta }_h(a^{\prime },i,a,\vec{x},w_1,\dots ,w_m)$ are bounded arithmetic formulas representing $g,h$. We code the values $f(0,\vec{x}),\dots ,f(n,\vec{x})$ with $b,c$. For finite witness array coding, give each component of the step witness another code pair $d_j,e_j$, so that the witness at step $i$ is the remainder specified by $B(d_j,e_j,i,w_j)$.

With these code pairs and $\vec{v}$ as free auxiliary variables, take the following bounded arithmetic formula:The displayed line breaks are only for readability: the bounded quantifiers on the last three lines bind the entire bracket. If $m=0$, their empty block and logical conjunction are omitted. Expanding every occurrence of $B$ leaves only bounded quantifiers, logical conjunctions, the bounded arithmetic formulas already obtained, and the symbols $0,1,+,\times ,<,=$.

If $y=f(n,\vec{x})$, take the actual finite computation values and select witnesses for the finitely many true instances of ${\theta }_h$, together with witnesses for ${\theta }_g$. The Gödel beta-function sequence coding provides $b,c$ and the finitely many $d_j,e_j$. These make $\varphi$ true. Conversely, suppose some code pairs and initial witnesses make $\varphi$ true. The unique remainders of $b$ give values $a_0,\dots ,a_n$. The initial clause makes $a_0=g(\vec{x})$. Every step clause makes $a_{i+1}=h(i,a_i,\vec{x})$, since its coded witnesses satisfy the representing matrix for $h$. Induction on $i$ gives $a_i=f(i,\vec{x})$, and the final remainder clause gives $y=a_n$. This argument includes $n=0$, when the step condition is empty.

Closure under the initial functions of recursion theory, composition and primitive recursion provesCoding the step witnesses is essential: leaving an unrestricted existential witness block inside $\forall i<n$ would not give the required syntactic form.

A theory is recursively axiomatizable when it has an effective enumeration of axioms, equivalently when its deductive closure is computably enumerable. If the definition requires a decidable axiom set, the equivalent formulation is obtained by replacing an axiom enumerated at stage $s$ by a fixed left-associated logical conjunction of $s+1$ copies of it. To recognize a proposed padded axiom, inspect its finitely many possible decompositions into repeated conjuncts and check the corresponding finite enumeration stages. The padding preserves logical equivalence, so the resulting decidable axiom set generates the same theory. In either convention, enumerate formal proofs using the finite sets of axioms seen so far. This effectively enumerates every theorem.

Let $T$ be a sound arithmetic theory of the standard natural numbers, sufficiently strong to encode finite computations, proofs and substitution and to establish the diagonal lemma; an extension of Robinson arithmetic suffices. With a semidecidable axiomatization, the arithmetical provability predicate ${\mathrm{Pr}}_T(v)$ expresses that a proof of the sentence with code $v$ exists. A proof certificate can include enumeration stages for its axioms, so this predicate is arithmetically expressible even when the given axiom set is only computably enumerable.

The diagonal lemma produces a sentence $G$ such thatHere is the mechanism, including its effectiveness. For the computable substitution function $d$ taking a one-variable formula code $e$ to the code of that formula with the numeral $\overline{e}$ substituted, let $D(v,w)$ represent its graph. Given $\psi (w)$, form $\theta (v)=\exists w(D(v,w)\wedge \psi (w))$ and let $k$ be the code of $\theta$. The sentence $\theta (\overline{k})$ has code $d(k)$. Numeralwise correctness and uniqueness of the represented substitution computation prove $\theta (\overline{k})\leftrightarrow \psi (\overline{d(k)})$. This constructs a fixed point effectively from the code of $\psi$. Applying it to $\psi =\neg {\mathrm{Pr}}_T$ gives $G$.

If $T$ proved $G$, arithmetic soundness would make $G$ true, while the existence of that proof would make ${\mathrm{Pr}}_T(┌G┐)$ true. The displayed equivalence would then make $G$ false, a contradiction. Thus $T$ does not prove $G$. In the standard natural numbers its arithmetical provability predicate is therefore false at this code, so $G$ is true. Arithmetic soundness now rules out a proof of $\neg G$ as well. Hence $T$ is incomplete: neither $G$ nor $\neg G$ is a theorem, and $G$ is true.

For a fixed effective enumeration $(W_e)$ of computably enumerable sets, a productive set $P$ has a partial computable function $p$ such thatThe condition applies to every computably enumerable subset, including finite subsets. No condition is imposed on $p(e)$ when the inclusion fails.

Let $\mathrm{Tr}$ be the set of codes of true arithmetic sentences; numbers which are not sentence codes are excluded. Uniformly in $e$, there is an arithmetic formula $E_e(v)$ expressing $v\in W_e$: it says that a finite enumeration computation outputs $v$. Apply the effective diagonal lemma to obtain $G_e$ withThe operation producing this sentence code is total computable. Suppose $W_e\subseteq \mathrm{Tr}$. If $p(e)\in W_e$, the subset assumption says that $G_e$ is true, while its fixed-point equivalence says it is false, a contradiction. Thus $p(e)\notin W_e$. The same equivalence now says $G_e$ is true, so $p(e)\in \mathrm{Tr}$. We have provedTherefore arithmetic truth is a productive set. This proves productivity of arithmetic truth. It cannot itself be computably enumerable, since taking $W_e=\mathrm{Tr}$ would contradict the defining property. Applying the productive procedure to the enumerable theorem set of a sound arithmetic theory also gives a true sentence outside that theory. The productive construction does not require the enumerable subset of truths to be a theory or to be deductively closed.

Bounded completeness of an arithmetic theory means that every bounded arithmetic first-order sentence true in the standard natural numbers is provable in $S$. If $S$ is first-order consistent and proves a false bounded arithmetic sentence $B$, bounded completeness of an arithmetic theory also proves its true bounded negation, a contradiction. Conversely, if every bounded theorem is true, $S$ cannot be inconsistent, because inconsistency would prove the false bounded arithmetic sentence $0=1$. ThusIf $S$ is one-consistent and proves $\exists xB(x)$ with bounded matrix, that existential sentence cannot be false: otherwise every $\neg B(\bar{n})$ would be a true bounded arithmetic sentence and hence provable, contrary to one-consistency. Thus $S$ has Sigma-1 soundness.

Conversely, Sigma-1 soundness excludes inconsistency. If $S⊢\exists xB(x)$, it supplies a standard witness $n$ with $B(n)$ true. Bounded completeness of an arithmetic theory proves $B(\bar{n})$, so first-order consistency forbids a formal proof of $\neg B(\bar{n})$. Hence there cannot simultaneously be refutations of all standard instances. ThereforeFinite blocks of existential logical variables are treated as finite tuples of witnesses, with the same argument.

Start with the supplied bounded-complete, one-consistent first-order theory $T$ proving a false first-order sentence $F$. Replace it by its deductive closure, which preserves these properties and contains $F$. Enumerate the arithmetic first-order sentences as $X_0,X_1,\dots$. Recursively extend the current first-order theory by either $X_n$ or $\neg X_n$, choosing an extension which remains one-consistent as permitted by the supplied lemma, and then take its deductive closure. Call the resulting increasing sequence $T_n$, with $T_0$ the initial first-order theory, and put $S={\bigcup }_n{T}_n$.

Every stage is still bounded-complete. By (b), every stage has Sigma-1 soundness. If $S$ proved a false Sigma-1 first-order sentence, the finite formal proof would use assumptions from one stage $T_n$, contradicting its Sigma-1 soundness. Thus $S$ has Sigma-1 soundness and is bounded-complete, so (b) makes it one-consistent.

This soundness of an arithmetic theory argument is essential: the definition of one-consistency involves infinitely many standard refutations, so it would be insufficient merely to say that a violation has a finite formal proof. What has a finite formal proof is the false existential sentence, and bounded completeness of an arithmetic theory is what turns one-consistency into the needed soundness of an arithmetic theory condition.

The union is deductively closed because each formal proof has finitely many assumptions. It contains either $X$ or $\neg X$ for every first-order sentence, by the numeralwise enumeration in arithmetic, and contains the false first-order sentence $F$. If it were omega-consistent, (c) would make it correct on all first-order sentences, contradicting $F$. We have therefore constructedOmega-consistency always implies one-consistency by restricting its matrices. This counterexample proves that the converse is strictly false.

Take $\square A={\mathrm{Pr}}_{PA}(┌A┐)$ for the standard formal proof predicate symbol and putUse as given the arithmetization of syntax in PA, the derivability conditions, and the diagonal lemma. The latter supplies the fixed point needed in (a), and the former conditions interpret its normal modal distribution, necessitation on theorems and axiom4. Thus the argument in (a) proves the internal Löb implication in PA. With $X=\perp$ it readsThe inner implication is the first-order consistency first-order sentence $\neg \square \perp$, so contraposition givesThis is the arithmetic statement of the second incompleteness theorem proved within PA: if PA is first-order consistent, there is no PA formal proof of its first-order consistency first-order sentence. The displayed implication is a PA theorem without assuming that PA proves its antecedent.

For the corresponding external consequence, if a first-order consistent PA proved ${\mathrm{Con}}_{PA}$, theoremhood would give a formal proof of its boxed assertion. The displayed theorem together with the supposed formal proof of first-order consistency gives its negation, contradicting first-order consistency. Hence an externally first-order consistent PA does not prove its own first-order consistency.

An arithmetic logical formula is ${\Sigma }_0$, or bounded, if all its quantifiers are bounded by arithmetical first-order terms. A ${\Sigma }_1$ logical formula has an initial block of existential quantifiers followed by a bounded matrix, up to the usual logical transformations. Soundness of an arithmetic theory at a given level means that every first-order sentence of that level proved by the first-order theory is true in the standard natural numbers. Here ${\Sigma }_0$-completeness means that every true bounded arithmetic sentence is provable.

A first-order theory is one-consistent if there is no bounded arithmetic formula $A(x)$ for which it proves $\exists xA(x)$ while proving $\neg A(\bar{n})$ for every standard natural number $n$. This is a restricted form of omega-consistency. In particular one-consistency implies first-order consistency, since an inconsistent first-order theory proves every first-order sentence and its negation.

Suppose a ${\Sigma }_0$-complete first-order theory $S$ is first-order consistent. If it proved a false bounded arithmetic sentence $\theta$, the true bounded arithmetic sentence $\neg \theta$ would also be provable by completeness, contradicting first-order consistency. Thus $S$ is ${\Sigma }_0$-sound. Conversely ${\Sigma }_0$-soundness excludes inconsistency because an inconsistent first-order theory proves the false bounded arithmetic sentence $0=1$. ThereforeIf $S$ is one-consistent but proved a false existential sentence $\exists xA(x)$ with bounded matrix, every standard instance $\neg A(\bar{n})$ would be true and hence provable. This violates one-consistency. Thus it is ${\Sigma }_1$-sound. Conversely, ${\Sigma }_1$-soundness implies first-order consistency by the previous argument, since bounded arithmetic sentences are included at the existential level. If $S$ proved $\exists xA(x)$, soundness of an arithmetic theory would give a standard witness $n$ with $A(n)$ true. Bounded completeness of an arithmetic theory would then give $S⊢A(\bar{n})$, so first-order consistency prevents simultaneous formal proofs of all the negated instances. HenceMultiple existential logical variables can be treated as a finite tuple of witnesses; the same reasoning applies.

Under the arithmetical interpretation $\square A=P_S(┌A┐)$, the Löb axiom says that a formal proof of the local reflection implication for $A$ already entails a formal proof of $A$:It is a formalized constraint on self-verification of a formal proof system. Externally, Löb's theorem says that if the system itself proves its own local reflection implication for $A$, it proves $A$. Distribution reflects closure of formal proofs under implication, necessitation reflects that a theorem has an arithmetically recognizable formal proof, and positive introspection reflects formal proof verification inside arithmetic.

Taking $A$ to be a refutable first-order sentence, especially a contradiction, recovers the obstruction behind the second incompleteness theorem: a first-order consistent sufficiently strong system cannot prove the corresponding claim that no formal proof of that first-order sentence exists. This does not identify provability with truth, nor grant the unrestricted factivity principle $\square A\to A$ as a theorem of the system. The Löb axiom is the characteristic additional scheme of Gödel–Löb provability logic.

An arithmetic theory is one-consistent if there is no bounded arithmetic formula $\delta (x)$ for which it proves $\exists x\delta (x)$ and also proves $\neg \delta (\overline{n})$ for every standard natural number $n$. A finite tuple of existential witnesses can be coded by one natural number. The associated Sigma-1 soundness property says that every ${\Sigma }_1$ sentence it proves is true in the standard natural numbers.

Suppose first that the theory is one-consistent, but proves a false ${\Sigma }_1$ sentence $\exists x\delta (x)$. For every standard $n$, $\neg \delta (\overline{n})$ is then a true bounded sentence. Bounded completeness makes each such sentence a theorem, violating one-consistency.

Conversely suppose the theory is ${\Sigma }_1$-sound. If it proved both the existential sentence and every negated standard instance, soundness would supply an actual witness $n$. Its positive instance $\delta (\overline{n})$ is a true bounded sentence and hence provable. Together with the assumed negative instance this would make the theory inconsistent; an inconsistent theory proves a false ${\Sigma }_1$ sentence, contrary to soundness. Thusunder the stated bounded-completeness assumption. In particular either condition implies that the theory is a consistent first-order theory.

By part (c), one-consistency gives Sigma-1 soundness and hence ordinary consistency. First, $S$ cannot prove $\neg G$: if it did, the diagonal equivalence would give $S⊢\square G$. This is a ${\Sigma }_1$ sentence, so soundness would make it true. The stipulated standard interpretation of the arithmetical provability predicate would then supply an actual proof of $G$, contradicting consistency.

Now suppose $S⊢\square \neg G$. This too is a ${\Sigma }_1$ theorem. Soundness and the standard correctness of the predicate would imply that there is an actual $S$-proof of $\neg G$, which was just excluded. ThereforeThe two applications of soundness concern the provability assertions, not the truth of arbitrary arithmetic sentences.

Let $\perp$ abbreviate the fixed false arithmetic equality, and fix an actual proof of $\neg \perp$ with code $m$. For a proposed proof code $y\ge m$, that known proof of the negation already violates the bounded negative-proof test in $R(┌\perp ┐)$.

For the finitely many codes $y<m$, either one is an actual proof of $\perp$, in which case Peano arithmetic is inconsistent and proves the requested conclusion by explosion, or none is. In the latter case the finitely many true bounded facts $\neg \mathrm{Prf}(┌\perp ┐,\overline{y})$ are all provable by bounded completeness. Their conjunction excludes every code below $m$. The positive bounded fact that $m$ proves $\neg \perp$ is likewise provable. Splitting $y<m$ and $y\ge m$ inside arithmetic now givesThus the consistency statement for this Rosser provability predicate is provable. The argument uses only a fixed finite initial segment of proof codes; it does not prove the usual unbounded consistency statement.

The external necessitation rule assertion is valid. Suppose $PA⊢X$ and fix a proof code $m$. If $PA$ is inconsistent the assertion follows by explosion. Otherwise there is no actual proof of $\neg X$. Each of the finitely many bounded checks up to $m$ is therefore a true bounded arithmetic fact and is provable. Together with the positive proof check at $m$ this gives

The requested internal modus-ponens assertion needs an additional coding property. Combining a proof of $X$ and a proof of $X\to Y$ produces a proof of $Y$, but its code can exceed both original codes. The two Rosser hypotheses exclude proofs of $\neg X$ and $\neg (X\to Y)$ only up to their respective witness bounds. They provide no bound excluding proofs of $\neg Y$ below the new proof code. Ordinary internal modus ponens rule for the unbounded provability predicate does not fill this gap.

Consequently the premises printed here do not, just by themselves, justifyThis property varies with the Rosser proof-order dependence: some specially chosen proof predicates satisfy it, while general Rosser proof predicates need not. ^[ref].

The reference to a proof predicate “as given in the course” would need an explicit additional proof-order lemma to establish this part for that particular coding. Standard correctness on numeral instances and the ordinary Hilbert-Bernays-Löb derivability conditions alone are insufficient. The next solution gives the intended argument with the missing condition stated explicitly.