Recursive categoricity and persistence
From MaRDI portal
Recommendations
- A decidable countably categorical model without nontrivial recursive automorphisms
- Nonarithmetical ℵ0-categorical theories with recursive models
- The degrees of categorical theories with recursive models
- A decidable Ehrenfeucht theory with exactly two hyperarithmetic models
- Constructive models of uncountably categorical theories
- Precomplete Equivalence Relations in Dominical Categories
- Automorphism groups of decidable models
- Creativeness and completeness in recursion categories of partial recursive operators
- Remarks on combinatorial and accessible model categories
- scientific article; zbMATH DE number 554978
Cited in
(14)- Computable isomorphisms, degree spectra of relations, and Scott families
- Degree spectra and computable dimensions in algebraic structures
- The index set of the groups autostable relative to strong constructivizations
- Effective categoricity of equivalence structures
- An existence theorem for recursion categories
- scientific article; zbMATH DE number 3950509 (Why is no real title available?)
- scientific article; zbMATH DE number 4105024 (Why is no real title available?)
- Degree Spectra of Relations on Computable Structures
- A computably categorical structure whose expansion by a constant has infinite computable dimension
- Categorical characterizations of the natural numbers require primitive recursion
- Simple confluently persistent catenable lists
- scientific article; zbMATH DE number 3892199 (Why is no real title available?)
- CATEGORICAL HARMONY AND PATH INDUCTION
- Computable isomorphisms of Boolean algebras with operators
This page was built for publication: Recursive categoricity and persistence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3767330)
