## Abstract A choice set for a computable linear ordering is a set which contains one element from each maximal block of the ordering. We obtain a partial characterization of the computable linear orderβtypes for which each computable model has a computable choice set, and a full characterization i
Ranking functions and axioms for linear orders
β Scribed by W.J. Walker
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 436 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Suppose that n competitors participate in r races so that each competitor obtains a result consisting of r platings. The set of all possible results can be given a lattice structure. This structure is a partially ordered set with the notion of dimension defined in terms of linear orders which extend the partial order. This notion is investigated for linear orders which satisfy certain axioms. Previous work has shown how these axioms arise naturally when the ranking of the set of all results is carried out using a ranking function.
π SIMILAR VOLUMES
Coordinate independence assumptions, also known as cancellation conditions, play a central role in the representational theory of measurement for an ordering relation on a finite Cartesian product set A1ΓA2Γβ’ β’ β’ΓAm. A sequence of increasingly complex cancellation conditions is known to be sufficien
## Abstract We present a rationale for the Hirschβindex rankβorder distribution and prove that it is a power law (hence a straight line in the logβlog scale). This is confirmed by experimental data of PyykkΓΆ and by data produced in this article on 206 mathematics journals. This distribution is of a