𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Compactness and recursive enumerability in intensional logic

✍ Scribed by Bernd J. Stephan

Publisher
John Wiley and Sons
Year
1975
Tongue
English
Weight
280 KB
Volume
21
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On local non-compactness in recursive ma
On local non-compactness in recursive mathematics
✍ Jakob G. Simonsen πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 132 KB

## Abstract A metric space is said to be __locally non‐compact__ if every neighborhood contains a sequence that is eventually bounded away from every element of the space, hence contains no accumulation point. We show within recursive mathematics that a nonvoid complete metric space is locally non‐

Recursively enumerable subsets of Rq in
Recursively enumerable subsets of Rq in two computing models Blum-Shub-Smale machine and Turing machine
✍ Ning Zhong πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 997 KB

In this paper we compare recursively enumerable subsets of R" in two computing models over real numbers: the Blum-Shub-Smale machine and the oracle Turing machine. We prove that any Turing RE open subset of RY is a BSS RE set, while a Turing RE closed set may not be a BSS RE set. As an application