MHB How to Approach a Logic Proof Involving Conditionals?

  • Thread starter Thread starter averyjedwards2
  • Start date Start date
  • Tags Tags
    Logic Proofs
averyjedwards2
Messages
4
Reaction score
0
hi! I've been studying formal proofs for my logic final and i had a question on this one that i found in my textbook:
1.)~P\supset(horseshoe)U
2.)P\supsetF
3.)F\supsetU\thereforeU

i just have had a little trouble in the past getting started with proofs. Can anyone give me a little push and maybe start me out with this proof? thank you!
 
Physics news on Phys.org
Re: Formal Proofs Help!

Hi!

First, since you are already using LaTeX commands, I suggest enclosing your formulas in dollar signs. Note, however, that tokens that start with a letter must be separated from a previous command (that start with a backslash) with a space. For example, F should be separates from the preceding \supset, which gives $\supset F$. Otherwise, \supsetF will be considered as one undefined command.

Second, I am not sure what your problems are about: sets, propositional logic or something else. Please describe the context and the notations used, such as ~, $U$ and $F$.
 
Re: Formal Proofs Help!

okay thanks for the help! also I'm working on proving this using the 19 rules of inference
 
Re: Formal Proofs Help!

averyjedwards2 said:
I'm working on proving this using the 19 rules of inference
This helps, but you have not answered other questions.
 
Re: Formal Proofs Help!

averyjedwards2 said:
hi! I've been studying formal proofs for my logic final and i had a question on this one that i found in my textbook:
1.)~P\supset(horseshoe)U
2.)P\supsetF
3.)F\supsetU\thereforeU

i just have had a little trouble in the past getting started with proofs. Can anyone give me a little push and maybe start me out with this proof? thank you!

You mean Given :

1. ~P=>U

2. P=>F

3. F=>U ,then prove U

4. ~U..............ASSUMPTION for contradiction
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top