Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II

DOI10.1016/S0168-0072(98)00048-7zbMATH Open0954.03043MaRDI QIDQ1302291FDOQ1302291

Authors: Iraj Kalantari, Lawrence Welch 

Publication date: 22 September 1999

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Recommendations

• Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
• Machines, Computations, and Universality
• A blend of methods of recursion theory and topology.

zbMATH Keywords

computable analysiscontinuitypoint-free topologycomputabilityrecursive analysiscomputable topologyrecursive topologypoint-free approach to points and functions on topological spacesrecursive functions on topological spaces

Mathematics Subject Classification ID

Convergence in general topology (sequences, filters, limits, convergence spaces, nets, etc.) (54A20) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Handbook of recursive mathematics. Vol. 1: Recursive model theory
• Nicht konstruktiv beweisbare Sätze der Analysis
• Title not available (Why is that?)
• Recursive analysis
• Title not available (Why is that?)
• Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
• Degrees of recursively enumerable topological spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic operators in constructive metric spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis

Cited In (14)

• When series of computable functions with varying domains are computable
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
• Effective versions of local connectivity properties
• On Turing degrees of points in computable topology
• Computable complex analysis
• On the Computable Theory of Bounded Analytic Functions
• A blend of methods of recursion theory and topology.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Effectiveness in RPL, with applications to continuous logic
• On degree-preserving homeomorphisms between trees in computable topology
• Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
• Title not available (Why is that?)
• Computable analysis and Blaschke products

This page was built for publication: Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302291)