Symbolic Logic A
You can view this site just like any web site. If you want to be able to edit it, you must
register. Once you have a
WikiName and password, all you have to do is click the edit link above. Most mathematical symbols can be displayed using the
LatexModePlugin, which accepts most
LaTeX? constructs. There is a quick tutorial on the
LaTeX? page. The symbols should display correctly in any browser. If you have trouble let
ShaughanLavine know. Here is a list of TWiki
TextFormattingRules.
--
ShaughanLavine - 04 Nov 2004
--
BrendanMoloney? - 14 Dec 2004
Ok, here's my attempt at proving the first rule in exercise 4.5, pg 67. I don't know how to do substitution notation so i use / instead.---You use \frac{a}{x} (fraction) for a/x. I've fixed them below.--
ShaughanLavine - 15 Dec 2004
Suppose

. Then choose some arbitrary interpretation

* such that

, we must show that

. By the definition of satisfaction we know that there is an

such that

. Since

,

. Using the definition of satisfaction again, we get

.
I'm not sure if the following part is really required, but i figure its better to be too explicit than not explicit enough. *It is not only not required, it is wrong: your reasoning is correct, but it presumes that

is satisfiable. What needs to be shown is that
if

, then

, which will certainly be true ("vacuously") if there is no

such that

in the first place.* --
ShaughanLavine - 15 Dec 2004
*We know that such an interpretation exists because if

then using the Conincidence lemma we can conclude that for any

that

iff

, if

then we simply restrict ourselves to the interpretation

hence

iff

.
--
BrendanMoloney? - 14 Dec 2004
Hi there. I'm posting up my attempts at exercise 2.7 (page 63) for some feedback. Part a seems easy enough, but I think I'm doing something wrong in part b.
a)
| 1. |
|
premise |
| 2. |
|
premise |
| 3. |
|
VS applied to 1 |
| 4. |
|
VS applied to 2 |
| 5. |
|
VA applied to 3 and 4 |
b)
| 1. |
|
premise |
| 2. |
|
premise |
| 3. |
|
Ant. on 1 |
| 4. |
|
Assm. on 3 |
| 5. |
|
Ant. on 2 |
| 6. |
|
Assm. on 5 |
| 7. |
|
VA on 4 and 6 |
--
JohnTrimble? - 14 Dec 2004
I don't believe that the above answer for 2.7b is correct. The problem is that the assumption of

was added to

and then later it was concluded that somehow

was an assumption of

! I think the heart of the problem is that the Assumption rule was applied inappropriately. I'm fairly certain that the rule turns out to not be true, I'm currently working on a proof of this and will post it when I'm done (if I'm ever done).
Quite right: line 4 is not a legitimate use of Assm. The rule doesn't depend on previous lines--"Assm on line 3" makes no sense. --
ShaughanLavine - 15 Dec 2004
--
JohnTrimble? - 14 Dec 2004
Below is my attempt to disprove 2.7b pg 63. There is a little bit of handwaving going on but I think that it is reasonable nonetheless (unless of course this rule turns out to be true):
Let
Notice that

and

are satisfiable.
Notice that

and
Let

be an abitrary interpretation such that
Either

or
Case 1:
Thus
Case 2:
Similar.
Therefore, the rule is not valid.
--
BrendanMoloney? - 14 Dec 2004
I don't see what is different between what I did in my derivation, and what Shaughan does in the derivation at the bottom of the page. I use the Antecedent rule to add

to the antecedent and then using the Assumption rule to conclude

in the succedent. Shaughan uses the Antecedent rule to add

to the antecedent, and then uses the Assumption rule to conclude

in the succedent. This seems to be a common strategy in derivations, but it does seem a bit weird to me too.
--
BrendanMoloney? - 14 Dec 2004
On closer inspection I think my mistake was to not leave

in the antecedent after applying the Assumption rule. Then I would have to cancel it from the antecedent to get the desired result, which the above proof has convinced me is not possible.
Hi. This is not a solution, just a question about the term model. Ex 1.13 pg 79.
...Does

(the interpretation) depend on the inconsistent set

?
OK, so I know the answer is no, but I am confused as to why it is no. Would the
interpretation not be different if

was in fact consistent? If yes, then doesn't

depend on the inconsistent set? If no, why not? Has anyone worked out this problem? If so please explain it to me.
Thanks
For a given language there is a consistent theory

in the language such that

is the same as

for an inconsistent

in the language: Just let

be the set of all formulas satisfied by

. The sense in which it is claimed that the interpretation does not depend on an inconsistent set of formulas is just that if Inc

and Inc

and

and

are sets of formulas of the same language, then

.
--
ShaughanLavine - 09 Dec 2004
So, It's not asking if the interpretation depends on whether or not the set is consistent or inconsistent? It's just asking if it depends on which inconsistent set?
This makes much, much, much more sense. Thanks
--
DesertMermaid? - 10 Dec 2004
P.S.
Sorry I didn't use notation, I couldn't get the symbols on the same line with regular text and it just looked bad.
I fixed them. --
ShaughanLavine - 09 Dec 2004
Hello out there in Symbolic Logic World! I see nobody has posted anything here besides Shaughan. Well im going to change that

post some problems I did involving substitution if anyone besides Shaughan reads this please feel free to comment on my work.
Page 57 8.9 exercise (a)
Solution:
Here you can find other
SubstitutionProblems? from 8.9 exercise
ShaughanLavine here. I've made one minor correction above: The original had

where it should have just had =. We're asserting in the metalanguage that certain metalinguistic expressions involving substitution notation represent the same formula of our official language. That is not an assertion
in the language, but one made in English
about it, and so the identity sign of English, namely =, is appropriate. The solution isn't quite correct. It should read as follows:
Since both atomic formulas are in the scope of quantifications over both

and

, both of those substitutions get ``cancelled'' for both of them.
Here is an attempt at proving some rules on page 64 3.3 (b)
Solution
I'am not sure how to add notes to the side after each line. Also those dashes should be blank spaces which I am too not able to produce.
Yet again I don't know how to put things after the lines so here they are.
Line 1:premise
Line 2:(Ant) on line 1
Line 3:Assm
Line 4:(Ctr) on lines 2 and 3
ShaughanLavine again. Here is the derivation with the justifications next to the lines. I don't know why you think blanks or dashes were required, and so I've omitted them. The derivation is just like the one you gave. I've left both because it may be helpful to people trying to figure out how the Wiki works. The boxed

was a typo. I've replaced it with the correct

.
| 1. |
|
premise |
| 2. |
|
(Ant) on line 1 |
| 3. |
|
Assm |
| 4. |
|
(Ctr) on lines 2 and 3 |
Here a few other
JustificationsofRules? from 3.3 and derivations from exercise 3.6 page 65.
Latex rendering error!! dvi file was not created.