Arithmetically saturated models of arithmetic (Q1913628): Difference between revisions
From MaRDI portal
Latest revision as of 12:22, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Arithmetically saturated models of arithmetic |
scientific article |
Statements
Arithmetically saturated models of arithmetic (English)
0 references
22 May 1996
0 references
A model of a first-order theory is arithmetically saturated if it is saturated with respect to the types that are arithmetic in the complete types realized in the model. The paper presents an outline of the general theory of countable arithmetically saturated models of PA and some of its applications. The results concern the automorphism group of a countable recursively saturated model of PA. New results on fixed point sets, open subgroups, and the cofinality of the automorphisms group are given. It is also shown that the standard system of a countable arithmetically saturated model of PA is determined by the lattice of the elementary substructures of the model.
0 references
Peano arithmetic
0 references
recursive saturation
0 references
lattice of elementary substructures
0 references
arithmetically saturated models of PA
0 references
automorphism group
0 references
fixed point
0 references
open subgroups
0 references
cofinality
0 references
0 references
0 references
