Machine-Native ReasoningReading edition

What the review label means

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Read and explore

Proofs and implementation

About this work

Other resources

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

What the review label means

The earlier 1,919-page collection preserved source documents and navigation. Its own assembly report did not claim a proof review of every imported page. It remains a historical source reader. This book replaces breadth as the admission rule with result-level inspection.

A formal statement is admitted here only when its domains and quantifiers are explicit, its proof is given in full, its source relationship is identified, its use in a later chapter is checked, and its applicable finite construction or sharp boundary is exercised by a documented exact check. This is an internal mathematical review. It does not convert a finite check into a proof of an infinite statement.

The review is also narrower than accepting a source wholesale. A theorem selected from Machine Societies does not import a general claim about spontaneously formed institutions. A linear reconstruction argument does not certify an emergent workspace. A commuting equation does not establish that a neural network learned its terms. Those stronger interpretations are outside the core.

The written statements and proofs in this reader retain their authenticated reviewed-core source. The formal companion records the corresponding Lean declarations, source-facing hypothesis checks, and reproducible verification gates. The formal correspondence chapter distinguishes those checks from the earlier finite computational receipts and from the wider research monograph. A formal counterpart applies to its stated mathematical contract; it does not establish that an implementation has learned or deployed that contract.

The companion review files name every retained result, its assumptions, its source anchor, its computational check, and its remaining limit. They also account for every source document in the former collection. Omission means either that its full evidence was not re-established for this edition or that it is unnecessary to the continuous argument. It is not a claim that the omitted work is false or valueless.

Source and conversion record

Source SHA-256: c2ef44767a242021cc573bbba7bb0c95df74a704c99cf992d2eff0a396838593

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Machine-Native Reasoning

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index