From Nonstandard Analysis to Various Flavours of Computability Theory
From Nonstandard Analysis to Various Flavours of Computability Theory
As suggested by the title, it has recently become clear that theorems of Nonstandard Analysis (NSA) give rise to theorems in computability theory (no longer involving NSA). Now, the aforementioned discipline divides into classical and higher-order computability theory, where the former (resp. the latter) sub-discipline deals with objects of type zero and one (resp. of all types). The aforementioned results regarding NSA deal exclusively with the higher-order case; we show in this paper that theorems of NSA also give rise to theorems in classical computability theory by considering so-called textbook proofs.
To appear in the proceedings of TAMC2017 (http://tamc2017.unibe.ch/)
- Ludwig-Maximilians-Universität München Germany
- Ghent University Belgium
FOS: Mathematics, Mathematics - Logic, Logic (math.LO)
FOS: Mathematics, Mathematics - Logic, Logic (math.LO)
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!