Independence results in formal topology (Q651321): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The calculus of constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductively generated formal topologies. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accessible Independence Results for Peano Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some points in formal topology. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the formal points of the formal topology of the binary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every countably presented formal topology is spatial, classically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive characterizations of bar subsets / rank
 
Normal rank

Latest revision as of 17:16, 4 July 2024

scientific article
Language Label Description Also known as
English
Independence results in formal topology
scientific article

    Statements

    Independence results in formal topology (English)
    0 references
    0 references
    12 December 2011
    0 references
    This paper remarks that it is possible to express that a finitely branching tree is well-founded as the fact that an associated topological space is discrete. In this way, one can formulate the fact that some orders are well-founded (e.g., the fact that \(\epsilon_0\) is well-ordered) in a topological way.
    0 references
    formal topology
    0 references
    constructive mathematics
    0 references
    independence result
    0 references

    Identifiers