Processes and Structures on Approximation Spaces

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

We introduce the concept of a computability component on an admissible set and consider minimal and maximal computability components on hereditarily finite superstructures as well as jumps corresponding to these components. It is shown that the field of real numbers Σ-reduces to jumps of the maximal computability component on the least admissible set ℍF(∅). Thus we obtain a result that, in terms of Σ-reducibility, connects real numbers, conceived of as a structure, with real numbers, conceived of as an approximation space. Also we formulate a series of natural open questions.

Original languageEnglish
Pages (from-to)63-74
Number of pages12
JournalAlgebra and Logic
Volume56
Issue number1
DOIs
Publication statusPublished - 1 Mar 2017

Keywords

  • admissible sets
  • approximation spaces
  • computability theory
  • computable analysis
  • constructive models
  • hyperarithmetical computability
  • REDUCIBILITY
  • PRESENTABILITY

Fingerprint

Dive into the research topics of 'Processes and Structures on Approximation Spaces'. Together they form a unique fingerprint.

Cite this