id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
pr76f19199j	Rose Weisshaar	Some Results in Computability Theory	2019		.txt	text/plain	227	8	52	Further, we indicate some circumstances in which, given computable ω-branching trees T0 and T1, a path through TKP helps the paths through T0 compute paths through T1.In a different line of work, we consider effective forcing notions. In particular, we define a class of effective forcing notions that are similar to versions of Mathias forcing and Cohen forcing defined in the literature, and prove some results about how these notions relate.	cache/pr76f19199j.txt	txt/pr76f19199j.txt