Complexity estimates for theories of some classes of prime models

Mikhail G. Peretyat’kin

2025

Full text Open access: Hybrid Metadata (CSL-JSON)
DOI 10.70474/wy2xaj39
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

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.