Combining Texts

Ideas for 'Mahaprajnaparamitashastra', 'A Tour through Mathematical Logic' and 'Existence,Ontological Commitment and Fictions'

unexpand these ideas     |    start again     |     choose another area for these texts

display all the ideas for this combination of texts

---

2 ideas

4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / b. Terminology of PL

13520	A 'tautology' must include connectives [Wolf,RS]
	Full Idea: 'For every number x, x = x' is not a tautology, because it includes no connectives.
	From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.2)

4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / c. Derivation rules of PL

13524	Deduction Theorem: T∪{P}|-Q, then T|-(P→Q), which justifies Conditional Proof [Wolf,RS]
	Full Idea: Deduction Theorem: If T ∪ {P} |- Q, then T |- (P → Q). This is the formal justification of the method of conditional proof (CPP). Its converse holds, and is essentially modus ponens.
	From: Robert S. Wolf (A Tour through Mathematical Logic [2005], 1.3)