scientific article; zbMATH DE number 3805536
From MaRDI portal
Publication:4749832
zbMath0511.03020MaRDI QIDQ4749832
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
History of mathematics in the 19th century (01A55) Metamathematics of constructive systems (03F50) Abstract and axiomatic computability and recursion theory (03D75)
Related Items (14)
Rogers semilattices of punctual numberings ⋮ Computability and Analysis, a Historical Approach ⋮ Computable completely decomposable groups ⋮ Constructive and computable Hahn-Banach theorems for the (second) fundamental theorem of welfare economics ⋮ Borel complexity and computability of the Hahn-Banach theorem ⋮ Ideals in computable rings ⋮ Proper divisibility in computable rings ⋮ Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis ⋮ FOUNDATIONS OF ONLINE STRUCTURE THEORY ⋮ Which set existence axioms are needed to prove the separable Hahn-Banach theorem? ⋮ Computability on subsets of Euclidean space. I: Closed and compact subsets ⋮ Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I ⋮ Unnamed Item ⋮ Effectively closed sets and graphs of computable real functions.
This page was built for publication:
