No label defined (Q3343973)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3878912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3878912 |
Statements
1983
0 references
vector spaces
0 references
recursively presented matroid
0 references
closed sets
0 references
0.7390045523643494
0 references
0.7347443699836731
0 references
0.7192423343658447
0 references
0.7186381816864014
0 references
[For the entire collection see Zbl 0532.00005.] From the introduction: ''The present paper is sequel to the first part [Patras Logic Symposion, Proc., Patras/Greece 1980, Stud. Logic Found. Math. 109, 41-65 (1982; Zbl 0526.03026)] and carries further the program of isolating those algebraic properties of matroids leading to recursion theoretic phenomena. There are seven theorems, each producing a recursion theoretic phenomenon in a recursively presented matroid from a weak algebraic assumption about the matroid. These concern non-extendible maximal closed sets (theorem 1), non-extendible nowhere simple closed sets (theorem 2), non-extendible closed sets which are recursive as closed sets (theorem 3), supermaximal closed sets (theorem 4), controlling dependence degrees of supermaximal closed sets (theorem 5), controlling dependence degrees of non- automorphic supermaximal closed sets (theorem 6), incomparable many-one degrees of \({\mathcal D}(V)_ i\) (theorem 7).''
0 references