Pages that link to "Item:Q1210351"
From MaRDI portal
The following pages link to Some effectively infinite classes of enumerations (Q1210351):
Displaying 10 items.
- Effectively closed sets and enumerations (Q926187) (← links)
- An infinite version of the Pólya enumeration theorem (Q1205609) (← links)
- The Rogers semilattices of generalized computable enumerations (Q1745093) (← links)
- Effectively infinite classes of enumerations (Q1920071) (← links)
- A unique positive enumeration (Q1920098) (← links)
- Effectively infinite classes of numberings of computable families of reals (Q6086824) (← links)
- Effectively infinite classes of numberings and computable families of reals (Q6146823) (← links)
- On the embedding of the first nonconstructive ordinal in the Rogers semilattices (Q6169441) (← links)
- A family with a single minimal but not least numbering (Q6203338) (← links)
- Effectively infinite classes of numberings and fixed point theorems (Q6587480) (← links)