On algebras of binary formulas for weakly circularly minimal theories of finite convexity rank

On algebras of binary formulas for weakly circularly minimal theories of finite convexity rank Full article

Journal

Сибирские электронные математические известия (Siberian Electronic Mathematical Reports)
, E-ISSN: 1813-3304

Output data

Year: 2025, Volume: 22, Number: 1, Pages: 635–649 Pages count : 15 DOI: 10.33048/semi.2025.22.041

Tags

algebra of binary formulas, weak circular minimality, ℵ0-categorical theory, circularly ordered structure, convexity rank.

Authors

Kulpeshov B.SH. ^1,2 , Sudoplatov S.V. ^3,4

Affiliations

1	Kazakh British Technical University Tole bi street, 59 050000, Almaty, Kazakhstan.
2	Institute of Mathematics and Mathematical Modeling Shevchenko street, 28 050010, Almaty, Kazakhstan.
3	Novosibirsk State Technical University K. Marx avenue, 20 630073, Novosibirsk, Russia.
4	Sobolev Institute of Mathematics, Academician Koptyug avenue, 4 630090, Novosibirsk, Russia.

Funding (1)

Sobolev Institute of Mathematics

FWNF-2022-0012

Algebras of binary isolating formulas are described for ℵ0-categorical 1-transitive non-primitive weakly circularly minimal theories of finite convexity rank with a trivial definable closure having a monotonic-to-right function to the definable completion of a structure and not having a non-trivial equivalence relation partitioning the universe of a structure into finitely many convex classes.

Kulpeshov B.S. , Sudoplatov S.V.
On algebras of binary formulas for weakly circularly minimal theories of finite convexity rank
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2025. V.22. N1. P.635–649. DOI: 10.33048/semi.2025.22.041

Submitted:	Dec 13, 2024
Accepted:	Feb 14, 2025
Published print:	Jun 18, 2025
Published online:	Jun 18, 2025

No identifiers

Пока нет цитирований