The following pages link to (Q4934289):
Displaying 50 items.
- Reducibilities among equivalence relations induced by recursively enumerable structures (Q896924) (← links)
- Effectively closed sets and enumerations (Q926187) (← links)
- On the classification of (effective) \(\varphi \)-spaces (Q1023292) (← links)
- Universal generalized computable numberings and hyperimmunity (Q1703271) (← links)
- Some absolute properties of \(A\)-computable numberings (Q1731521) (← links)
- Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277) (← links)
- The Rogers semilattices of generalized computable enumerations (Q1745093) (← links)
- Strong reducibility of partial numberings (Q1766927) (← links)
- Peano's concept of number (Q1846407) (← links)
- Amount of nonconstructivity in deterministic finite automata (Q1959651) (← links)
- Outline of partial computability in computable topology (Q2011636) (← links)
- Theories of Rogers semilattices of analytical numberings (Q2030131) (← links)
- Absolute and relative properties of negatively numbered families (Q2030136) (← links)
- Precomplete numberings (Q2036469) (← links)
- On the degrees of constructively immune sets (Q2117765) (← links)
- The fixed-point property for represented spaces (Q2120973) (← links)
- On \(p \)-universal and \(p \)-minimal numberings (Q2123092) (← links)
- Completeness of the hyperarithmetic isomorphism equivalence relation (Q2143655) (← links)
- Computable reducibility of metrics on the reals (Q2165612) (← links)
- Classifying equivalence relations in the Ershov hierarchy (Q2204368) (← links)
- Completion of choice (Q2220486) (← links)
- Learnability and positive equivalence relations (Q2232273) (← links)
- On computably enumerable structures (Q2263114) (← links)
- On the degree structure of equivalence relations under computable reducibility (Q2295742) (← links)
- Weakly precomplete equivalence relations in the Ershov hierarchy (Q2300735) (← links)
- Reductions between types of numberings (Q2326424) (← links)
- Generalized computable universal numberings (Q2342326) (← links)
- Graphs realised by r.e. equivalence relations (Q2349100) (← links)
- Minimal generalized computable enumerations and high degrees (Q2400746) (← links)
- Effective categoricity for distributive lattices and Heyting algebras (Q2404797) (← links)
- Inductive inference and computable numberings (Q2430009) (← links)
- Effectivity questions for Kleene's recursion theorem (Q2636408) (← links)
- Minimal generalized computable numberings and families of positive preorders (Q2680579) (← links)
- Computability and universal determinability of negatively representable models (Q2688330) (← links)
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets (Q2700822) (← links)
- Rice’s Theorem in Effectively Enumerable Topological Spaces (Q3195700) (← links)
- CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS (Q3347868) (← links)
- On a Question of Frank Stephan (Q3502666) (← links)
- Numberings and Randomness (Q3576037) (← links)
- Program Self-reference in Constructive Scott Subdomains (Q3576041) (← links)
- Equivalence Relations on Classes of Computable Structures (Q3576052) (← links)
- Amount of Nonconstructivity in Finite Automata (Q3637360) (← links)
- Computable elements and functions in effectively enumerable topological spaces (Q4593240) (← links)
- A Friedberg enumeration of equivalence structures (Q4596664) (← 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)
- Computability of Subsets of Metric Spaces (Q5024568) (← links)
- Rogers semilattices of punctual numberings (Q5048010) (← links)
- ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS (Q5107218) (← links)
- WEIHRAUCH GOES BROUWERIAN (Q5858925) (← links)
- One note on positive A-computable numberings (Q5876870) (← links)
