# Boolean Logic - Many simple questions

1. Nov 10, 2007

### Goldenwind

[SOLVED] Boolean Logic - Multiple simple questions

My professor, he's a good, witty guy. He wasn't satisfied with other textbooks, so he decided to write his own. Since it's not published yet, we get a free pdf version of it, downloadable.

Sadly, despite how good of a person he seems to be, he can't write a textbook for anything. It's very difficult to read without a dictionary and wikipedia at my side, and he fails to define many symbols and techniques, as well as providing zero examples or sample problems.

So, now that we have an assignment, I'm lost, naturally. I'm very capable of doing this assignment on my own, however I have absolutely no clue what they're asking, as he never defined what half of these symbols and words mean.

As such, I have a handful of small questions.
In advance, thank-you for any information given; you're helping save my education :)

1) $A, A \rightarrow B \vdash B$ - SOLVED -
I know what 'A' is, and I know what $A \rightarrow B$ is. But what does it mean when you have a list of variables to the left of a $\vdash$ symbol? What does $\vdash$ mean, and what does the entire phrase mean?

2) $$\frac{A, A \equiv B}{B}$$ - SOLVED -
Is this division? I think it has something to do with my first question, but again, I wouldn't have a clue. What does this fraction-like formation mean?

3) $\vdash (A \rightarrow (B \rightarrow C))$ - SOLVED -
Again, similar to my first question... if there is no list to the left of $\vdash$, what does this mean? It may not matter, but since I don't know the answer to the first question, I haven't a clue.

4) What's the difference between t, f, T, and $\perp$? In theory, t and T both mean true, but apparently there's some kind of difference, as I lost marks for this. - SOLVED -

5) What is the letter $\Gamma$ used for in this subject? It seems to be a set of formulae, or some kind of set, since my professor has been using $\subset$ and $\subseteq$ with it. - SOLVED -

6) $T \equiv \perp \equiv \perp$ - SOLVED -
I think this is saying that the statement "True = False" is false, but what does it mean when it has even more than two $\equiv$ signs, such as $\perp \equiv \perp \equiv A \equiv A$? This likely has to do with hidden brackets, or my lack of understanding of the order of operations.

7) What is the difference between $\vdash$ and $\models_{taut}$? - SOLVED -

Last edited: Nov 11, 2007
2. Nov 11, 2007

### D H

Staff Emeritus
This looks more like propositional calculus than boolean logic. I'll help where I can.

Given that A and A implies B are separately true statements, therefore B is a true statement.

It is tautologically true that A implies (B implies C).
Except that is not the case. A=T,B=T,C=F. B->C=F, A->(B->C)=F

It's his nomenclature, so what does he say in his notes and in class? While you are not entitled to a better grade because you think otherwise, you certainly are entitled to an explanation regarding why you lost marks. Don't be argumentative. Just ask for an explanation.

"That true is tautologically false is tautologically false'

3. Nov 11, 2007

### Goldenwind

If so, what is the difference between $\vdash$ and $\models_{taut}$?

4. Nov 11, 2007

### D H

Staff Emeritus
More or less the same as the difference between $=$ and $\equiv$.

There is no such thing as one standard nomenclature for propositional calculus and boolean algebra. Most textbooks have a nomenclature section. If yours doesn't, ask your instructor.

A bit of reference on where these expressions arise would help. A Rosetta Stone would be nice ...

5. Nov 11, 2007

### Goldenwind

Thanks, marked a few more as solved now. :)

Looking back at 6, in lamens terms, would it be okay to say that the first equation means "It is untrue that 'True = False'."?

And also in lamens terms, what would the second equation mean?

Edit: Also, as you can see by my post count, I'm new here - is there any way I can give you homework helper points, or something that helps contribute to your awards? You're really saving my education here :P

Last edited: Nov 11, 2007
6. Nov 11, 2007

### CompuChip

Reading back, I think you should read the answer to 5) first, or maybe even read the answers to 5) and 1) simultaneously... anyway I hope it's clear

$\Gamma \vdash \phi$ means: there is a proof with assumptions $\Gamma$ and conclusion $\phi$. So if the question is $A, A \rightarrow B \vdash B$, he most likely means: give a proof of B, assuming A and A -> B. Of course it is equivalent to prove $[ A \wedge (A \rightarrow B) ] \rightarrow B$

The fraction-like notation is another way of writing it. Instead of $\Gamma \vdash \phi$ we can also write
$$\frac{\Gamma}{\phi}$$.
This notation seems a bit cumbersome, but (you'll probably learn later) that you can build clear proof trees from it, where each intermediate conclusion is under a bar with the assumptions to reach it above it (and you can even write the inference rule used to derive it next to it). E.g. the solution to 1) would be written
$$\frac{A \qquad A \rightarrow B}{B} \quad \mathrm{\rightarrow E}$$
where I annotated the inference rule I used to derive B from the assumptions.

For 3): $\vdash \phi$ is a shorthand for $\emptyset \vdash \phi$, which just means: $\phi$ is provable without assumptions, in other words: $\phi$ is a tautology (e.g. $\vdash A \rightarrow A$ is true).

For 4): I don't think there is a difference. I usually use the latter two (T and inverse-T or perp-sign). You should ask your prof which convention is used in your class.

5) As I said before, $\Gamma$ is a set of formula (usually, assumptions). For example, I could formulate 1) as :
Define $\Gamma := \{ A, A \rightarrow B \}$. Prove that $\Gamma \vdash B$.

6) I don't quite see it either. I would say the notation
$$A \equiv B \equiv C$$
means that A, B and C are (pairwise) equivalent, that is,
$$A \vdash B, B \vdash A, A \vdash C, \text{ etc.}$$
but I don't quite see the use of this particular example. Of course, $\perp$ is equivalent to $\perp$; and if T is equivalent to $\perp$ then it is equivalent to $\perp$ as well.

Ah, I just realized (rather late) that the T in the statement is the "True" symbol. If you read it as I said above, then indeed $\mathsf{T} \equiv \perp$ is not true, even though $\perp \equiv\perp$ is.

Last edited: Nov 11, 2007
7. Nov 11, 2007

### MathematicalPhysicist

1. it means that B is deducible from A and A->B.
2. the line means exactly like in 1, i.e that B is deducible from A and A<->B.
3. it means usually that A->(B->C) is provable, deducible from the axioms schema you have in the system.
4. well i dont know what it means in your terminology but perhaps it means that t is to mention if a proposition is satisfiable, i.e that it has a truth function which gives the proposition a truth value T.
5. gamma in logic usually means a set of proposiitions or sentences (in predicate logic).
6. my guess here is a wild one, but you look at the truth table of, double material implication then yes the result of T and false gives you false proposition.

8. Nov 11, 2007

### HallsofIvy

Staff Emeritus
Please do NOT post the same thing in different places. I have merged the thread from Math-set theory and logic with this thread.

9. Nov 11, 2007

### Goldenwind

Was never my intent to do so.