Complexity estimates for theories of some classes of prime models

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.

Authors

Institutions

Publication Details

Journal
Kazakh mathematical journal.
Published
2025-06-17
DOI
https://doi.org/10.70474/wy2xaj39
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Complexity estimates for theories of some classes of prime models

M. G. Peretyat’kin
Kazakh mathematical journal.
Computability, Logic, AI Algorithms
article

Complexity estimates for theories of some classes of prime models

M. G. Peretyat’kin
article en

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.

Kazakh mathematical journal.Vol. 23(1)
Institute of Mathematics and Mathematical Modeling (KZ)
Openalex Percentile: Top 85%
Computability, Logic, AI Algorithms
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Complexity estimates for theories of some classes of prime models — M. G. Peretyat’kin · Kazakh mathematical journal. (2025) | TGRS Research Map | TGRS