The following pages link to Creative sets (Q5848891):
Displaying 50 items.
- Bounded enumeration reducibility and its degree structure (Q661285) (← links)
- Irreducible, singular, and contiguous degrees (Q683370) (← links)
- Computing degrees of unsolvability (Q770790) (← links)
- Recursive digraphs, splinters and cylinders (Q771093) (← links)
- Collapsing degrees (Q1109766) (← links)
- Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I (Q1140636) (← links)
- On p-creative sets and p-completely creative sets (Q1183565) (← links)
- Bibliography of John Myhill (Q1192339) (← links)
- Myhill's work in recursion theory (Q1192344) (← links)
- On \(sQ\)-completeness of recursively enumerable sets (Q1316903) (← links)
- Classes bounded by incomplete sets (Q1602854) (← links)
- Recursion-theoretic ranking and compression (Q1713478) (← links)
- Elementary theories and hereditary undecidability for semilattices of numberings (Q1734277) (← links)
- On the expressiveness of choice quantification (Q1874242) (← links)
- On \(1\)-degrees inside \(m\)-degrees (Q2062067) (← links)
- The use of lists in the study of undecidable problems in automata theory (Q2551463) (← links)
- Completeness criteria for a class of reducibilities (Q2688337) (← links)
- On a general method of constructing post reducibilities and the corresponding completeness criteria (Q2700039) (← links)
- From Turing machines to computer viruses (Q2941590) (← links)
- A Survey on Universal Computably Enumerable Equivalence Relations (Q2970971) (← links)
- Introduction to Autoreducibility and Mitoticity (Q2973718) (← links)
- Orbits of Creative Subspaces (Q3028998) (← links)
- R. e. presented linear orders (Q3039336) (← links)
- Kleene's Amazing Second Recursion Theorem (Q3161629) (← links)
- Asymptotic density, immunity and randomness (Q3195648) (← links)
- Creativeness and completeness in recursion categories of partial recursive operators (Q3199409) (← links)
- Degrees of unsolvability associated with classes of formalized theories (Q3243263) (← links)
- Some Theorems on Classes of Recursively Enumerable Sets (Q3255349) (← links)
- Gödel numberings of partial recursive functions (Q3260572) (← links)
- Recursive Functions Over Well Ordered Partial Orderings (Q3272473) (← links)
- Hyperarithmetical Sets (Q3305318) (← links)
- Classifying positive equivalence relations (Q3309827) (← links)
- RELATIVIZING CHAITIN'S HALTING PROBABILITY (Q3379458) (← links)
- Kleene’s Amazing Second Recursion Theorem (Q3644738) (← links)
- Splinters of recursive functions (Q3848973) (← links)
- Deficiency Sets and Bounded Information Reducibilities (Q3895447) (← links)
- Stateless turing machines and fixed points (Q3922176) (← links)
- Recursion theory on orderings. I. A model theoretic setting (Q3924184) (← links)
- Recursion theory on orderings. II (Q3924185) (← links)
- A note on context free languages, complexity classes, and diagonalization (Q3928245) (← links)
- A survey of one-way functions in complexity theory (Q4009812) (← links)
- Sequences Having an Effective Fixed-Point Property (Q4081222) (← links)
- The recursive sets in certain monadic second order fragments of arithmetic (Q4088807) (← links)
- Recursively enumerable sets and degrees (Q4184825) (← links)
- Quantifying over propositions in relevance logic: nonaxiomatisability of primary interpretations of ∀<i>p</i> and ∃<i>p</i> (Q5287696) (← links)
- Every polynomial-time 1-degree collapses if and only if P = PSPACE (Q5311749) (← links)
- A Note on Bounded-Truth-Table Reducibility (Q5328148) (← links)
- Report on attainability of systems of identities (Q5340944) (← links)
- Extensions of the constructive ordinals (Q5344168) (← links)
- On the indexing of classes of recursively enumerable sets (Q5518359) (← links)