Ordinal arithmetic and _1-elementarity
From MaRDI portal
Recommendations
Cited in
(26)- Patterns of resemblance of order 2
- Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis
- Pure patterns of order 2
- Ordinal notations and well-orderings in bounded arithmetic
- Pure \(\Sigma_2\)-elementarity beyond the core
- Short-circuiting the definition of mathematical knowledge for an artificial general intelligence
- Arithmetical algorithms for elementary patterns
- \(\Pi_1^1\)-comprehension as a well-ordering principle
- Fast-collapsing theories
- Theories and ordinals in proof theory
- scientific article; zbMATH DE number 2185163 (Why is no real title available?)
- scientific article; zbMATH DE number 440486 (Why is no real title available?)
- scientific article; zbMATH DE number 3991491 (Why is no real title available?)
- scientific article; zbMATH DE number 1223615 (Why is no real title available?)
- A machine that knows its own code
- 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
- A Glimpse of $$ \sum_{3} $$-elementarity
- Assignment of ordinals to patterns of resemblance
- Normal forms for elementary patterns
- Self-referential theories
- Elementary patterns of resemblance
- Generalizing Kruskal's theorem to pairs of cohabitating trees
- Tracking chains of \(\varSigma_2\)-elementarity
- The Bachmann-Howard structure in terms of _1-elementarity
- Ordinal arithmetic based on Skolem hulling
- \(\Sigma _{1}\)-elementarity and Skolem hull operators
This page was built for publication: Ordinal arithmetic and \(\Sigma_1\)-elementarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818592)