Pseudo-Countably-Categorical Formulas and Theories

B. Sh. Kulpeshov, In. I. Pavlyuk, Sergey Vladimirovich Sudoplatov

2025

Closed access Metadata (CSL-JSON)
DOI 10.1134/s0001434625030095
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

Abstract The concept of a pseudo-countably-categorical formula is introduced, and the syntactic and semantic possibilities of such formulas are investigated. Approximations of theories using such formulas, including pseudo-countably-categorical ordered theories, theories of Abelian groups and modules, and Ehrenfeucht theories, are studied. A description of canonical representatives of pseudo-countably-categorical ordered theories is given. The preservation and violation of pseudo-countable categoricity under expansions and restrictions of theories are considered. Countable spectra of pseudo-countably-categorical theories are described.