Fixed points of set functors: how many iterations are needed? (Q328655): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10485-016-9451-1 / rank
Normal rank
 
Property / author
 
Property / author: Jiří Adámek / rank
Normal rank
 
Property / author
 
Property / author: Václav Koubek / rank
Normal rank
 
Property / author
 
Property / author: Jiří Adámek / rank
 
Normal rank
Property / author
 
Property / author: Václav Koubek / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 18A30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03E10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6641510 / rank
 
Normal rank
Property / zbMATH Keywords
 
set functors
Property / zbMATH Keywords: set functors / rank
 
Normal rank
Property / zbMATH Keywords
 
terminal coalgebra
Property / zbMATH Keywords: terminal coalgebra / rank
 
Normal rank
Property / zbMATH Keywords
 
terminal chain
Property / zbMATH Keywords: terminal chain / rank
 
Normal rank
Property / zbMATH Keywords
 
filter functor
Property / zbMATH Keywords: filter functor / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10485-016-9451-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2511252833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On final coalgebras of power-set functors and saturated trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree coalgebras and coalgebra presentations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial algebras and terminal coalgebras in many-sorted sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relatively terminal coalgebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coequalizers and free triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Terminal coalgebras in well-founded set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4046228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5574731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the final sequence of a finitary set functor / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10485-016-9451-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:32, 9 December 2024

scientific article
Language Label Description Also known as
English
Fixed points of set functors: how many iterations are needed?
scientific article

    Statements

    Fixed points of set functors: how many iterations are needed? (English)
    0 references
    0 references
    0 references
    0 references
    20 October 2016
    0 references
    set functors
    0 references
    terminal coalgebra
    0 references
    terminal chain
    0 references
    filter functor
    0 references

    Identifiers