On Sun, Jan 9, 2011 at 3:31 PM, And Rosta<and.rosta@gmail.com> wrote:
Jorge Llambías, On 09/01/2011 14:44:
You don't spell out the solution. Presumably it was something like:
do djica ma poi cmima ... ce ... ce ... ce ...
But you don't really need to use sets, you could also say:
do djica ma poi me ... .a ... .a ... .a ...
Symmetrical connectives reduce logically to quantification over sets.
"A or B (or C)" = "at least one from {A,B(,C)}"
"A and B (and C)" = "each one from {A,B(,C)}"
Yes.
"A xor B (xor C)" = "exactly one from {A,B(,C)}"
Not really. At least it's not very clear what you mean by "A xor B (xor C)"
If A, B and C are propositions, and "xor" is the usual binary
connective, then "A xor B xor C", with either left or right grouping,
means "either exactly one or all three of A, B, C". (More generally,
adding more "xor"s, any odd number of the propositions.) But probably
"... xor ... xor ..." is not meant to be the composition of two binary
connectives.
alternatival OR is:
"A alt-or B (alt-or C)" = "which one(s) from {A,B(,C)}"
and for the alternatival exclusive OR:
"A alt-xor B (alt-xor C)" = "which one from {A,B(,C)}"
So I'd argue that "do djica ma poi cmima ... ce ... ce ... ce ..." is
logically the most basic.
I'm not sure I understand the argument. "ma poi cmima X" and "ma poi
me Y", where X is the set of referents of Y, are exactly equivalent.
Why is one more basic than the other?