| How do I express this in FOL?
I'm trying to express this in FOL:
Every word has at least one concept associated w/ it, and every concept has at least one word associated w/ it. Would it be:
For all (x)(Cx<->Wx)
or
(for all x(w(x) -> there exists y(c(y) & r(x,y)))) & (for all y(c(y) -> there exists x(w(x) & r(x,y)))), where r(x,y) denotes the concept associate w/ the word x. Anyway to make that clearer? What would this actually look like on paper?
Thanks!
|