Nicht konstruktiv beweisbare Sätze der Analysis
From MaRDI portal
Publication:5790901
DOI10.2307/2267043zbMath0033.34102OpenAlexW4231629838WikidataQ62089385 ScholiaQ62089385MaRDI QIDQ5790901
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
Related Items (93)
Constructing the Infimum of Two Projections ⋮ Approximation to measurable functions and its relation to probabilistic computation ⋮ Some results in the effective descriptive set theory ⋮ Semi-effective numberings and definitions of the computable numbers ⋮ Fuzzy constructive logic ⋮ On the continued fraction representation of computable real numbers ⋮ Representations of the real numbers and of the open subsets of the set of real numbers ⋮ Between Turing and Kleene ⋮ Nonconstructivizability of certain ordered fields of real numbers ⋮ In Memoriam: Ernst Specker 1920–2011 ⋮ Constructive mathematics and unbounded operators -- a reply to Hellman ⋮ Computability and Analysis, a Historical Approach ⋮ Constructive notions of equicontinuity ⋮ Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes ⋮ Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma ⋮ Komplexität von Algorithmen mit Anwendung auf die Analysis ⋮ A unified approach to the definition of random sequences ⋮ Fluctuations, effective learnability and metastability in analysis ⋮ Lifting proofs from countable to uncountable mathematics ⋮ On Korpelevich's extragradient algorithm ⋮ Some results related to the continuity problem ⋮ A computational study of a class of recursive inequalities ⋮ Contribution of Warsaw logicians to computational logic ⋮ A note on the finitization of Abelian and Tauberian theorems ⋮ Reclassifying the antithesis of Specker's theorem ⋮ A finitization of Littlewood's Tauberian theorem and an application in Tauberian remainder theory ⋮ On the progression of belief ⋮ On the complexity of computable real sequences ⋮ Effective weak and vague convergence of measures on the real line ⋮ Rates of convergence for the asymptotic behavior of second-order Cauchy problems ⋮ On computational properties of Cauchy problems generated by accretive operators ⋮ Beta-shifts, their languages, and computability ⋮ Computing sums of conditionally convergent and divergent series using the concept of grossone ⋮ Five stages of accepting constructive mathematics ⋮ The maximum value problem and NP real numbers ⋮ Computable irrational numbers with representations of surprising complexity ⋮ Reflections on function spaces ⋮ On the hierarchy and extension of monotonically computable real numbers. ⋮ Computational complexity of real functions ⋮ The anti-Specker property, a Heine-Borel property, and uniform continuity ⋮ The constructive inequivalence of various notions of preference ordering ⋮ Algebras of recursively enumerable sets and their applications to fuzzy logic ⋮ When series of computable functions with varying domains are computable ⋮ An example of noncomputability of exponents of a system of ordinary differential equations ⋮ Fifty years of the spectrum problem: survey and new results ⋮ A fan-theoretic equivalent of the antithesis of Specker's theorem ⋮ The abstract type of the real numbers ⋮ On the definitions of some complexity classes of real numbers ⋮ Zur Konstruktiven Differenzierbarkeit von Monotonen Berechenbaren Funktionen ⋮ 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 ⋮ Weakly computable real numbers ⋮ Algorithmic randomness and Fourier analysis ⋮ Extended fuzzy constructive logic ⋮ Primitive Recursiveness of Real Numbers under Different Representations ⋮ Classification of the Computable Approximations by Divergence Boundings ⋮ Kronecker's density theorem and irrational numbers in constructive reverse mathematics ⋮ Computing interpolating sequences ⋮ The anti-Specker property, positivity, and total boundedness ⋮ Recursive function theory and numerical analysis ⋮ Computable analysis and Blaschke products ⋮ Probabilistic Recursive Functions ⋮ On the hierarchies of Δ20-real numbers ⋮ Intuitionistic sequential compactness? ⋮ Rates of metastability for iterations on the unit interval ⋮ Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers) ⋮ Classification of computably approximable real numbers ⋮ Real numbers, continued fractions and complexity classes ⋮ Complexity of the calculus of continued fraction representation of real numbers ⋮ Computing boundary extensions of conformal maps ⋮ Moduli of regularity and rates of convergence for Fejér monotone sequences ⋮ Decidability and Specker sequences in intuitionistic mathematics ⋮ Rekursive reelle Zahlen ⋮ Zur rekursiven Funktionentheorie ⋮ A new metastable convergence criterion and an application in the theory of uniformly convex Banach spaces ⋮ A sufficient condition for the convergence of monotone sequences ⋮ Markov's constructive analysis; a participant's view ⋮ Unnamed Item ⋮ Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II ⋮ Reducibilities on real numbers ⋮ Using PVS to validate the algorithms of an exact arithmetic. ⋮ On the Computable Theory of Bounded Analytic Functions ⋮ 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) ⋮ Liouville numbers and the computational complexity of changing bases ⋮ On the complexity of conversion between classic real number representations ⋮ TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS ⋮ Computability of Real Numbers ⋮ Computable Complex Analysis ⋮ The closure properties on real numbers under limits and computable operators. ⋮ On the Borel-Cantelli Lemmas, the Erdős-Rényi Theorem, and the Kochen-Stone Theorem ⋮ Dedekind cuts and long strings of zeros in base expansions ⋮ Divergence bounded computable real numbers
Cites Work
This page was built for publication: Nicht konstruktiv beweisbare Sätze der Analysis
