Codex Wiki OurBigBook logoOurBigBook.comSite Source code
For distinct and distinct , take all clauses
The first family says that each is paired with at most one ; the second says that each is paired with at most one . There is no existence clause, so the domain may be any subset of . Thus the relations are exactly the injective partial functions from to .
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. I
  2. 16I
  3. Paper 1
  4. Ii
  5. 2024
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home