Combinatorial characterization of [mathematical formula]-indescribability in [mathematical formula]

Archive for Mathematical Logic 36 (4-5) (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Euler's?-function in the context of I? 0.Marc Jumelet - 1995 - Archive for Mathematical Logic 34 (3):197-209.
A hierarchy of filters smaller than [mathematical formula].Yoshihiro Abe - 1997 - Archive for Mathematical Logic 36 (6).
The size of $\tilde{T}$.Paul Larson - 2000 - Archive for Mathematical Logic 39 (7):541-568.
Relativized projecta and [mathematical formula]-re sets.Colin G. Bailey - 1997 - Archive for Mathematical Logic 36 (4-5).
A note on the? 2 0 -induction rule.Ulrich Kohlenbach - 1995 - Archive for Mathematical Logic 34 (4):279-283.
Ordinal arithmetic and [mathematical formula]-elementarity.Timothy J. Carlson - 1999 - Archive for Mathematical Logic 38 (7):449-460.

Analytics

Added to PP
2014-03-24

Downloads
16 (#880,136)

6 months
8 (#352,434)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references