id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
7m01bk15c0w	Liling Ko	Towards Finding a Lattice That Characterizes the >ω2-Fickle Recursively Enumerable Turing Degrees	2021		.txt	text/plain	229	10	60	Turing degrees (RT, ≤T), we do not in general know how to characterize the degrees d ε RT below which L can be bounded. We introduced a lattice-theoretic property called 3-directness to describe lattices that are no wider or taller than L7 and M3 .	cache/7m01bk15c0w.txt	txt/7m01bk15c0w.txt