Decoding in the automorphism group of a recursively saturated model of arithmetic

Mathematical Logic Quarterly 61 (3):179-188 (2015)
  Copy   BIBTEX

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 in a very good interstice.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,830

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2015-09-03

Downloads
20 (#1,031,500)

6 months
5 (#1,025,536)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations