Generations of generative classes

We study generating sets of diagrams for generative classes. The generative classes appeared solving a series of model-theoretic problems. They are divided into semantic and syntactic ones. The fists ones are witnessed by well-known Frasse constructions and Hrushovski constructions. Syntactic genera...

Full description

Bibliographic Details
Main Author: S.V. Sudoplatov
Format: Article
Language:English
Published: Irkutsk State University 2017-12-01
Series:Известия Иркутского государственного университета: Серия "Математика"
Subjects:
Online Access:http://mathizv.isu.ru/journal/downloadArticle?article=_4708bb538d7b4145a1a753956169182a&lang=eng
id doaj-eedfdde30cd34987b3dee404c20c426b
record_format Article
spelling doaj-eedfdde30cd34987b3dee404c20c426b2020-11-25T01:47:53ZengIrkutsk State UniversityИзвестия Иркутского государственного университета: Серия "Математика" 1997-76702541-87852017-12-01221106117https://doi.org/10.26516/1997-7670.2017.22.106Generations of generative classesS.V. SudoplatovWe study generating sets of diagrams for generative classes. The generative classes appeared solving a series of model-theoretic problems. They are divided into semantic and syntactic ones. The fists ones are witnessed by well-known Frasse constructions and Hrushovski constructions. Syntactic generative classes and syntactic generic constructions were introduced by the author. They allow to consider any ω-homogeneous structure as a generic limit of diagrams over finite sets. Therefore any elementary theory is represented by some their generic models. Moreover, an information written by diagrams is realized in these models. We consider generic constructions both in general case and with some natural restrictions, in particular, with the self-sufficiency property. We study the dominating relation and domination-equivalence for generative classes. These relations allow to characterize the finiteness of generic structure reducing the construction of generic structures to maximal diagrams. We also have that a generic structure is finite if and only if given generative class is finitely generated, i.e., all diagrams of this class are reduced to copying of some finite set of diagrams. It is shown that a generative class without maximal diagrams is countably generated, i.e., reduced to some at most countable set of diagrams if and only if there is a countable generic structure. And the uncountable generation is equivalent to the absence of generic structures or to the existence only uncountable generative structures.http://mathizv.isu.ru/journal/downloadArticle?article=_4708bb538d7b4145a1a753956169182a&lang=enggenerative classgeneric structuregeneration of generative class
collection DOAJ
language English
format Article
sources DOAJ
author S.V. Sudoplatov
spellingShingle S.V. Sudoplatov
Generations of generative classes
Известия Иркутского государственного университета: Серия "Математика"
generative class
generic structure
generation of generative class
author_facet S.V. Sudoplatov
author_sort S.V. Sudoplatov
title Generations of generative classes
title_short Generations of generative classes
title_full Generations of generative classes
title_fullStr Generations of generative classes
title_full_unstemmed Generations of generative classes
title_sort generations of generative classes
publisher Irkutsk State University
series Известия Иркутского государственного университета: Серия "Математика"
issn 1997-7670
2541-8785
publishDate 2017-12-01
description We study generating sets of diagrams for generative classes. The generative classes appeared solving a series of model-theoretic problems. They are divided into semantic and syntactic ones. The fists ones are witnessed by well-known Frasse constructions and Hrushovski constructions. Syntactic generative classes and syntactic generic constructions were introduced by the author. They allow to consider any ω-homogeneous structure as a generic limit of diagrams over finite sets. Therefore any elementary theory is represented by some their generic models. Moreover, an information written by diagrams is realized in these models. We consider generic constructions both in general case and with some natural restrictions, in particular, with the self-sufficiency property. We study the dominating relation and domination-equivalence for generative classes. These relations allow to characterize the finiteness of generic structure reducing the construction of generic structures to maximal diagrams. We also have that a generic structure is finite if and only if given generative class is finitely generated, i.e., all diagrams of this class are reduced to copying of some finite set of diagrams. It is shown that a generative class without maximal diagrams is countably generated, i.e., reduced to some at most countable set of diagrams if and only if there is a countable generic structure. And the uncountable generation is equivalent to the absence of generic structures or to the existence only uncountable generative structures.
topic generative class
generic structure
generation of generative class
url http://mathizv.isu.ru/journal/downloadArticle?article=_4708bb538d7b4145a1a753956169182a&lang=eng
work_keys_str_mv AT svsudoplatov generationsofgenerativeclasses
_version_ 1725014231772823552