A Note on Closed Degrees of Difficulty of the Medvedev Lattice
โ Scribed by Caterina Bianchini; Andrea Sorbi
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 351 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
โฆ Synopsis
We 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.
๐ SIMILAR VOLUMES
Any nonvoid lattice of subspaces from R" is known to be a complete lattice, and hence it has a largest and smallest element. Here we show that for a specific class of subspaces also the converse is true. If this class has a largest and a smallest element, then it is a complete lattice. Within the co
We rework the foundations of the theory of differentially closed fields of characteristic zero in a geometric setting. The ''new'' axioms will say that if V is an irreducible variety and W is an irreducible subvariety of the appropriate torsor ลฝ . V projecting generically onto V, then W has a gener