Article contents
Countable structures of given age
Published online by Cambridge University Press: 12 March 2014
Abstract
Let L be a finite relational language. The age of a structure over L is the set of isomorphism types of finite substructures of . We classify those ages for which there are less than 2ω countably infinite pairwise nonisomorphic L-structures of age .
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1992
References
REFERENCES
- 4
- Cited by