✦ LIBER ✦

ON AUTOMORPHISMS OF RESPLENDENT MODELS OF ARITHMETIC

✍ Scribed by Zofia Seremet

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 225 KB
Volume: 30
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19840301911

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we show theorems concerning automorphisms of models of Peano Arithmetic. These results were obtained by KOTLARSKI [ 2 ] , 5 4 (as K~TLARSKI informed the author, at least part of these results were obtained by ALENA VENCOVSKA (unpublished) and CRAIG SMORYNSKI [4]). KoTLARbKI asked the author if these results hold for saturated and special models and if the use of satisfaction classes is really needed in the proofs.

We show that both these questions have positive answers, in fact these results hold for all resplendent models.

there exists an automorphism g of M such that g ( b ) =+= b and g f N = identity. (ii) For b E M let M[b] = ( a E M : for each parameter-free term t ( v ) , M k t(a) < b ) .

📜 SIMILAR VOLUMES

Automorphisms of Models of True Arithmet

Automorphisms of Models of True Arithmetic: More on Subgroups which Extend to a Maximal One Uniquely

✍ Henryk Kotlarski; Bożena Piekart 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 239 KB

Continuing the earlier research in [14] we give some more information about nonmaximal open subgroups of G = Aut(M) with unique maximal extension, where M is a countable recursively saturated model of True Arithmetic.

Automorphisms of Models of True Arithmet

Automorphisms of Models of True Arithmetic: Subgroups which Extend to a Maximal Subgroup Uniquely

✍ Henryk Kotlarski; Bożena Piekart 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 420 KB

## Abstract We show that if __M__ is a countable recursively saturated model of True Arithmetic, then __G__ = Aut(__M__) has nonmaximal open subgroups with unique extension to a maximal subgroup of Aut(__M__). Mathematics Subject Classification: 03C62, 03C50.

On the structure of kripke models of hey

On the structure of kripke models of heyting arithmetic

✍ Zoran Marković 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 456 KB 👁 1 views

## Abstract Since in Heyting Arithmetic (HA) all atomic formulas are decidable, a Kripke model for HA may be regarded classically as a collection of classical structures for the language of arithmetic, partially ordered by the submodel relation. The obvious question is then: are these classical str

Arithmetic of divisibility in finite mod

Arithmetic of divisibility in finite models

✍ Marcin Mostowski; Anna E. Wasilewska 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB 👁 1 views

## Abstract We prove that the finite‐model version of arithmetic with the divisibility relation is undecidable (more precisely, it has Π^0^~1~‐complete set of theorems). Additionally we prove FM‐representability theorem for this class of finite models. This means that a relation __R__ on natural nu

Generic cuts in models of arithmetic

✍ Richard Kaye 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB

## Abstract We present some general results concerning the topological space of cuts of a countable model of arithmetic given by a particular indicator __Y__. The notion of “indicator” is de.ned in a novel way, without initially specifying what property is indicated and is used to de.ne a topologi

Nonstandard models that are definable in

Nonstandard models that are definable in models of Peano Arithmetic

✍ Kazuma Ikeda; Akito Tsuboi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB

## Abstract In this paper, we investigate definable models of Peano Arithmetic PA in a model of PA. For any definable model __N__ without parameters in a model __M__, we show that __N__ is isomorphic to __M__ if __M__ is elementary extension of the standard model and __N__ is elementarily equivalen