Abstract

In this paper we prove that the set of countable bqos (viewed as a subset of the Cantor space) is Pi^1_2-complete. The notion of bqo or better quasi-ordering arises from combinatorics and is a generalization of the canonical example of a Pi^1_1-complete notion, i.e. that of countable well-ordering. The Pi^1_2-completeness of bqo was conjectured by Clote and proved by the author in his Ph.d. thesis: in this paper we prove it using Simpson's definition of bqo and as little bqo theory as possible.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.