Nicht konstruktiv beweisbare Sätze der Analysis
From MaRDI portal
Publication:5790901
DOI10.2307/2267043zbMath0033.34102WikidataQ62089385 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
03-XX: Mathematical logic and foundations
Related Items
Computable analysis and Blaschke products, On the hierarchies of Δ20-real numbers, Some results in the effective descriptive set theory, Semi-effective numberings and definitions of the computable numbers, Komplexität von Algorithmen mit Anwendung auf die Analysis, A unified approach to the definition of random sequences, Weakly computable real numbers, Probabilistic Recursive Functions, Computing sums of conditionally convergent and divergent series using the concept of grossone, Beta-shifts, their languages, and computability, Reflections on function spaces, Real numbers, continued fractions and complexity classes, Rekursive reelle Zahlen, Zur rekursiven Funktionentheorie, Reducibilities on 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), Divergence bounded computable real numbers, Fuzzy constructive logic, The anti-Specker property, a Heine-Borel property, and uniform continuity, Algebras of recursively enumerable sets and their applications to fuzzy logic, Kronecker's density theorem and irrational numbers in constructive reverse mathematics, Computing interpolating sequences, Classification of computably approximable real numbers, Approximation to measurable functions and its relation to probabilistic computation, 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, Nonconstructivizability of certain ordered fields of real numbers, The maximum value problem and NP real numbers, Computational complexity of real functions, The constructive inequivalence of various notions of preference ordering, Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games, Recursive function theory and numerical analysis, Markov's constructive analysis; a participant's view, Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II, On the hierarchy and extension of monotonically computable real numbers., The closure properties on real numbers under limits and computable operators., Complexity of the calculus of continued fraction representation of real numbers, Using PVS to validate the algorithms of an exact arithmetic., Constructive mathematics and unbounded operators -- a reply to Hellman, Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma, Constructive notions of equicontinuity, A fan-theoretic equivalent of the antithesis of Specker's theorem, A sufficient condition for the convergence of monotone sequences, Constructing the Infimum of Two Projections, In Memoriam: Ernst Specker 1920–2011, On the definitions of some complexity classes of real numbers, The anti-Specker property, positivity, and total boundedness, Decidability and Specker sequences in intuitionistic mathematics, Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes, On the complexity of computable real sequences, Zur Konstruktiven Differenzierbarkeit von Monotonen Berechenbaren Funktionen, Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
Cites Work
