• 検索結果がありません。

ファイル置き場 Sendai Logic Homepage abst

N/A
N/A
Protected

Academic year: 2018

シェア "ファイル置き場 Sendai Logic Homepage abst"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)

A stronger version of Friedman’s self-embedding theorem

Keita Yokoyama

May 20, 2011

In [1], Harvey Friedman showed the famous self-embedding theorem for PA which asserts that every countable model of PA has an initial segment which is isomorphic to itself. This theorem can be generalize to the following (see e.g., [2, Section 12]):

(†) every countable model of IΣn has a Σn-elementary initial segment which is isomorphic to itself.

However, this theorem is not strong enough to characterize countable models of IΣn, i.e., there exists a countable model M which satisfies (†) but M 6|= IΣn. On the other hand, Tanaka’s self- embedding theorem for WKL0[3] exactly characterize countable models of WKL0. We consider a stronger version of (†) and characterize models of subsystems of PA.

References

[1] Harvey Friedman. Countable models of set theories. In Cambridge Summer School in Math. Logic, volume 337 of Lecture Notes in Math., pages 539–573, 1973.

[2] Richard Kaye. Models of Peano Arithmetic. Oxford Logic Guides, 15. Oxford University Press, 1991. x+292 pages.

[3] Kazuyuki Tanaka. The self-embedding theorem of WKL0and a non-standard method. Annals of Pure and Applied Logic, 84:41–49, 1997.

1

参照

関連したドキュメント

A Darboux type problem for a model hyperbolic equation of the third order with multiple characteristics is considered in the case of two independent variables.. In the class

This paper presents an investigation into the mechanics of this specific problem and develops an analytical approach that accounts for the effects of geometrical and material data on

In fact, we have shown that, for the more natural and general condition of initial-data, any 2 × 2 totally degenerated system of conservation laws, which the characteristics speeds

7.1. Deconvolution in sequence spaces. Subsequently, we present some numerical results on the reconstruction of a function from convolution data. The example is taken from [38],

Indeed, the proof of Theorem 1 presented in section 2 uses an idea of Mitidieri, which relies on the application of a Rellich type identity.. Section 3 is devoted to the proof of

The main technical result of the paper is the proof of Theorem 3.3, which asserts that the embeddability of certain countable configurations of elements into some model of the

We would like to stress that our mathematical model focuses primarily on the initial stages of placental development, during which trophoblast cells proliferate

In the proofs of these assertions, we write down rather explicit expressions for the bounds in order to have some qualitative idea how to achieve a good numerical control of the