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

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
Keywords Better quasi ordering  II12‐completeness
Categories (categorize this paper)
DOI 10.1002/malq.19950410309
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 51,639
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Descriptive Set Theory.Richard Mansfield - 1981 - Journal of Symbolic Logic 46 (4):874-876.
Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Borel Quasi-Orderings in Subsystems of Second-Order Arithmetic.Alberto Marcone - 1991 - Annals of Pure and Applied Logic 54 (3):265-291.
Belief Revision and Verisimilitude.Mark Ryan & Pierre-Yves Schobbens - 1995 - Notre Dame Journal of Formal Logic 36 (1):15-29.
Elementary Embedding Between Countable Boolean Algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.
Normative Systems Represented by Boolean Quasi-Orderings.Jan Odelstad & Lars Lindahl - 2000 - Nordic Journal of Philosophical Logic 5 (2):161-174.
Fregean Hierarchies and Mathematical Explanation.Michael Detlefsen - 1988 - International Studies in the Philosophy of Science 3 (1):97 – 116.
The Metamathematics of Scattered Linear Orderings.P. Clote - 1989 - Archive for Mathematical Logic 29 (1):9-20.
A Recursion Principle for Linear Orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
A Coding of the Countable Linear Orderings.Patrick Dehornoy - 1990 - Studia Logica 49 (4):585 - 590.
Dynamic Choice Mechanisms.Ludwig von Auer - 1999 - Theory and Decision 46 (3):295-312.
Quasi-O-Minimal Structures.Oleg Belegradek, Ya'acov Peterzil & Frank Wagner - 2000 - Journal of Symbolic Logic 65 (3):1115-1132.

Analytics

Added to PP index
2013-12-01

Total views
20 ( #486,666 of 2,331,237 )

Recent downloads (6 months)
1 ( #589,741 of 2,331,237 )

How can I increase my downloads?

Downloads

My notes