A Computable Structure with Non-Standard Computability

Research output: Contribution to journalArticlepeer-review

Abstract

We find an example of a computable admissible set whose level of computability is higher than that of the standard model of Peano arithmetic. As a byproduct, we construct a 1-decidable model of an undecidable submodel complete theory.

Original languageEnglish
Pages (from-to)77-115
Number of pages39
JournalSiberian Advances in Mathematics
Volume29
Issue number2
DOIs
Publication statusPublished - 1 Apr 2019

Keywords

  • admissible set
  • computable model
  • decidable model
  • hereditarily finite superstructure
  • hyperadmissible set
  • recursively saturated model
  • Σ-definability
  • Σ-reducibility

Fingerprint Dive into the research topics of 'A Computable Structure with Non-Standard Computability'. Together they form a unique fingerprint.

Cite this