The Degree of Decidable Categoricity of a Model with Infinite Solutions for Complete Formulas

Research output: Contribution to journalArticlepeer-review

Abstract

We construct a decidable prime model in which the degree of a set of complete formulas is equal to 0', infinitely many tuples of elements comply with every complete formula, and the decidable categoricity spectrum coincides with the set of all PA-degrees.

Translated title of the contributionО степени разрешимой категоричности модели с бесконечными решениями для полных формул
Original languageEnglish
Pages (from-to)200-206
Number of pages7
JournalAlgebra and Logic
Volume60
Issue number3
DOIs
Publication statusPublished - Jul 2021

Keywords

  • autostability relative to strong constructivizations
  • computable categoricity
  • computable model
  • decidable categoricity spectrum
  • decidable model
  • degree of decidable categoricity
  • PAdegree

OECD FOS+WOS

  • 1.01 MATHEMATICS

Fingerprint

Dive into the research topics of 'The Degree of Decidable Categoricity of a Model with Infinite Solutions for Complete Formulas'. Together they form a unique fingerprint.

Cite this