The following pages link to (Q4677692):
Displaying 31 items.
- Computable numberings of families of low sets and Turing jumps in the Ershov hierarchy (Q542199) (← links)
- The branching theorem and computable categoricity in the Ershov hierarchy (Q887636) (← links)
- Effectively closed sets and enumerations (Q926187) (← links)
- The number of nonequivalent computable indexations for a fixed family of sets (Q1317638) (← links)
- Positive presentations of families relative to \(e\)-oracles (Q1617982) (← links)
- Classifications of computable structures (Q1704081) (← 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)
- 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)
- Theories of Rogers semilattices of analytical numberings (Q2030131) (← links)
- On universal pairs in the Ershov hierarchy (Q2221958) (← links)
- Computable numberings of families of infinite sets (Q2300737) (← links)
- Classifications of definable subsets (Q2300934) (← links)
- Rogers semilattices for families of equivalence relations in the Ershov hierarchy (Q2313294) (← links)
- Reductions between types of numberings (Q2326424) (← links)
- Rogers semilattices with least and greatest elements in the Ershov hierarchy (Q2680581) (← links)
- An infinite family of \(\Sigma_a^{-1}\)-sets with a unique computable numbering (Q2899010) (← links)
- Almost computably enumerable families of sets (Q3600774) (← links)
- A decomposition of the Rogers semilattice of a family of d.c.e. sets (Q3630582) (← links)
- Enumerations of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Π</mml:mi><mml:mn>1</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:math> Classes: Acceptability and Decid (Q4921447) (← links)
- (Q4973206) (← links)
- Rogers semilattices of punctual numberings (Q5048010) (← links)
- Friedberg Numbering in Fragments of Peano Arithmetic and <i>α</i>-Recursion Theory (Q5407044) (← links)
- On the existence of universal numberings for finite families of d.c.e. sets (Q5419207) (← 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)
- Two theorems on minimal generalized computable numberings (Q6052274) (← links)
- Rogers semilattices of limitwise monotonic numberings (Q6094148) (← links)
