The set of better quasi orderings is ii1/2-complete (vol 41, pg 373, 1995)

Mathematical Logic Quarterly 41 (4):574-574 (1995)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,865

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The Set of Better Quasi Orderings is ∏21.Alberto Marcone - 1995 - Mathematical Logic Quarterly 41 (3):373-383.
Richard Laver. On Fraïssé's order type conjecture. Annals of mathematics, ser. 2 vol. 93 , pp. 89–111. - Richard Laver. An order type decomposition theorem. Annals of mathematics, ser. 2 vol. 98 pp. 96–119. - Richard Laver. Better-quasi-orderings and a class of trees. Studies in foundations and combinatorics, edited by Gian-Carlo Rota, Advances in mathematics supplementary studies, vol. 1, Academic Press, New York, San Francisco, and London, 1978, pp. 31–48. - Saharon Shelah. Better quasi-orders for uncountable cardinals. Israel journal of mathematics, vol. 42 , pp. 177–226. [REVIEW]Charles Landraitis - 1987 - Journal of Symbolic Logic 52 (2):571-574.
Categorial generalization of algebraic recursion theory (vol 101, pg 91, 1995).J. Zashev - 1999 - Journal of Symbolic Logic 64 (1):406-406.
Haim Gaifman. Models and types of Peano's arithmetic. Annals of mathematical logic, vol. 9, pp. 223–306. - Julia F. Knight. Omitting types in set theory and arithmetic. The journal of symbolic logic, vol. 41 , pp. 25–32. - Julia F. Knight. Hanf numbers for omitting types over particular theories. The journal of symbolic logic, vol. 41 , pp. 583–588. - Fred G. Abramson and Leo A. Harrington. Models without indiscernibles. The journal of symbolic logic, vol. 41 , vol. 43 , pp. 572–600. [REVIEW]J. P. Ressayre - 1983 - Journal of Symbolic Logic 48 (2):484-485.
Alfred Tarski and Steven Givant. A formalization of set theory without variables. American Mathematical Society colloquium publications, vol. 41. American Mathematical Society, Providence1987, xxi + 318 pp. [REVIEW]István Németi - 1990 - Journal of Symbolic Logic 55 (1):350-352.
Constructive Well‐Orderings.Robin J. Grayson - 1982 - Mathematical Logic Quarterly 28 (33‐38):495-504.
Antonio Montalbán, Indecomposable linear orderings and hyperarithmetic analysis. Journal of Mathematical Logic, vol. 6 (2006), no. 1, pp. 89–120. - Itay Neeman, The strength of Jullien’s indecomposability theorem. Journal of Mathematical Logic, vol. 8 (2008), no. 1, pp. 93–119. - Itay Neeman, Necessary use of induction in a reversal. Journal of Symbolic Logic, vol. 76 (2011), no. 2, pp. 561–574. [REVIEW]Henry Towsner - 2014 - Bulletin of Symbolic Logic 20 (3):366-368.
Orderings of Types of Countable Arithmetic.K. Potthoff - 1978 - Mathematical Logic Quarterly 24 (7):97-108.
Quantifiers determined by partial orderings.Michal Krynicki - 1990 - Mathematical Logic Quarterly 36 (1):79-86.

Analytics

Added to PP
2014-04-02

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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