Skip to content

[set theory] limofsize.tex, simp.tex, expotough.tex - #444

Open
KokunoYumeto wants to merge 3 commits into
OpenLogicProject:masterfrom
KokunoYumeto:translation-findings-set-theory
Open

KokunoYumeto wants to merge 3 commits into
OpenLogicProject:masterfrom
KokunoYumeto:translation-findings-set-theory

Conversation

@KokunoYumeto

Copy link
Copy Markdown

While translating the Open Logic Project into eighteen languages, the AI checks of the translations kept finding small errors in the English source. We reported them as issues (#432, #433, #435, #436), and you have been integrating them by hand. These pull requests may save you that work: each fix is a separate commit, checked against master a216aa64. With them, open-logic-complete builds as on master (no errors, no new undefined references), and the changed proof-theory sections, which that driver does not include, compile on their own as on master. Merge any, all or none; each branch starts from master and merges on its own.

  • limofsize.tex: |τ[A]| ≤ |A| holds given Choice. Replacement yields only a surjection from A, and in ZF an injection back can fail.
  • simp.tex: the proof of cardplustimesmax now also shows a × b = a (a ≤ a × b ≤ a × a = a).
  • expotough.tex: in cardexpo2reduct, a may be finite. a × b = b follows from b ≤ a × b ≤ b × b = b, using cardplustimesmax only for b, b.

Prepared by AI: the fixes were written by a Claude agent (Claude Opus 5.5 at effort medium), and the mathematical ones were checked by Claude Opus 5.5 at effort max.

🤖 Generated with Claude Code

KokunoYumeto and others added 3 commits November 15, 2026 13:32
Replacement gives a surjection A -> tau[A]; an injection back needs Choice (or a well-order of A); in ZF it can fail.

Ledger: OLI-STH-LIMITATION-IMAGE-CARDINALITY, FR-FOLLOWUP-C4876, OLTESTREPLLIM-001, BN-SRC-792, OLPL-492

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
The chain shows a + b = a but never mentions a x b.

Ledger: OLI-0588-PRODUCT-PROOF-OMISSION

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
cardplustimesmax needs both factors infinite, but a may be finite (2 <= a).

Ledger: OLI-0589-FINITE-BASE-PROOF-CASE

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
@rzach

rzach commented Nov 15, 2026

Copy link
Copy Markdown
Member

@timbutton and these?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants