Pages that link to "Item:Q2907064"

The following pages link to Embedding countable partial orderings in the enumeration degrees and the \(\omega \)-enumeration degrees (Q2907064):

Displaying 15 items.

• The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees (Q764275) (← links)
• Goodness in the enumeration and singleton degrees (Q992037) (← links)
• The jump operator on the \(\omega \)-enumeration degrees (Q1032630) (← links)
• \(\kappa\)-embeddings of ordered sets (Q1110545) (← links)
• Limit lemmas and jump inversion in the enumeration degrees (Q1407609) (← links)
• Embedding of countable orders in Turing degrees (Q1810239) (← links)
• The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent (Q1944337) (← links)
• Least enumerations of partial structures (Q2907051) (← links)
• A note on initial segments of the enumeration degrees (Q2921013) (← links)
• Enumeration Reducibility and Computable Structure Theory (Q2970965) (← links)
• (Q3607635) (← links)
• Jump embeddings in the Turing degrees (Q3984430) (← links)
• ω‐operations over partial enumerated sets (Q4304791) (← links)
• The  -Enumeration Degrees (Q5441128) (← links)
• Ivan Soskov: a life in computability (Q6599282) (← links)