The Set of Better Quasi Orderings is ∏21

Mathematical Logic Quarterly 41 (3):373-383 (1995)
  Copy   BIBTEX

Abstract

In this paper we give a proof of the II12-completeness of the set of countable better quasi orderings . This result was conjectured by Clote in [2] and proved by the author in his Ph.d. thesis [6] . Here we prove it using Simpson's definition of better quasi ordering and as little bqo theory as possible

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

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

Fraïssé’s conjecture in [math]-comprehension.Antonio Montalbán - 2017 - Journal of Mathematical Logic 17 (2):1750006.
Quasi‐completeness and functions without fixed‐points.Ilnur I. Batyrshin - 2006 - Mathematical Logic Quarterly 52 (6):595-601.
Well (and better) quasi-ordered transition systems.Parosh Aziz Abdulla - 2010 - Bulletin of Symbolic Logic 16 (4):457-515.
Elementary embedding between countable Boolean algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.
On quasi-amorphous sets.P. Creed & J. K. Truss - 2001 - Archive for Mathematical Logic 40 (8):581-596.
Strict core fuzzy logics and quasi-witnessed models.Marco Cerami & Francesc Esteva - 2011 - Archive for Mathematical Logic 50 (5-6):625-641.

Analytics

Added to PP
2013-12-01

Downloads
34 (#667,296)

6 months
2 (#1,687,048)

Historical graph of downloads
How can I increase my downloads?