PA (aa)
From MaRDI portal
Publication:1913630
\(\text{PA} (aa)\) is Peano Arithmetic formulated in stationary logic. It is not at all obvious that \(\text{PA} (aa)\) is consistent. The author shows that it is. He proves that the first-order consequences of \(\text{PA}(aa)+\) the scheme of determinateness for stationary logic are the same as those of the full second-order arithmetic CA. Two main results are: (1) Every model of \(\text{PA} (aa)\) is \(\omega_1\)-like; (2) Every countable model \((M,X)\) of CA can be elementarily extended to an \(\omega_1\)-like finitely determinate model of \(\text{PA} (aa)\).
Recommendations
Cites work
- Generalized Quantifiers and Compact Logic
- scientific article; zbMATH DE number 4101175 (Why is no real title available?)
- scientific article; zbMATH DE number 3726320 (Why is no real title available?)
- scientific article; zbMATH DE number 3623503 (Why is no real title available?)
- Models and types of Peano's arithmetic
- On generalized quantifiers in arithmetic
- On the role of Ramsey quantifiers in first order arithmetic
- Peano Arithmetic and Hyper-Ramsey Logic
- Set theory with a filter quantifier
- Stationary logic
- Stationary logic of finitely determinate structures
- Substructure lattices of models of arithmetic
This page was built for publication: \(\text{PA} (aa)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1913630)
