Connected choice and the Brouwer fixed point theorem (Q5223123): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128896781, #quickstatements; #temporary_batch_1723471789570
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1206.4809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die Nichtkonstruktivität des Brouwerschen Fixpunktsatzes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4277838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable invariance / 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: Plottable Real Number Functions and the Computable Graph Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed choice and a uniform low basis theorem / 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: Effective Choice and Boundedness Principles in Computable Analysis / 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: The Vitali Covering Theorem in the Weihrauch Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniform computational content of computability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniform computational content of the Baire category theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Brouwer Fixed Point Theorem Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability on subsets of metric spaces. / 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: An intuitionist correction of the fixed-point theorem on the sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countable thin \(\Pi^0_1\) classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and Representations of the Zero Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994935 / 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: An effective Riemann Mapping Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of the Radon-Nikodym Derivative / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3639062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational homology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomputability of Simply Connected Planar Continua / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5711891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite choice, convex choice and finding roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singular coverings and non‐uniform notions of closed set computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5608010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-computability of competitive equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point theory in weak second-order arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1502819508 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128896781 / rank
 
Normal rank

Latest revision as of 15:22, 12 August 2024

scientific article; zbMATH DE number 7077424
Language Label Description Also known as
English
Connected choice and the Brouwer fixed point theorem
scientific article; zbMATH DE number 7077424

    Statements

    Connected choice and the Brouwer fixed point theorem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 July 2019
    0 references
    computable analysis
    0 references
    Weihrauch lattice
    0 references
    reverse mathematics
    0 references
    choice principles
    0 references
    connected sets
    0 references
    fixed point theorems
    0 references
    0 references
    0 references
    0 references
    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