Switch to: References

Citations of:

Linear Order Types of Nonrecursive Presentability

Mathematical Logic Quarterly 31 (31-34):495-501 (1985)

Add citations

You must login to add citations.

Finite condensations of recursive linear orders.Dev K. Roy & Richard Watnick - 1988 - Studia Logica 47 (4):311 - 317.details The complexity of aII 4 set of natural numbers is encoded into a linear order to show that the finite condensation of a recursive linear order can beII 2–II 1. A priority argument establishes the same result, and is extended to a complete classification of finite condensations iterated finitely many times. Logic and Philosophy of Logic Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic Direct download (4 more) Export citation Bookmark
Weakly semirecursive sets and r.e. orderings.Martin Kummer & Frank Stephan - 1993 - Annals of Pure and Applied Logic 60 (2):133-150.details Weakly semirecursive sets have been introduced by Jockusch and Owings . In the present paper their investigation is pushed forward by utilizing r.e. partial orderings, which turn out to be instrumental for the study of degrees of subclasses of weakly semirecursive sets. Logic and Philosophy of Logic Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic Model Theory in Logic and Philosophy of Logic Direct download (4 more) Export citation Bookmark

1