Nicht konstruktiv beweisbare Sätze der Analysis

Recommendations

scientific article; zbMATH DE number 3104941
scientific article; zbMATH DE number 3891660
scientific article; zbMATH DE number 3255673
scientific article; zbMATH DE number 3154094
scientific article; zbMATH DE number 3855103
scientific article; zbMATH DE number 3141389
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

Cites work

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

Cited in

(97)

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