Families of language uniform theories and their generating sets

We introduce the notion of language uniform theory and study topological properties related to families of language uniform theory and their E-combinations. It is shown that the class of language uniform theories is broad enough. Sufficient conditions for the language similarity of language uniform...

Full description

Bibliographic Details
Main Author: S. Sudoplatov
Format: Article
Language:English
Published: Irkutsk State University 2016-09-01
Series:Известия Иркутского государственного университета: Серия "Математика"
Subjects:
Online Access:http://isu.ru/journal/downloadArticle?article=_302d15456f5446af965b72a7fa08b868&lang=eng
id doaj-ffec792528c747f5a3770d30085d21ef
record_format Article
spelling doaj-ffec792528c747f5a3770d30085d21ef2020-11-24T23:08:39ZengIrkutsk State UniversityИзвестия Иркутского государственного университета: Серия "Математика" 1997-76702541-87852016-09-011716276Families of language uniform theories and their generating setsS. SudoplatovWe introduce the notion of language uniform theory and study topological properties related to families of language uniform theory and their E-combinations. It is shown that the class of language uniform theories is broad enough. Sufficient conditions for the language similarity of language uniform theories are found. Properties of language domination and of infinite language domination are studied. A characterization for E-closure of a family of language uniform theories in terms of index sets is found. We consider the class of linearly ordered families of language uniform theories and apply that characterization for this special case. The properties of discrete and dense index sets are investigated: it is shown that a discrete index set produces a least generating set whereas a dense index set implies at least continuum many accumulation points and the closure without the least generating set. In particular, having a dense index set the theory of the E-combination does not have $e$-least models and it is not small. Using the dichotomy for discrete and dense index sets we solve the problem of the existence of least generating set with respect to $E$-combinations and characterize that existence in terms of orders. Values for $e$-spectra of families of language uniform theories are obtained. It is shown that any $e$-spectrum can be realized by $E$-combination of language uniform theories. Low estimations for $e$-spectra relative to cardinalities of language are found. It is shown that families of language uniform theories produce an arbitrary given Cantor-Bendixson rank and given degree with respect to this rank.http://isu.ru/journal/downloadArticle?article=_302d15456f5446af965b72a7fa08b868&lang=engE-combinationP-combinationclosure operatorgenerating setlanguage uniform theory
collection DOAJ
language English
format Article
sources DOAJ
author S. Sudoplatov
spellingShingle S. Sudoplatov
Families of language uniform theories and their generating sets
Известия Иркутского государственного университета: Серия "Математика"
E-combination
P-combination
closure operator
generating set
language uniform theory
author_facet S. Sudoplatov
author_sort S. Sudoplatov
title Families of language uniform theories and their generating sets
title_short Families of language uniform theories and their generating sets
title_full Families of language uniform theories and their generating sets
title_fullStr Families of language uniform theories and their generating sets
title_full_unstemmed Families of language uniform theories and their generating sets
title_sort families of language uniform theories and their generating sets
publisher Irkutsk State University
series Известия Иркутского государственного университета: Серия "Математика"
issn 1997-7670
2541-8785
publishDate 2016-09-01
description We introduce the notion of language uniform theory and study topological properties related to families of language uniform theory and their E-combinations. It is shown that the class of language uniform theories is broad enough. Sufficient conditions for the language similarity of language uniform theories are found. Properties of language domination and of infinite language domination are studied. A characterization for E-closure of a family of language uniform theories in terms of index sets is found. We consider the class of linearly ordered families of language uniform theories and apply that characterization for this special case. The properties of discrete and dense index sets are investigated: it is shown that a discrete index set produces a least generating set whereas a dense index set implies at least continuum many accumulation points and the closure without the least generating set. In particular, having a dense index set the theory of the E-combination does not have $e$-least models and it is not small. Using the dichotomy for discrete and dense index sets we solve the problem of the existence of least generating set with respect to $E$-combinations and characterize that existence in terms of orders. Values for $e$-spectra of families of language uniform theories are obtained. It is shown that any $e$-spectrum can be realized by $E$-combination of language uniform theories. Low estimations for $e$-spectra relative to cardinalities of language are found. It is shown that families of language uniform theories produce an arbitrary given Cantor-Bendixson rank and given degree with respect to this rank.
topic E-combination
P-combination
closure operator
generating set
language uniform theory
url http://isu.ru/journal/downloadArticle?article=_302d15456f5446af965b72a7fa08b868&lang=eng
work_keys_str_mv AT ssudoplatov familiesoflanguageuniformtheoriesandtheirgeneratingsets
_version_ 1725613072642473984