#Propostional logic
38 messages · Page 1 of 1 (latest)
- Wait patiently for a helper to come along.
- Once someone helps you, say thank you and close the thread with:
+close
- Feel free to nominate the person for helper of the week in #helper-nominations
- Do not ping the mods, unless someone is breaking the rules.
- If you're happy with the help you got here, and the server overall, you can contribute financially as well:
i mean, each element of A is just some function of the variable a
that returns true or false
so can you enumerate all possible statements that follow that
i still dont understand
the A/R<-> means the set of equivalence classes of A with equivalence relation R<->
aka, it's the sets of sentences, so that any 2 sentences in a particular set, are equivalent to each other
oh so
the sentences need to have an equivalence relation, transitive, reflexive and symmetric
indeed, you can check that R<-> satisfies all of those
it says only using the variable a
like for example a^a is equivalent to a
if we dont use intermediate values then it can only be a ^ a, a V a
that seems to small of a set
both of which are just a
ye but only 2 sentences form
i mean in the set
those are just 2 elements of A
R is the set of pairs of elements of A that are equivalent to one another
True that
so the equivalence class will also be infinite?
im very new to equivalence stuff
depends what you mean
like
each equivalence class (of which there are 1) has infinitely many elements, i guess you could say that
$[a_{r}] = {x \mid aRx}$
XE