𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computability of partial functions and enumerability of sets in Peano's arithmetic

✍ Scribed by I. A. Lavrov

Publisher
SP MAIK Nauka/Interperiodica
Year
1980
Tongue
English
Weight
348 KB
Volume
20
Category
Article
ISSN
0037-4466

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computable limits and colimits in catego
Computable limits and colimits in categories of partial enumerated sets
✍ Andrzej Orlicki πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 931 KB

## Abstract Computable limits and colimits are β€œrecursive counterparts” of the suitable classical concepts from category theory. We present mainly some interesting problems related to computable products. Moreover, some β€œcomputable counterparts” of well‐known classical facts from category theory ar

Topological Size of Sets of Partial Recu
Topological Size of Sets of Partial Recursive Functions
✍ Cristian Calude πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 478 KB πŸ‘ 1 views

TOPOLOGICAL SIZE OF SETS O F PARTIAL RECURSIVE FUNCTIONS by CRISTIAN CALUDE in Bucharest (Romania) l) 1) I wish to thank Prof. G. WECHSUNG for helpful comments on this work.

Weak regularity of functions and sets in
Weak regularity of functions and sets in Asplund spaces
✍ Abderrahim Jourani πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 242 KB

In this paper, we study a new concept of weak regularity of functions and sets in Asplund spaces. We show that this notion includes prox-regular functions, functions whose subdifferential is weakly submonotone and amenable functions in infinite dimension. We establish also that weak regularity is eq