Yahoo Answers is shutting down on May 4th, 2021 (Eastern Time) and beginning April 20th, 2021 (Eastern Time) the Yahoo Answers website will be in read-only mode. There will be no changes to other Yahoo properties or services, or your Yahoo account. You can find more information about the Yahoo Answers shutdown and how to download your data on this help page.

How do I express this in first order logic?

Hey guys, I need some help translating this into first order logic.

--------------------------------------------------------------------------

Let G be a set and " * " a binary operator on G.

Show the following statement in first order logic:

for all f,g ∈ G, (f * g) is an element of G.

------------------------------------------------------------------

Update:

We can define things such as:

Let setG(x) be true if and only if x is an element of G... and start the question out like this:

∀f ∀g ( set(f) (and) set(g) -----> ...

Not sure how to use binary operator from here

1 Answer

Relevance
  • 1 decade ago

    Logic is not that foiled. Logic is so much more present

Still have questions? Get your answers by asking now.