Pages that link to "Item:Q2342326"
From MaRDI portal
The following pages link to Generalized computable universal numberings (Q2342326):
Displaying 18 items.
- Ideals without minimal elements in Rogers semilattices (Q903180) (← links)
- Positive presentations of families relative to \(e\)-oracles (Q1617982) (← links)
- Universal generalized computable numberings and hyperimmunity (Q1703271) (← links)
- Some absolute properties of \(A\)-computable numberings (Q1731521) (← links)
- The Rogers semilattices of generalized computable enumerations (Q1745093) (← links)
- Weak reducibility of computable and generalized computable numberings (Q2033333) (← links)
- On \(p \)-universal and \(p \)-minimal numberings (Q2123092) (← links)
- Positive numberings in admissible sets (Q2191379) (← links)
- Some properties of the upper semilattice of computable families of computably enumerable sets (Q2246822) (← links)
- Lattice properties of Rogers semilattices of compuatble and generalized computable families (Q2285202) (← links)
- Khutoretskii's theorem for generalized computable families (Q2300906) (← links)
- Universal computable enumerations of finite classes of families of total functions (Q2363401) (← links)
- Minimal generalized computable numberings and families of positive preorders (Q2680579) (← links)
- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) (Q2693002) (← links)
- One note on positive A-computable numberings (Q5876870) (← links)
- Two theorems on minimal generalized computable numberings (Q6052274) (← links)
- Extremal numberings and fixed point theorems (Q6094162) (← links)
- On Non-principal Arithmetical Numberings and Families (Q6489320) (← links)