Complexity estimates for theories of some classes of prime models
Mikhail G. Peretyat’kin · Kazakh mathematical journal. · 2025
The problems of algorithmic characterization in subclasses of the class of prime models of a finite rich signature are studied. Models with algebraic elements and models with first-order definable elements are considered. Conditions for the existence of strong constructivizations of models of different dimensions in these classes are formulated. Estimates of the algorithmic complexity of elementary theories of some subclasses of the class of prime strongly constructivizable models are given.