More Automorphism Groups of Countable, Arithmetically Saturated Models of Peano Arithmetic
-
Published:2018-01-01
Issue:4
Volume:59
Page:
-
ISSN:0029-4527
-
Container-title:Notre Dame Journal of Formal Logic
-
language:
-
Short-container-title:Notre Dame J. Formal Logic
Publisher
Duke University Press
Reference8 articles.
1. [1] Bamber, N., and H. Kotlarski, “On interstices of countable arithmetically saturated models of Peano arithmetic,” Mathematical Logic Quarterly, vol. 43 (1997), pp. 525–40. 2. [2] Kaye, R., R. Kossak, and H. Kotlarski, “Automorphisms of recursively saturated models of arithmetic,” Annals of Pure and Applied Logic, vol. 55 (1991), pp. 67–99. 3. [3] Kossak, R., and J. H. Schmerl, “The automorphism group of an arithmetically saturated model of Peano arithmetic,” Journal of the London Mathematical Society (2), vol. 52 (1995), pp. 235–44. 4. [4] Marker, D. E., “Degrees coding models of arithmetic,” Ph.D. dissertation, Yale University, New Haven, Conn., 1983. 5. [5] Nurkhaidarov, E. S., “Automorphism groups of arithmetically saturated models,” Journal of Symbolic Logic, vol. 71 (2006), pp. 203–16.
|
|