document.write( "Question 1041461: Hello, can you please help me with this problem?\r
\n" ); document.write( "\n" ); document.write( "Use one of the indirect proof techniques (reductio ad absurdum or conditional proof) to demonstrate the validity of the argument. \r
\n" ); document.write( "\n" ); document.write( "~S → (F → L), F → (L → P), therefore, ~S → (F → P) \n" ); document.write( "

Algebra.Com's Answer #656418 by jim_thompson5910(35256) $\"\"$ $\"About$

You can put this solution on YOUR website!

\n" ); document.write( "I'm going to use a conditional proof\r
\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "\n" ); document.write( "

Number	Statement	Lines Used	Reason
1		~S -> (F -> L)
2		F -> (L -> P)
:.		~S -> (F -> P)
\|	3	~S		ACP
\|	4	F -> L	1,3	MP
\|	5	(F & L) -> P	2	Exp
\|	6	(L & F) -> P	5	Comm
\|	7	L -> (F -> P)	6	Exp
\|	8	F -> (F -> P)	4,7	HS
\|	9	(F & F) -> P	8	Exp
\|	10	F -> P	9	Taut
11		~S -> (F -> P)	3-10	CP

\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Abbreviations/Acronyms Used:
\n" ); document.write( "ACP = Assumption for Conditional Proof
\n" ); document.write( "CP = Conditional Proof
\n" ); document.write( "Comm = Commutation
\n" ); document.write( "Exp = Exportation
\n" ); document.write( "HS = Hypothetical Syllogism
\n" ); document.write( "MP = Modus Ponens
\n" ); document.write( "Taut = Tautology
\n" ); document.write( " \n" ); document.write( "

\n" );