Timeline for How to do natural deduction effectively?
Current License: CC BY-SA 4.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 3 at 16:49 | comment | added | Dan Christensen | It takes practice to be able to recognize what to do next. Start by doing simpler problems, gradually increasing the level of difficulty. If the solution is not immediately apparent, I usually start by entering the required theorem into a proof checker as an axiom or premise. Then, by a process resembling trial and error, I apply various rules of inference to parts of that statement. Hopefully, the solution will just come to you. | |
Jun 3 at 16:38 | vote | accept | Danilo Jonić | ||
Jun 3 at 3:46 | history | became hot network question | |||
Jun 2 at 21:11 | answer | added | Naïm Favier | timeline score: 5 | |
Jun 2 at 20:15 | comment | added | PW_246 | Unfortunately, without the rules of your system being listed, it’s hard to say how you should proceed. The general idea is that since you’re proving a conjunction, you need to be able to prove both conjuncts. Your elimination rules will be on your premises, and the introduction rules will be for sub-conclusions or your conclusion. You’ll want to do $\lor$ elimination on $\neg (q \to r) \lor t$. For the second one, you’ll want to use double negation elimination, since you’ll want to show that $\neg p$ leads to a contradiction. | |
Jun 2 at 19:44 | history | asked | Danilo Jonić | CC BY-SA 4.0 |