scientific article; zbMATH DE number 1302875
From MaRDI portal
Publication:4249361
algorithmic dimensionautostabilitycomputable isomorphismrecursive isomorphismreducibility of constructivizationssurvey
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computable structure theory, computable model theory (03C57) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)
Recommendations
- scientific article; zbMATH DE number 4145883
- scientific article; zbMATH DE number 749929
- Some properties of autostable models
- scientific article; zbMATH DE number 1534486
- The dimension of stability of stochastic automata
- scientific article; zbMATH DE number 804044
- A description of autostable models
- Polynomial-time computable stable models
- Stability versus speed in a computable algebraic model
- Constructive models of regularly infinite algorithmic dimension
Cited in
(13)- Degree spectra of relations on structures of finite computable dimension
- On decidable categoricity and almost prime models
- Degrees of categoricity of computable structures
- A description of autostable models
- Computable categoricity of trees of finite height
- scientific article; zbMATH DE number 4145883 (Why is no real title available?)
- scientific article; zbMATH DE number 4162869 (Why is no real title available?)
- scientific article; zbMATH DE number 749929 (Why is no real title available?)
- Automata-Based Computation of Temporal Equilibrium Models
- scientific article; zbMATH DE number 1405578 (Why is no real title available?)
- Categoricity properties for computable algebraic fields
- The given
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249361)
