A note on the variety of satisfaction classes (Q2639847): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q384285 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Roman Kossak / rank | |||
Normal rank |
Revision as of 01:00, 14 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the variety of satisfaction classes |
scientific article |
Statements
A note on the variety of satisfaction classes (English)
0 references
1990
0 references
A technique which was developed by \textit{H. Kotlarski} and \textit{Z. Ratajczyk} [Ann. Pure Appl. Logic 47, No.3, 199-223 (1990; Zbl 0708.03014)] to construct full inductive satisfaction classes on recursively saturated models of arithmetic, is used here to prove that every countable recursively saturated model M of PA has infinitely many incompatible full inductive satisfaction classes. The main theorem is applied to obtain results about the variety of expansions of recursively saturated models of PA to models of some fragments of second-order arithmetic.
0 references
recursively saturated models of arithmetic
0 references
full inductive satisfaction classes
0 references
recursively saturated models of PA
0 references
models of some fragments of second-order arithmetic
0 references