scientific article

zbMath0088.01702MaRDI QIDQ3260574

No author found.

Publication date: 1959

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

zbMATH Keywords

foundations of mathematics, philosophy, logic

Related Items

Continuous optimization problems and a polynomial hierarchy of real functions ⋮ Computability and Analysis, a Historical Approach ⋮ On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain ⋮ Computable approximations of a chainable continuum with a computable endpoint ⋮ Computability of graphs ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ Semicomputable manifolds in computable topological spaces ⋮ Singular coverings and non‐uniform notions of closed set computability ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Computable subcontinua of semicomputable chainable Hausdorff continua ⋮ Computable neighbourhoods of points in semicomputable manifolds ⋮ Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games ⋮ Notes on computable analysis ⋮ Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis ⋮ Singular Coverings and Non-Uniform Notions of Closed Set Computability ⋮ A notion of mechanistic theory ⋮ The prime number theorem is PRA-provable ⋮ Chainable and circularly chainable semicomputable sets in computable topological spaces ⋮ Co-c.e. sets with disconnected complements ⋮ Computability of products of chainable continua ⋮ Relatively recursive reals and real functions ⋮ On the computational complexity of best Chebyshev approximations ⋮ Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I ⋮ Unnamed Item ⋮ Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators ⋮ On the Computable Theory of Bounded Analytic Functions ⋮ Computable Complex Analysis ⋮ Weihrauch Complexity in Computable Analysis