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

(only showing first 100 items - show all)

An example of noncomputability of exponents of a system of ordinary differential equations
A note on the finitization of Abelian and Tauberian theorems
A sufficient condition for the convergence of monotone sequences
Semi-effective numberings and definitions of the computable numbers
On logical aspects of extensionality and continuity for set-valued operators with applications to nonlinear analysis
On the complexity of computable real sequences
The anti-Specker property, positivity, and total boundedness
On computable numbers, with an application to the Druckproblem
Zur rekursiven Funktionentheorie
Some results related to the continuity problem
Fluctuations, effective learnability and metastability in analysis
On quantitative convergence for stochastic processes: crossings, fluctuations and martingales
Computability of 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)
A new metastable convergence criterion and an application in the theory of uniformly convex Banach spaces
Computable analysis and Blaschke products
Approximation to measurable functions and its relation to probabilistic computation
Komplexität von Algorithmen mit Anwendung auf die Analysis
Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics
Recursive function theory and numerical analysis
Liouville numbers and the computational complexity of changing bases
On the complexity of conversion between classic real number representations
On the finitary content of Dykstra's cyclic projections algorithm
On the continued fraction representation of computable real numbers
Algorithmic randomness and Fourier analysis
On the hierarchy and extension of monotonically computable real numbers.
Effective weak and vague convergence of measures on the real line
When series of computable functions with varying domains are computable
Kronecker's density theorem and irrational numbers in constructive reverse mathematics
Contribution of Warsaw logicians to computational logic
Computational complexity of real functions
Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
Representations of the real numbers and of the open subsets of the set of real numbers
Rates of convergence for the asymptotic behavior of second-order Cauchy problems
On computational properties of Cauchy problems generated by accretive operators
Nonconstructivizability of certain ordered fields of real numbers
Weakly computable real numbers
Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
Dedekind cuts and long strings of zeros in base expansions
Fuzzy constructive logic
Computable irrational numbers with representations of surprising complexity
Algebras of recursively enumerable sets and their applications to fuzzy logic
Classification of the computable approximations by divergence boundings
In memoriam: Ernst Specker, 1920-2011
A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory
Extended fuzzy constructive logic
A finitary Kronecker's lemma and large deviations in the strong law of large numbers on Banach spaces
A unified approach to the definition of random sequences
The closure properties on real numbers under limits and computable operators.
Fifty years of the spectrum problem: survey and new results
Quantitative strong laws of large numbers
Decidability and Specker sequences in intuitionistic mathematics
Classification of computably approximable real numbers
A framework for belief-based programs and their verification
Interplay between insertion of zeros and the complexity of Dedekind cuts
Computing sums of conditionally convergent and divergent series using the concept of grossone
A degree structure on representations of irrational numbers
Some results in the effective descriptive set theory
Markov's constructive analysis; a participant's view
The constructive inequivalence of various notions of preference ordering
Zur Konstruktiven Differenzierbarkeit von Monotonen Berechenbaren Funktionen
On the Borel-Cantelli Lemmas, the Erdős-Rényi Theorem, and the Kochen-Stone Theorem
On Korpelevich's extragradient algorithm
On the Computable Theory of Bounded Analytic Functions
Five stages of accepting constructive mathematics
Computable complex analysis
The abstract type of the real numbers
Using PVS to validate the algorithms of an exact arithmetic.
Computably and punctually universal spaces
Between Turing and Kleene
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
Quantitative results for a Tseng-type primal-dual method for composite monotone inclusions
Constructive notions of equicontinuity
Proof mining and probability theory
Intuitionistic sequential compactness?
Computability and analysis, a historical approach
A fan-theoretic equivalent of the antithesis of Specker's theorem
Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes
Probabilistic Recursive Functions
Rekursive reelle Zahlen
Computing boundary extensions of conformal maps
Moduli of regularity and rates of convergence for Fejér monotone sequences
Beta-shifts, their languages, and computability
Reclassifying the antithesis of Specker's theorem
Lifting proofs from countable to uncountable mathematics
Effective rates for nonlinear ergodic averages
A computational study of a class of recursive inequalities
Generalized learnability of stochastic principles
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
On the progression of belief
Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II
Constructing the infimum of two projections
Reducibilities on real numbers
Generalized Fejér monotone sequences and their finitary content
Rates of metastability for iterations on the unit interval

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)