SCOPUS 정보 검색 플랫폼

Mathematical Logic Quarterly

Volumn 48, Issue 1, 2002, Pages 125-130

On the slowly well orderedness of ε0

(1) Arai, Toshiyasu a

a HIROSHIMA UNIVERSITY (Japan)

Author keywords

Ordinal terms; Slowly well orderedeness

Indexed keywords

EID: 0036003372 PISSN: 09425616 EISSN: None Source Type: Journal
DOI: 10.1002/1521-3870(200201)48:1<125::AID-MALQ125>3.0.CO;2-N Document Type: Article

Times cited : (11)

References (4)

1
- 0004151901
- Clarendon Press, Oxford-New York
- (1998) Invitation to Discrete Mathematics
- Matoušek, J.¹ Nešetřil, J.²

2
- 77956710554
- Non-provability of certain combinatorial properties of finite trees
- L. A. Harrington et al., eds., North-Holland Publ. Comp., Amsterdam
- (1985) Harvey Friedman's research on the foundations of mathematics , pp. 87-117
- Simpson, S.G.¹

3
- 0012851817
- What makes a (point-wise) subrecursive hierarchy slow growing?
- S. B. Cooper and J. K. Truss, eds., Cambridge Univ. Press, Cambridge
- (1999) Sets and proofs , pp. 403-423
- Weiermann, A.¹

4
- 0009943926
- An application of graphical enumeration to PA
- to appear
- J. Symbolic Logic
- Weiermann, A.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.