Paper Info
Title
Decoding in the automorphism group of a recursively saturated model of arithmetic
Abstract
The main result of this paper partially answers a question raised in about the existence of countable just recursively saturated models of Peano Arithmetic with non-isomorphic automorphism groups. We show the existence of infinitely many countable just recursively saturated models of Peano Arithmetic such that their automorphism groups are not topologically isomorphic. We also discuss maximal open subgroups of the automorphism group of a countable arithmetically saturated model of PA in a very good interstice.
Year
DOI
Venue
2015
10.1002/malq.201400008
MATHEMATICAL LOGIC QUARTERLY
Field
DocType
Volume
Saturated model,Discrete mathematics,Combinatorics,Non-standard model of arithmetic,Peano axioms,Countable set,Automorphism,True arithmetic,Isomorphism,Inner automorphism,Mathematics
Journal
61
Issue
ISSN
Citations 
3
0942-5616
0
PageRank 
References 
Authors
0.34
8
1
Name
Order
Citations
PageRank
Ermek S. Nurkhaidarov182.35