Computable classes of constructivizations for models of infinite algorithmic dimension
From MaRDI portal
Recommendations
Cites work
Cited in
(9)- The Complexity of Infinite Computations In Models of Set Theory
- scientific article; zbMATH DE number 4217338 (Why is no real title available?)
- scientific article; zbMATH DE number 4093434 (Why is no real title available?)
- scientific article; zbMATH DE number 1534360 (Why is no real title available?)
- A solution of the Goncharov-Ash problem and the spectrum problem in the theory of computable models.
- Computable classes of constructivizations for models of finite constructivizability type
- scientific article; zbMATH DE number 4164817 (Why is no real title available?)
- Computability and universal determinability of negatively representable models
- Constructive models of regularly infinite algorithmic dimension
This page was built for publication: Computable classes of constructivizations for models of infinite algorithmic dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346928)