Effective Choice and Boundedness Principles in Computable Analysis (Q3083466): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Mathematics based on incremental learning -- excluded middle and inductive inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: How incomputable is the separable Hahn-Banach theorem? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Borel degrees of some topological functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a simple definition of computable function of a real variable‐with applications to functions of a complex variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some conservation results on weak König's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on subsets of Euclidean space. I: Closed and compact subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel Complexity of Topological Operations on Computable Metric Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Omniscience Principles and Functions of Bounded Variation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials and linear transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computable version of Banach's inverse mapping theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plottable Real Number Functions and the Computable Graph Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel complexity and computability of the Hahn-Banach theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (semi)lattices induced by continuous reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Borel measurability and reducibility of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective representations of the space of linear bounded operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable invariance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructively Complete Finite Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5711891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform weak König's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of members of \(\Pi_ 1^ 0\) classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An omniscience principle, the König Lemma and the Hahn‐Banach theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to “Unique solutions” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on subsets of metric spaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weihrauch degrees, omniscience principles and weak computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform versions of some axioms of second order arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berechenbare Reelle Funktionenfolgen / rank
 
Normal rank

Latest revision as of 21:10, 3 July 2024

scientific article
Language Label Description Also known as
English
Effective Choice and Boundedness Principles in Computable Analysis
scientific article

    Statements

    Effective Choice and Boundedness Principles in Computable Analysis (English)
    0 references
    0 references
    0 references
    21 March 2011
    0 references
    computable analysis
    0 references
    constructive analysis
    0 references
    reverse mathematics
    0 references
    effective descriptive set theory
    0 references
    Weihrauch degrees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references