Abstract
AbstractWe examine the concepts of nowhere simplicity in a wide class of abstract dependence systems. Initially we examine how many of the existing results valid for L(ω), the lattice of r.e. sets, have analogues valid for more general lattices. For example, we show that any r. e. subspace of V∞ can be decomposed into a pair of nowhere simple subspaces.
Publisher
Cambridge University Press (CUP)
Subject
General Mathematics,Statistics and Probability
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Lattice of Computably Enumerable Vector Spaces;Computability and Complexity;2016-12-01
2. Reverse Mathematics of Matroids;Computability and Complexity;2016-12-01
3. On the complexity of inductive definitions;Mathematical Structures in Computer Science;2006-10
4. Chapter 15 Computable algebras and closure systems: Coding properties;Studies in Logic and the Foundations of Mathematics;1998
5. Chapter 11 A bibliography of recursive algebra and recursive model theory;Handbook of Recursive Mathematics - Volume 1: Recursive Model Theory;1998