It is proved that for every level of the arithmetic hierarchy, there exist infinitely many families of sets with pairwise non-elementarily equivalent Rogers semilattices
International audienceA 1984 problem of S.Z. Ditor asks whether there exists a lattice of cardinalit...
AbstractWe completely characterize those distributive lattices which can be obtained as elementary s...
AbstractSuppose that A is a finite set-system on N points, and for everytwo different A, A′ϵ A we ha...
It is proved that for every level of the arithmetic hierarchy, there exist infinitely many families ...
We investigate differences in the elementary theories of Rogers semilattices of arithmetical number...
We investigate differences in the elementary theories and isomorphism types of Rogers semilattices ...
We investigate initial segments and intervals of Rogers semilattices of arithmetical families. We p...
We investigate differences in isomorphism types and elementary theories of Rogers semilattices of a...
Abstract We investigate initial segments and intervals of Rogers semilattices of arithmetical famili...
We investigate differences in isomorphism types for Rogers semilattices of computable numberings of ...
Let $a$ be a Kleene's ordinal notation of a nonzero computable ordinal. We give a sufficient conditi...
We investigate differences in the isomorphism types of Rogers semilat-tices of computable numberings...
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ o...
© 2018, Springer-Verlag GmbH Germany, part of Springer Nature. A major theme in the study of degree ...
AbstractIt is shown that if L is a lattice in which every element has only finitely many predecessor...
International audienceA 1984 problem of S.Z. Ditor asks whether there exists a lattice of cardinalit...
AbstractWe completely characterize those distributive lattices which can be obtained as elementary s...
AbstractSuppose that A is a finite set-system on N points, and for everytwo different A, A′ϵ A we ha...
It is proved that for every level of the arithmetic hierarchy, there exist infinitely many families ...
We investigate differences in the elementary theories of Rogers semilattices of arithmetical number...
We investigate differences in the elementary theories and isomorphism types of Rogers semilattices ...
We investigate initial segments and intervals of Rogers semilattices of arithmetical families. We p...
We investigate differences in isomorphism types and elementary theories of Rogers semilattices of a...
Abstract We investigate initial segments and intervals of Rogers semilattices of arithmetical famili...
We investigate differences in isomorphism types for Rogers semilattices of computable numberings of ...
Let $a$ be a Kleene's ordinal notation of a nonzero computable ordinal. We give a sufficient conditi...
We investigate differences in the isomorphism types of Rogers semilat-tices of computable numberings...
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ o...
© 2018, Springer-Verlag GmbH Germany, part of Springer Nature. A major theme in the study of degree ...
AbstractIt is shown that if L is a lattice in which every element has only finitely many predecessor...
International audienceA 1984 problem of S.Z. Ditor asks whether there exists a lattice of cardinalit...
AbstractWe completely characterize those distributive lattices which can be obtained as elementary s...
AbstractSuppose that A is a finite set-system on N points, and for everytwo different A, A′ϵ A we ha...
DOI
Add to ORKG