Pages that link to "Item:Q1156793"
From MaRDI portal
The following pages link to Recursion theory on fields and abstract dependence (Q1156793):
Displaying 21 items.
- Recursive properties of relations on models (Q687281) (← links)
- Dependence relations in computably rigid computable vector spaces (Q703839) (← links)
- On the learnability of vector spaces (Q859986) (← links)
- First-order theories of abstract dependence relations (Q1073012) (← links)
- Intersections of algebraically closed fields (Q1076073) (← links)
- Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures (Q1083446) (← links)
- Recursion theory and ordered groups (Q1093630) (← links)
- An infinite version of Arrow's theorem in the effective setting (Q1108914) (← links)
- Nonpresentability of some structures of analysis in hereditarily finite superstructures (Q1644856) (← links)
- Dependency relations (Q2011325) (← links)
- A sufficient condition for nonpresentability of structures in hereditarily finite superstructures (Q2364328) (← links)
- Ideals in computable rings (Q2456205) (← links)
- Learning Families of Closed Sets in Matroids (Q2891307) (← links)
- Reverse Mathematics of Matroids (Q2970956) (← links)
- Orbits of Creative Subspaces (Q3028998) (← links)
- More undecidable lattices of Steinitz exchange systems (Q3149998) (← links)
- Automorphisms of supermaximal subspaces (Q3689174) (← links)
- Co-immune subspaces and complementation in<i>V</i><sub>∞</sub> (Q3701412) (← links)
- Decidable subspaces and recursively enumerable subspaces (Q3710516) (← links)
- Bases of supermaximal subspaces and Steinitz systems. I (Q3710517) (← links)
- The universal complementation property (Q3718696) (← links)
