A Note on Closed Degrees of Difficulty of the Medvedev Lattice
作者:
Caterina Bianchini,
Andrea Sorbi,
期刊:
Mathematical Logic Quarterly
(WILEY Available online 1996)
卷期:
Volume 42,
issue 1
页码: 127-133
ISSN:0942-5616
年代: 1996
DOI:10.1002/malq.19960420111
出版商: WILEY‐VCH Verlag Berlin GmbH
关键词: Medvedev lattice;Recursive operator;Mass problem;Degree of difficulty
数据来源: WILEY
摘要:
AbstractWe consider some nonprincipal filters of the Medvedev lattice. We prove that the filter generated by the nonzero closed degrees of difficulty is not principal and we compare this filter, with respect to inclusion, with some other filters of the lattice. All the filters considered in this paper are disjoint from the prime ideal generated by the dense degrees of difficulty.Mathematics Subject Classification:03D30.
点击下载:
PDF
(350KB)
返 回