arXiv (All)
open access
Indiscernibles and satisfaction classes in arithmetic
We investigate the theory PAI (Peano Arithmetic with Indiscernibles). Models of PAI are of the form (M, I), where M is a model of PA, I is an unbounded set of order indiscernibles over M, and (M, I) satisfies the extended induction scheme for formulae mentioning I. Our main results are Theorems A an
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Mechanizing Gödel's Incompleteness Theorems and Provability Logic#1110368
- The Formalization of two Computational Models in Dafny#1129495
- Beyond Witches, Angels and Unicorns. The Possibility of Expanding Russell´s Existential Analysis#100618
- Current Research on Gödel’s Incompleteness Theorems#696456
- Against Harmony#764448
Record · ID 986068
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive