scientific article

zbMath0089.00701MaRDI QIDQ3262213

Daniel Lacombe

Publication date: 1959

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

foundations of mathematics, philosophy, logic

Related Items

Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations, COMPUTABLY COMPACT METRIC SPACES, Computing with infinite objects, Embedding metric spaces into CPO's, An abstract data type for real numbers, Recursive quasi-metric spaces., Constructive metrisability in point-free topology., Computing Uniform Bounds, Choice and complexity, A computable version of Banach's inverse mapping theorem, Computability on computable metric spaces, Computation on metric spaces via domain theory, Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I, An abstract data type for real numbers, Weihrauch Complexity in Computable Analysis, La théorie des fonctions récursives et ses applications. (Exposé d'information générale)