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

Categories

Keywords

Reprint years

DOI

10.1002/malq.19950410309

Links

PhilArchive



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

External links

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

Borel quasi-orderings in subsystems of second-order arithmetic.Alberto Marcone - 1991 - Annals of Pure and Applied Logic 54 (3):265-291.
The set of better quasi orderings is ii1/2-complete (vol 41, pg 373, 1995).A. Marcone - 1995 - Mathematical Logic Quarterly 41 (4):574-574.
Belief Revision and Verisimilitude.Mark Ryan & Pierre-Yves Schobbens - 1995 - Notre Dame Journal of Formal Logic 36 (1):15-29.
The Order Types of Termination Orderings on Monadic Terms, Strings and Monadic Terms, Strings and Multisets.Ursula Martin & Elizabeth Scott - 1997 - Journal of Symbolic Logic 62 (2):624-635.
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.
Weak comparability of well orderings and reverse mathematics.Harvey M. Friedman & Jeffry L. Hirst - 1990 - Annals of Pure and Applied Logic 47 (1):11-29.
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.
Quasi-probability distribution for spin-1/2 particles.C. Chandler, L. Cohen, C. Lee, M. Scully & K. Wódkiewicz - 1992 - Foundations of Physics 22 (7):867-878.
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.
Fair social orderings.Marc Fleurbaey & F. Maniquet - unknown

Analytics

Added to PP
2013-12-01

Downloads
27 (#576,320)

6 months
2 (#1,240,909)

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

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