Constructive characterizations of bar subsets (Q866574): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Inductively generated formal topologies. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear category of polynomial diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type-theoretic interpretation of iterated, strictly positive inductive definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set constructor for inductive sets in Martin-Löf's type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3481701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3118402 / 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

Latest revision as of 13:32, 25 June 2024

scientific article
Language Label Description Also known as
English
Constructive characterizations of bar subsets
scientific article

    Statements

    Constructive characterizations of bar subsets (English)
    0 references
    0 references
    14 February 2007
    0 references
    This paper analyzes the notion of bar subsets for Cantor space, Baire space and, more generally, for an inductively generated formal topology. Presented formally, Baire space for instance is given by a generalized inductive definition which describes the covering relation between basic opens, where a basic open is given as a set of finite sequences of integers. This is an early example of generalized inductive definition, introduced by Brouwer (a little earlier example was provided by the definition of Borel sets). An arbitrary covering defines a well-founded tree. In the case of Cantor space, it defines a finite tree, without having to rely on a non-constructive compactness argument (König's lemma). These notions are neatly represented in Intuitionistic Type Theory, and in the case of an inductively generated formal topology can be seen as canonical examples of generalized inductive definitions.
    0 references
    formal topology
    0 references
    bar induction
    0 references
    constructive ordinals
    0 references
    type theory
    0 references
    constructive mathematics
    0 references
    bar theorem
    0 references
    generalized inductive definitions
    0 references

    Identifiers