𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Representation theorems for transfinite computability and definability

✍ Scribed by Dag Normann

Book ID
105842680
Publisher
Springer
Year
2002
Tongue
English
Weight
152 KB
Volume
41
Category
Article
ISSN
0933-5846

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computability and Ξ»-Definability
Computability and Ξ»-Definability
✍ A. M. Turing πŸ“‚ Article πŸ“… 1937 πŸ› Association for Symbolic Logic 🌐 English βš– 941 KB
Rice and Rice-Shapiro Theorems for trans
Rice and Rice-Shapiro Theorems for transfinite correction grammars
✍ John Case; Sanjay Jain πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 172 KB

## MSC (2010) 03D99 Hay and, then, Johnson extended the classic Rice and Rice-Shapiro Theorems for computably enumerable sets, to analogs for all the higher levels in the finite Ershov Hierarchy. The present paper extends their work (with some motivations presented) to analogs in the transfinite E

Representation Theorems for Quantales
Representation Theorems for Quantales
✍ Silvio Valentini πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 485 KB

## Abstract In this paper we prove that any quantale Q is (isomorphic to) a quantale of suitable relations on Q. As a consequence two isomorphism theorems are also shown with suitable sets of functions of Q into Q. These theorems are the mathematical background one needs in order to give natural an