Conjectures and questions from Gerald Sacks's Degrees of Unsolvability.
- Published in:
- Archive for Mathematical Logic, 1997, v. 36, n. 4/5, p. 233, doi. 10.1007/s001530050063
- By:
- Publication type:
- Article
Works matching IS 09335846 AND DT 1997 AND VI 36 AND IP 4/5
Results: 8
1
2
Definability in the enumeration degrees.
- Published in:
- Archive for Mathematical Logic, 1997, v. 36, n. 4/5, p. 255, doi. 10.1007/s001530050064
- By:
- Publication type:
- Article
3
Closing the gap between the continuous functionals and recursion in...
- Published in:
- Archive for Mathematical Logic, 1997, v. 36, n. 4/5, p. 269, doi. 10.1007/s001530050065
- By:
- Publication type:
- Article
4
Relativized projecta and ...-r.e. sets.
- Published in:
- Archive for Mathematical Logic, 1997, v. 36, n. 4/5, p. 289, doi. 10.1007/s001530050066
- By:
- Publication type:
- Article
5
Iterated trees of strategies and priority arguments.
- Published in:
- Archive for Mathematical Logic, 1997, v. 36, n. 4/5, p. 297, doi. 10.1007/s001530050067
- By:
- Publication type:
- Article
6
Rank, join, and Cantor singletons.
- Published in:
- Archive for Mathematical Logic, 1997, v. 36, n. 4/5, p. 313, doi. 10.1007/s001530050068
- By:
- Publication type:
- Article
7
On the parameterized complexity of short computation and factorization.
- Published in:
- Archive for Mathematical Logic, 1997, v. 36, n. 4/5, p. 321, doi. 10.1007/s001530050069
- By:
- Publication type:
- Article
8
Nonmonotonic rule systems with recursive sets of restraints.
- Published in:
- Archive for Mathematical Logic, 1997, v. 36, n. 4/5, p. 339, doi. 10.1007/s001530050070
- By:
- Publication type:
- Article