A Note on Closed Degrees of Difficulty of the Medvedev Lattice
Copyright policy )A Note on Closed Degrees of Difficulty of the Medvedev Lattice
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.
- University of Siena Italy
Degree of difficulty, Degree of difficulty; Mass problem; Medvedev lattice; Recursive operator, Baire topology, filter, recursive operator, Other degrees and reducibilities in computability and recursion theory, Recursive operator, degree of difficulty, Mass problem, Medvedev lattice, mass problems
Degree of difficulty, Degree of difficulty; Mass problem; Medvedev lattice; Recursive operator, Baire topology, filter, recursive operator, Other degrees and reducibilities in computability and recursion theory, Recursive operator, degree of difficulty, Mass problem, Medvedev lattice, mass problems
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!