Elementary Properties of the Finite Ranks
Copyright policy )Elementary Properties of the Finite Ranks
AbstractThis note investigates the class of finite initial segments of the cumulative hierarchy of pure sets. We show that this class is first‐order definable over the class of finite directed graphs and that this class admits a first‐order definable global linear order. We apply this last result to show that FO(<, BIT) = FO(BIT).
- University of Amsterdam Netherlands
- University of Pennsylvania United States
- Haverford College United States
- Swansea University United Kingdom
descriptive complexity theory, Complexity of computation (including implicit computational complexity), finite initial segments of the cumulative hierarchy of pure sets, finite rank, Model theory of finite structures, first-order definability, finite directed graphs
descriptive complexity theory, Complexity of computation (including implicit computational complexity), finite initial segments of the cumulative hierarchy of pure sets, finite rank, Model theory of finite structures, first-order definability, finite directed graphs
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).12 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!