The following pages link to Joseph S. Ullian (Q591980):
Displayed 40 items.
- Almost universal cupping and diamond embeddings (Q408168) (← links)
- \(Q _{1}\)-degrees of c.e. sets (Q453193) (← links)
- Immunity properties and strong positive reducibilities (Q535145) (← links)
- (Q685062) (redirect page) (← links)
- Generic degrees are complemented (Q685063) (← links)
- There is no ordering on the classes in the generalized high/low hierarchies (Q818520) (← links)
- Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility (Q892147) (← links)
- Reducibilities among equivalence relations induced by recursively enumerable structures (Q896924) (← links)
- Degrees of difficulty of generalized r.e. separating classes (Q926177) (← links)
- On Lachlan's major sub-degree problem (Q943340) (← links)
- The realm of primitive recursion (Q1112020) (← links)
- The density of the low\(_ 2\) \(n\)-r.e. degrees (Q1179531) (← links)
- Partial degrees and \(r\)-degrees (Q1239158) (← links)
- (Q1295422) (redirect page) (← links)
- Dynamic notions of genericity and array noncomputability (Q1295423) (← links)
- Intuitionistic formal theories with realizability in subrecursive classes (Q1377631) (← links)
- Conjectures and questions from Gerald Sacks's \textit{Degrees of unsolvability} (Q1387091) (← links)
- Jumps of computably enumerable equivalence relations (Q1693042) (← links)
- Initial segments of the degrees of size \(\aleph _ 1\) (Q1820153) (← links)
- There is no fat orbit (Q1923566) (← links)
- Highness, locally noncappability and nonboundings (Q1944327) (← links)
- Maximal pairs of computably enumerable sets in the computably Lipschitz degrees (Q1946505) (← links)
- On \(1\)-degrees inside \(m\)-degrees (Q2062067) (← links)
- The structure of computably enumerable preorder relations (Q2213931) (← links)
- Computable numberings of families of infinite sets (Q2300737) (← links)
- Comparing the degrees of enumerability and the closed Medvedev degrees (Q2312080) (← links)
- Approximation of functions on the integers (Q2394922) (← links)
- Sequences in context free languages (Q2395865) (← links)
- A theorem on maximal sets (Q2526507) (← links)
- Three theorems concerning principal AFLs (Q2546302) (← links)
- Relatively about: Loose composites and loose ends (Q3323911) (← links)
- Splinters of recursive functions (Q3848973) (← links)
- (Q4066627) (← links)
- In Memoriam: Nelson Goodman 1906–1998 (Q4492747) (← links)
- The inherent ambiguity partial algorithm problem for context free languages (Q5402501) (← links)
- Ambiguity in context free languages (Q5514125) (← links)
- Preservation of unambiguity and inherent ambiguity in context-free languages (Q5518369) (← links)
- The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages (Q5534925) (← links)
- Partial algorithm problems for context free languages (Q5536634) (← links)
- Failure of a conjecture about context free languages (Q5653572) (← links)