| |||||||||||
| |||||||
| Important Notice |
| Logic The study of the principles of reasoning, especially of the structure of propositions as distinguished from their content and of method and validity in deductive reasoning. Mathmatics. |
![]() |
| | LinkBack | Thread Tools |
| ||||
| 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! |
| ||||
| Re: How do I express this in FOL?
First order logic; propostional logic w/ existential quantifiers; First-order logic - Wikipedia, the free encyclopedia |
| The Following 2 Users Say Thank You to Protoman2050 For This Useful Post: | ||
| |||||
| Re: How do I express this in FOL?
Why do you want to express this in FOL? BTW why not UML? Isn't the expression you want to arrive at an app?
|
| ||||
| Re: How do I express this in FOL? Quote:
|
| |||||
| Re: How do I express this in FOL?
In quantificational logic, (x) (Cx<->Wx) translates as; For any (x), C(x) if and only if W(x). Your elaboration paints a different picture. For FOL...you would need to assert something (i.e. universal or existential quantifier) to establish a categorical syntactical structure (unless you are assuming it). Also, you would need to elaborate on the sentence constants (i.e. C and W) to show what exactly you are trying to prove. Also, you may want to reconsider your notation with the bi-conditional and quantificational logic. |
| The following users say: THANK YOU - VideCorSpoon for the above post! | ||
| ||||
| Re: How do I express this in FOL? Quote:
for all x(W(x) -> there exists y(C(y) & R(x,y))) & for all x(C(x) -> there exists y(W(y) & R(x,y))) Can you show me how that would be read and what that would look like as symbols? Thanks! |
| |||||
| Re: How do I express this in FOL?
You may be over complicating the process of quantificational logic. First and foremost, what is the literal argument for the existence of God you are trying to convey? It’s difficult to interpret what you are trying to convey without a literal example. Also when you refer to the grammatical quantifier “linked,” I’m assuming that you intend a conditional rather than a bi-conditional. Take this for example… (x) (Cx --> Wx) (note: I substituted the bi-conditional for the conditional because of the lingual assumption.) That formula translates as follows (in the universal affirmative); Every x such that x is C such that x is W. Also, there are universal affirmatives here, but in your elaboration you use existential quantifications. This violates wff. You may want to revise that portion. |
| ||||
| Re: How do I express this in FOL?
I am trying to convey the idea that, for every word, there are one or more ideas associated w/ it, and for every idea, there are one or more words associated w/ it.
|
| The following users say: THANK YOU - Protoman2050 for the above post! | ||
| |||||
| Re: How do I express this in FOL?
Oh. You don't need to go into quantificational logic for that. You can stay within the realm of propositional logic and still accomplish your goal without predicative inferences. All you need is a standard bi-conditional and a truth table to prove it. |