- 1. What is the name of the ternary relation defined on a set X?
A) Equivalence relation
B) Cyclic order
C) Linear order
D) Partial order
- 2. Which axiom states that if [a, b, c] holds, then [b, c, a] must also hold?
A) Transitivity
B) Connectedness
C) Cyclicity
D) Asymmetry
- 3. If [a, b, c] implies that [c, b, a] is false, which axiom is satisfied?
A) Connectedness
B) Asymmetry
C) Transitivity
D) Cyclicity
- 4. Which axiom requires that for three distinct elements, either [a, b, c] or [c, b, a] is true?
A) Asymmetry
B) Connectedness
C) Transitivity
D) Cyclicity
- 5. What is a ternary relation called if it satisfies the first three axioms but not necessarily connectedness?
A) Total cyclic order
B) Simple cyclic order
C) Partial cyclic order
D) Linear cyclic order
- 6. Who considered alternative lists of axioms for cyclic orders in 1916 and 1924?
A) Edward Huntington
B) Kurt Gödel
C) Bertrand Russell
D) George Cantor
- 7. Which condition is necessary for [a, b, c] in a linear order induced cyclic order?
A) a < b < c or b < c < a or c < a < b
B) a < b < c
C) a < c < b
D) c < b < a
- 8. What can be done to a deck of cards to illustrate cyclic rearrangements?
A) Cutting
B) Dealing
C) Shuffling
D) Stacking
- 9. What remains after cutting a single point out of a cyclically ordered set?
A) A linear order
B) A cyclic order
C) A set with no order
D) A partial order
- 10. Adjoining 'a' as a greatest element to the linear order results in which type of cut?
A) A cyclic rearrangement
B) An asymmetric cut
C) A principal cut with least element a
D) A cut with greatest element a
- 11. Transitivity in a cyclic order implies that if [a, b, c] and [a, c, d] are true, then which must be true?
A) [c, a, b]
B) [b, c, d]
C) [a, b, d]
D) [d, c, b]
- 12. The axioms for cyclic order are named by analogy with axioms for which type of relation?
A) Reflexive relation
B) Partial order
C) Strict linear order
D) Binary equivalence
- 13. What mathematical object is mentioned as an example of an infinite cycle?
A) A Euclidean plane
B) The set of integers
C) A finite sequence
D) The unit circle, S1
- 14. Why can we not rely on an immediate successor relation in an infinite cyclic order?
A) Points may not have successors
B) The set is not ordered
C) Successors are only defined for finite sets
D) The set is too small
- 15. In the context of the unit circle, what happens if you try to pick a 'next point' after a given point?
A) The next point is the origin
B) There is no next point
C) The next point is defined by a binary relation
D) The next point is always clockwise
- 16. Why can we not use a binary relation to determine which of two points comes first on a circle?
A) Binary relations are not allowed on infinite sets
B) Points are not distinct
C) Each point follows the other
D) Only ternary relations exist for circles
- 17. What type of relation is used to denote that elements occur after each other on a circle?
A) Binary relation
B) Unary relation
C) Quaternary relation
D) Ternary relation
- 18. Which requirement, when dropped from the definition of a cyclic order, results in a partial cyclic order?
A) Asymmetric
B) Connected
C) Transitive
D) Cyclic
- 19. How many notes are in the chromatic scale, which is an example of a finite cycle?
A) Four
B) Twelve
C) Three
D) Seven
- 20. What is a set with a cyclic order called?
A) A binary set
B) A transversal set
C) A linear set
D) A cyclically ordered set
- 21. What is the equivalent of a cyclic order on a set X with n elements?
A) A binary relation
B) A linear permutation
C) A circular permutation
D) A subset
- 22. How many linear orders induce a given cyclic order on a set of n elements?
A) n!
B) n
C) (n-1)!
D) n-1
- 23. How many possible cyclic orders exist for a set of n elements?
A) n!
B) (n-1)!
C) n
D) 2n
|