Pages that link to "Item:Q1346928"
From MaRDI portal
The following pages link to Computable classes of constructivizations for models of infinite algorithmic dimension (Q1346928):
Displaying 6 items.
- Computable classes of constructivizations for models of finite constructivizability type (Q1335930) (← links)
- A solution of the Goncharov-Ash problem and the spectrum problem in the theory of computable models. (Q1432219) (← links)
- Constructive models of regularly infinite algorithmic dimension (Q1842380) (← links)
- Computability and universal determinability of negatively representable models (Q2688330) (← links)
- (Q3362714) (← links)
- The Complexity of Infinite Computations In Models of Set Theory (Q3401139) (← links)