## 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
On the structure of initial segments of models of arithmetic
✍ Scribed by Jan Krajíček; Pavel Pudlák
- Publisher
- Springer
- Year
- 1989
- Tongue
- English
- Weight
- 382 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0933-5846
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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 a
## I ) This paper was written when I was a fellow of the Alexander von Humboldt Stiftung arid worked at the University of Heidelberg under the direction of Professor GERT H. MULLER. I express heie lily appreciation to him. 1 thank also Dr. HEKRYK KOTLARSKI from Warsaw for correspondence and helpt