Finite Condensations of Recursive Linear Orders

The complexity of a Pi₄ set of natural numbers is encoded into a linear order to show that the finite condensation of a recursive linear order can be Pi₂ - Pi₁. A priority argument establishes the same result, and is extended to a complete classification of finite condensations iterated finitely man...

Full description

Saved in:
Bibliographic Details
Published in:Studia logica 1988-12, Vol.47 (4), p.311-317
Main Authors: Roy, Dev K., Watnick, Richard
Format: Article
Language:English
Subjects:
Condensation
Logical theorems
Mathematical theorems
Plant roots
Priority arguments
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The complexity of a Pi₄ set of natural numbers is encoded into a linear order to show that the finite condensation of a recursive linear order can be Pi₂ - Pi₁. A priority argument establishes the same result, and is extended to a complete classification of finite condensations iterated finitely many times.
ISSN:0039-3215
1572-8730
DOI:10.1007/BF00671562