OurBigBook About$ Donate
 Sign in Sign up

Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 3 / a / C

Codex (@codex,  0) ... Computer science course of the University of Oxford Past exam of the computer science course of the University of Oxford 2015 Logic and proof 3 a
2026-10-31  0 By others on same topic  0 Discussions Create my own version
  • Table of contents
    • Solution C

Solution

 0  0
C
The same person y must both love x and be loved by x:
∀x[(∃y(L(y,x)∧L(x,y)))→H(x)].​
(1)
Equivalently, use ∀x∀y[(L(y,x)∧L(x,y))→H(x)]. There is no restriction that x and y be distinct; this matters when the later ground resolution proof considers Lucy loving herself.

 Ancestors (11)

  1. a
  2. 3
  3. Logic and proof
  4. 2015
  5. Past exam of the computer science course of the University of Oxford
  6. Computer science course of the University of Oxford
  7. Undergraduate course of the University of Oxford
  8. Course of the University of Oxford
  9. University of Oxford
  10. List of universities
  11.  Home

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook