Connected pseudofinite unars
Algebra i logika, Tome 63 (2024) no. 3, pp. 280-292

Voir la notice de l'article provenant de la source Math-Net.Ru

We start studying the structure of pseudofinite unars. Necessary (sufficient) conditions of being pseudofinite are formulated for connected unars without cycles, containing no chains, and we give examples showing that these conditions are not sufficient (necessary). It is noted that a coproduct of chains is a pseudofinite unar; in particular, a chain is a pseudofinite unar. A nonpseudofinite connected unar without cycles, containing exactly one chain is exemplified. For connected unars without cycles, containing two chains, we formulate a necessary condition of being pseudofinite and give an example of a nonpseudofinite unar.
Mots-clés : pseudofinite unar
Keywords: connected unar without cycles.
@article{AL_2024_63_3_a3,
     author = {E. L. Efremov and A. A. Stepanova and S. G. Chekanov},
     title = {Connected pseudofinite unars},
     journal = {Algebra i logika},
     pages = {280--292},
     publisher = {mathdoc},
     volume = {63},
     number = {3},
     year = {2024},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2024_63_3_a3/}
}
TY  - JOUR
AU  - E. L. Efremov
AU  - A. A. Stepanova
AU  - S. G. Chekanov
TI  - Connected pseudofinite unars
JO  - Algebra i logika
PY  - 2024
SP  - 280
EP  - 292
VL  - 63
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2024_63_3_a3/
LA  - ru
ID  - AL_2024_63_3_a3
ER  - 
%0 Journal Article
%A E. L. Efremov
%A A. A. Stepanova
%A S. G. Chekanov
%T Connected pseudofinite unars
%J Algebra i logika
%D 2024
%P 280-292
%V 63
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2024_63_3_a3/
%G ru
%F AL_2024_63_3_a3
E. L. Efremov; A. A. Stepanova; S. G. Chekanov. Connected pseudofinite unars. Algebra i logika, Tome 63 (2024) no. 3, pp. 280-292. http://geodesic.mathdoc.fr/item/AL_2024_63_3_a3/