solakis1
- 407
- 0
it has been claimed that in an argument false premises can never produce a correct conclusion.is that correct ??
The discussion centers on the validity of arguments with false premises leading to true conclusions, specifically within the context of mathematical logic. Participants reference the notation $\Gamma\models A$ to denote logical consequence and explore examples such as $p\land\neg p\models q\to q$. The consensus is that while an argument can be valid despite having false premises, the definition of validity varies when dealing with fixed truth values, such as in propositional calculus. The need for clarity in definitions of valid arguments is emphasized throughout the conversation.
PREREQUISITESStudents of philosophy, mathematicians, and anyone interested in the foundations of logical reasoning and argumentation.
Is the following argument valid?Evgeny.Makarov said:"An argument" is not a term that is used in most textbooks of mathematical logic. What Copi calls a valid or invalid argument is a true (correspondingly, false) claim about logical (or semantic) consequence. This claim is usually denoted by $\Gamma\models A$ where $\Gamma$ is a set of formulas and $A$ is another formula.
That said, a valid argument with false premises can definitely have a true conclusion. For example, $p\land\neg p\models q\to q$ is a valid argument (form).
okay let me get rid of the +,=Evgeny.Makarov said:Since the term "argument" is not usually used in books on mathematical logic, as I wrote above, I am not familiar with the definition of a valid argument when it involves digits, + and =. If the statements occurring in an argument are proposition or predicate formulas that consist of some generic propositional variables, functionl and predicate symbols, then I believe I know the definition, but not when formulas have symbols that usually have a fixed meaning.
Your argument involves not just propositional variables, but propositional constants (such as "London is in England"), which have fixed truth values.Evgeny.Makarov said:If the statements occurring in an argument are proposition or predicate formulas that consist of some generic propositional variables, functional and predicate symbols, then I believe I know the definition, but not when formulas have symbols that usually have a fixed meaning.
OK and one of the substitution instances of this argument form is my argument in post No 6Evgeny.Makarov said:The argument that derives $\neg q$ from $p\to q$ and $\neg p$ is not valid. You most likely already know this.
And I am telling you again:solakis said:And i ask you again is the argument in that post valid?
And knowing your tendency to conceal the definitions you use, I expect you to ask this question several more times without revealing the definition or the reason for your question.Evgeny.Makarov said:If the statements occurring in an argument are proposition or predicate formulas that consist of some generic propositional variables, functional and predicate symbols, then I believe I know the definition, but not when formulas have symbols that usually have a fixed meaning.