The following pages link to (Q2709299):
Displayed 29 items.
- Positive undecidable numberings in the Ershov hierarchy (Q695803) (← links)
- Characterizing programming systems allowing program self-reference (Q733737) (← links)
- 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)
- Positive presentations of families in relation to reducibility with respect to enumerability (Q1731525) (← links)
- Computability theory. Abstracts from the workshop held January 7--13, 2018 (Q1731969) (← links)
- Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277) (← links)
- The Rogers semilattices of generalized computable enumerations (Q1745093) (← links)
- Properties of numberings in various levels of the Ershov hierarchy (Q1948664) (← links)
- Infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering (Q1948665) (← links)
- Friedberg numberings of families of partial computable functionals (Q2003244) (← links)
- Lattice properties of Rogers semilattices of compuatble and generalized computable families (Q2285202) (← links)
- Weakly precomplete equivalence relations in the Ershov hierarchy (Q2300735) (← links)
- Computable numberings of families of infinite sets (Q2300737) (← links)
- Khutoretskii's theorem for generalized computable families (Q2300906) (← links)
- Rogers semilattices for families of equivalence relations in the Ershov hierarchy (Q2313294) (← links)
- Reductions between types of numberings (Q2326424) (← links)
- Families without minimal numberings (Q2342320) (← links)
- Generalized computable universal numberings (Q2342326) (← links)
- Universal computable enumerations of finite classes of families of total functions (Q2363401) (← links)
- Embeddability of the semilattice \(L_m^0\) in Rogers semilattices (Q2364326) (← links)
- Minimal generalized computable enumerations and high degrees (Q2400746) (← links)
- Effective categoricity for distributive lattices and Heyting algebras (Q2404797) (← links)
- Rogers semilattices of families of two embedded sets in the Ershov hierarchy (Q2910992) (← links)
- Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings (Q5741390) (← links)
- Friedberg numberings in the Ershov hierarchy (Q5899647) (← links)
- Friedberg numberings in the Ershov hierarchy (Q5919177) (← links)