The number of computable indexations of finite classes of constructive models
From MaRDI portal
In this paper we show that a computable class with finitely many constructive models can have either a unique computable indexation (up to equivalence) or infinitely many of them.
Recommendations
- Computability of the set of computable indexing schemes of the class of constructible models
- Computable classes of constructive models with non-limit-equivalent indexations
- scientific article; zbMATH DE number 4053597
- scientific article; zbMATH DE number 4101163
- Semilattices of computable indexations of classes of constructive models
- Conditions of effective infinity for the set of computable indexings of a class of constructive models
- Complexity of index sets of calculable classes with a finite number of constructive systems
- Computable classes of constructivizations for models of finite constructivizability type
- scientific article; zbMATH DE number 16546
- scientific article; zbMATH DE number 3853049
Cited in
(6)- The number of nonequivalent computable indexations for a fixed family of sets
- Computable classes of constructive models with non-limit-equivalent indexations
- A.D. Taimanov and model theory in Kazakhstan
- scientific article; zbMATH DE number 5379427 (Why is no real title available?)
- scientific article; zbMATH DE number 4035802 (Why is no real title available?)
- scientific article; zbMATH DE number 6262009 (Why is no real title available?)
This page was built for publication: The number of computable indexations of finite classes of constructive models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580331)
