Nicht konstruktiv beweisbare Sätze der Analysis

DOI10.2307/2267043zbMATH Open0033.34102OpenAlexW4231629838WikidataQ62089385 ScholiaQ62089385MaRDI QIDQ5790901FDOQ5790901

Authors: Ernst Specker 

Publication date: 1949

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/304204/files/S0022481200105663.pdf

Recommendations

• scientific article; zbMATH DE number 3104941
• scientific article; zbMATH DE number 3891660
• scientific article; zbMATH DE number 3255673
• scientific article
• scientific article; zbMATH DE number 3855103
• scientific article
• Nonlocal Qualitative and Quantitative Analysis of a Simple Shallow Shell Problem
• scientific article; zbMATH DE number 3446864
• Une approche na�ve de ?analyse non-standard

zbMATH Keywords

Philosophy and foundations of mathematics

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• An Unsolvable Problem of Elementary Number Theory
• General recursive functions of natural numbers
• Konstruktion nichtrekursiver Funktionen

Cited In (97)

• Fluctuations, effective learnability and metastability in analysis
• Représentations des nombres réels par développements en base entière et complexité. (Representations of real numbers by expansions on integer basis and complexity)
• Approximation to measurable functions and its relation to probabilistic computation
• Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics
• Recursive function theory and numerical analysis
• Algorithmic randomness and Fourier analysis
• On the continued fraction representation of computable real numbers
• On the hierarchy and extension of monotonically computable real numbers.
• Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
• Contribution of Warsaw logicians to computational logic
• Kronecker's density theorem and irrational numbers in constructive reverse mathematics
• Computational complexity of real functions
• Weakly computable real numbers
• Representations of the real numbers and of the open subsets of the set of real numbers
• Nonconstructivizability of certain ordered fields of real numbers
• Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
• Fuzzy constructive logic
• Algebras of recursively enumerable sets and their applications to fuzzy logic
• A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory
• Extended fuzzy constructive logic
• A unified approach to the definition of random sequences
• Fifty years of the spectrum problem: survey and new results
• The closure properties on real numbers under limits and computable operators.
• Decidability and Specker sequences in intuitionistic mathematics
• Classification of computably approximable real numbers
• Computing sums of conditionally convergent and divergent series using the concept of grossone
• Some results in the effective descriptive set theory
• Markov's constructive analysis; a participant's view
• Five stages of accepting constructive mathematics
• The constructive inequivalence of various notions of preference ordering
• The abstract type of the real numbers
• Using PVS to validate the algorithms of an exact arithmetic.
• Primitive Recursiveness of Real Numbers under Different Representations
• Constructive mathematics and unbounded operators -- a reply to Hellman
• Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma
• Real numbers, continued fractions and complexity classes
• Constructive notions of equicontinuity
• Intuitionistic sequential compactness?
• A fan-theoretic equivalent of the antithesis of Specker's theorem
• Probabilistic Recursive Functions
• Rekursive reelle Zahlen
• Reclassifying the antithesis of Specker's theorem
• Beta-shifts, their languages, and computability
• Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games
• Computing interpolating sequences
• Reflections on function spaces
• The anti-Specker property, a Heine-Borel property, and uniform continuity
• Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II
• Reducibilities on real numbers
• Rates of metastability for iterations on the unit interval
• On the definitions of some complexity classes of real numbers
• Title not available (Why is that?)
• The maximum value problem and NP real numbers
• On the hierarchies of Δ₂⁰-real numbers
• Complexity of the calculus of continued fraction representation of real numbers
• Notes on computable analysis
• Divergence bounded computable real numbers
• An example of noncomputability of exponents of a system of ordinary differential equations
• The anti-Specker property, positivity, and total boundedness
• Zur rekursiven Funktionentheorie
• Computability of Real Numbers
• Computable analysis and Blaschke products
• A new metastable convergence criterion and an application in the theory of uniformly convex Banach spaces
• Komplexität von Algorithmen mit Anwendung auf die Analysis
• Computable Complex Analysis
• Effective weak and vague convergence of measures on the real line
• Liouville numbers and the computational complexity of changing bases
• On the complexity of conversion between classic real number representations
• Constructing the Infimum of Two Projections
• When series of computable functions with varying domains are computable
• Rates of convergence for the asymptotic behavior of second-order Cauchy problems
• On computational properties of Cauchy problems generated by accretive operators
• Dedekind cuts and long strings of zeros in base expansions
• Computable irrational numbers with representations of surprising complexity
• In memoriam: Ernst Specker, 1920-2011
• Interplay between insertion of zeros and the complexity of Dedekind cuts
• Zur Konstruktiven Differenzierbarkeit von Monotonen Berechenbaren Funktionen
• On Korpelevich's extragradient algorithm
• On the Borel-Cantelli Lemmas, the Erdős-Rényi Theorem, and the Kochen-Stone Theorem
• On the Computable Theory of Bounded Analytic Functions
• Computably and punctually universal spaces
• Between Turing and Kleene
• Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes
• Computing boundary extensions of conformal maps
• Moduli of regularity and rates of convergence for Fejér monotone sequences
• Lifting proofs from countable to uncountable mathematics
• A computational study of a class of recursive inequalities
• On the progression of belief
• Classification of the Computable Approximations by Divergence Boundings
• Computability and Analysis, a Historical Approach
• Nonlocal Qualitative and Quantitative Analysis of a Simple Shallow Shell Problem
• A note on the finitization of Abelian and Tauberian theorems
• Semi-effective numberings and definitions of the computable numbers
• On computable numbers, with an application to the Druckproblem
• A sufficient condition for the convergence of monotone sequences
• On the complexity of computable real sequences
• Some results related to the continuity problem

This page was built for publication: Nicht konstruktiv beweisbare Sätze der Analysis

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