Lattice Nonembeddings and Initial Segments of the Recursively Enumerable Degrees
暂无分享,去创建一个
[1] Alistair H. Lachlan. Embedding nondistributive lattices in the recursively enumerable degrees , 1972 .
[2] Jeanleah Mohrherr. A Refinement of Low n and High n for the R.E. Degrees , 1986, Math. Log. Q..
[3] Michael Stob,et al. Array nonrecursive sets and multiple permitting arguments , 1990 .
[4] Rod Downey. Notes on the O‴ priority method with special attention to density results , 1990 .
[5] Manuel Lerman,et al. Lattice embeddings into the recursively enumerable degrees. II , 1989, Journal of Symbolic Logic.
[6] Saharon Shelah,et al. The undecidability of the recursively enumerable degrees , 1982 .
[7] Rodney G. Downey,et al. Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part I: Density , 1989, Ann. Pure Appl. Log..
[8] Alistair H. Lachlan. Bounding Minimal Pairs , 1979, J. Symb. Log..
[9] Klaus Ambos-Spies,et al. Contiguous R.E. Degrees , 1984 .
[10] Peter A. Fejer. The density of the nonbranching degrees , 1983, Ann. Pure Appl. Log..
[11] Manuel Lerman,et al. Lattice embeddings into the recursively enumerable degrees , 1986, Journal of Symbolic Logic.