Algebra i logika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Algebra Logika:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Algebra i logika, 2024, Volume 63, Number 3, Pages 280–292
DOI: https://doi.org/10.33048/alglog.2024.63.304 (Mi al2807) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Connected pseudofinite unars

E. L. Efremov, A. A. Stepanova, S. G. Chekanov

Far Eastern Federal University, Vladivostok
Full-text PDF (195 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.33048/alglog.2024.63.304
Abstract: 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.
Keywords: pseudofinite unar, connected unar without cycles.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation 075-02-2024-1440
The work was carried out at Far Eastern Center for Mathematical Research and supported by RF Ministry of Education and Science, Agreement No. 075-02-2024-1440 of 28.02.2024 on realization of Developmental Programs for Regional Scientific and Educational Mathematical Centers.
Received: 10.01.2023
Revised: 11.04.2025
English version:
Algebra and Logic, 2024, Volume 63, Issue 3, Pages 186–194
DOI: https://doi.org/10.1007/s10469-025-09782-5
Document Type: Article
UDC: 510.67:512.57
Language: Russian
Citation: E. L. Efremov, A. A. Stepanova, S. G. Chekanov, “Connected pseudofinite unars”, Algebra Logika, 63:3 (2024), 280–292; Algebra and Logic, 63:3 (2024), 186–194
Citation in format AMSBIB
\Bibitem{EfrSteChe24}
\by E.~L.~Efremov, A.~A.~Stepanova, S.~G.~Chekanov
\paper Connected pseudofinite unars
\jour Algebra Logika
\yr 2024
\vol 63
\issue 3
\pages 280--292
\mathnet{http://mi.mathnet.ru/al2807}
\transl
\jour Algebra and Logic
\yr 2024
\vol 63
\issue 3
\pages 186--194
\crossref{https://doi.org/10.1007/s10469-025-09782-5}
Linking options:
  • https://www.mathnet.ru/eng/al2807
  • https://www.mathnet.ru/eng/al/v63/i3/p280
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Алгебра и логика Algebra and Logic
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025