Аннотация
We consider two kinds of reducibilities on finite families of predicates on a countable set: the definability of predicates and their complements of one family via another by means of existential formulas with parameters and the same definability on isomorphism types of families. Ordered structures of degrees generated by families of unary predicates are described. It is proved that for both reducibilities, there exist continuum many minimal nonzero degrees.
Язык оригинала | английский |
---|---|
Страницы (с-по) | 328-340 |
Число страниц | 13 |
Журнал | Algebra and Logic |
Том | 59 |
Номер выпуска | 4 |
DOI | |
Состояние | Опубликовано - сен 2020 |