ohthatpatrick Wrote:
You're making it seem like
~(A --> B)
gives us certain ideas such as ~A and/or ~B.
It wouldn't give us anything like that.
Could you please refer to where I said ~(A-->B) would allow us to infer ~A and/or ~B? It would allow us to infer A and/or ~B. Here's a quick demonstration: A-->B is equivalent to ~A v B, so ~(~A v B) is A ^ ~B, which allows us to separately infer A and ~B.
ohthatpatrick Wrote:
(I also don't think you're using 'tautology' right -- isn't that a self-justifying truth, like "This sentence is in English"?)
I did not use tautology. I'd be grateful if you could refer to where I said it in my posts.
Three things I want to address more generally:
(1) Negating conditionals
A conditional of the form (P-->Q) allows us to infer (~P v Q). Check the truth table below to verify:
P | Q || P-->Q | ~P v Q
T | T || T
T T | F T
T T
T | F || T
F F | F T
F F
F | T || F
T T | T F
T T
F | F || F
T F | T F
T F
Replacing P with PFJ and Q with IPB, here's how it looks:
PFJ | IPB || PFJ-->IPB | ~PFJ v IPB
T | T || T
T T | F T
T T
T | F || T
F F | F T
F F
F | T || F
T T | T F
T T
F | F || F
T F | T F
T F
The truth values of PFJ-->IPB and ~PFJ v IPB are identical under their main connectives (bolded), meaning they are both (a) equivalent to each other and (b)
consequences of one another (i.e., there is no row in which PFJ-->IPB is true and ~PFJ v IPB false). This will allow us to infer PFJ and/or ~IPB from ~(PFJ-->IPB)
as I demonstrate formally below. (2) Proof
We want to prove that ~(PFJ-->IPB) allows us to infer PFJ and ~IPB. Let's use the formal deductive system Fitch.
We are given:
1. ~(
PFJ-->IPB)
We want to prove PFJ and/or ~IPB can be inferred:
2. ~(
~PFJ v IPB) ; tautological consequence: line 1 (see truth table above)
3. ~~PFJ ^ ~IPB ; application of DeMorgan's law: line 2
4. ~~PFJ ; conjunction elimination: line 3
5. PFJ ; negation elimination: line 4
6. ~IPB ; conjunction elimination: line 3
So, ~(PFJ-->IPB) does indeed allow us to infer PFJ and ~IPB. The important step here is that PFJ-->IPB can be transformed to ~PFJ v IPB; or A-->B can be transformed to ~A v B.
(3) Tautological consequence
I use tautological consequence the way it is traditionally used in formal logic: demonstrating consequence by virtue of truth-functional connectives. I did not use tautology (as I previously mentioned).
Using your example of moms and chocolate, let's now describe a language where:
the unary predicate Mom denotes "x is a mom"
the binary predicate Likes denotes "x likes y"
the individual constant "c" denotes chocolate
Ax denotes the universal quantifier
Ex denotes the existential quantifier
<--> denotes logical equivalence
We want to express "not all moms like chocolate". We can do so in one of two ways in our language:
~Ax(Mom(x)-->Likes(x, c)) <--> to Ex(Mom(x) ^ ~Likes(x, c))
Proof below
1. ~Ax(Mom(x)-->Likes(x, c))
2. Ex~(Mom(x)-->Likes(x, c)) ; first-order consequence: line 1
3. Ex~(~Mom(x) v Likes(x, c)) ; tautological consequence: line 2
4. Ex(~~Mom(x) ^ ~Likes(x, c)) ; DeMorgan's: line 3
5. Ex(Mom(x) ^ ~Likes(x, c)) ; negation elimination: line 4
Further information on the justification of each step follows:
2: "Not everything" is the same as "something isn't" (more formally, "It is not the case that for every object x in our domain..." is the same as "There exists an object x in our domain such that it is not...")
3: P-->Q is equivalent to ~P v Q; see truth table above
4: DeMogan's Laws: ~(P v Q) <--> ~P ^ ~Q ; ~(P ^ Q) <--> ~P v ~Q
5: ~~P <--> P
Now, let's check if they're equivalent simply by virtue of their truth-functional connectives. Using the truth-functional algorithm for our language we get: ~
Ax(Mom(x)-->Likes(x, c)) or (~P); and
Ex(Mom(x) ^ ~Likes(x, c)) (or Q). But ~P <--> Q does not hold. These sentences are, thus, logically equivalent but not equivalent by virtue of their truth-functional connectives.
With ~(PFJ-->IPB) we don't rely on quantifiers or the meaning of predicates to demonstrate consequence (that we can infer PFJ and/or ~IPB). I wanted to specifically demonstrate that PFJ and ~IPB are both a consequence of ~(PFJ-->IPB)
simply by virtue of their truth-functional connectives -- the strictest form of consequence -- which I why I used the term.
--
Apologies in advance for the volume of information. I definitely was not planning on responding at length. I did feel compelled to respond, however, after the strong language in your post. Hope this clarifies any confusion!