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

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)179-188
Number of pages10
JournalMathematical Logic Quarterly
Volume61
Issue number3
DOIs
StatePublished - May 1 2015

Fingerprint

Automorphism Group
Peano Arithmetic
Decoding
Countable
Isomorphic
Subgroup
Model

All Science Journal Classification (ASJC) codes

  • Logic

Cite this

@article{c3c76a4f352b4c55898a0f6dbeb44b4d,
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.",
author = "Ermek Nurkhaidarov",
year = "2015",
month = "5",
day = "1",
doi = "10.1002/malq.201400008",
language = "English (US)",
volume = "61",
pages = "179--188",
journal = "Mathematical Logic Quarterly",
issn = "0942-5616",
publisher = "Wiley-VCH Verlag",
number = "3",

}

Decoding in the automorphism group of a recursively saturated model of arithmetic. / Nurkhaidarov, Ermek.

In: Mathematical Logic Quarterly, Vol. 61, No. 3, 01.05.2015, p. 179-188.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Nurkhaidarov, Ermek

PY - 2015/5/1

Y1 - 2015/5/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84929708412&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84929708412&partnerID=8YFLogxK

U2 - 10.1002/malq.201400008

DO - 10.1002/malq.201400008

M3 - Article

VL - 61

SP - 179

EP - 188

JO - Mathematical Logic Quarterly

JF - Mathematical Logic Quarterly

SN - 0942-5616

IS - 3

ER -