Comprehensive Guide to Argument Evaluation: ARG Conditions, Validity, and Truth Functions

The ARG Method and Evaluation of Arguments

• The ARG method provides a systematic three-part framework to assess whether an argument supplies sufficient reasons to justify its conclusion:

  • $A$ represents Acceptability: Whether the premises themselves are acceptable or reasonable to believe.
  • $R$ represents Relevance: Whether the premises bear an appropriate and substantive relation to the conclusion.
  • $G$ represents Good Grounds: Whether the premises provide sufficient or adequate support to infer the conclusion.

• Purpose and function of the ARG test:

  • It serves as an evaluative mechanism to uncover, clarify, and organize one's actual assessment of an argument in an orderly manner.
  • It enables an evaluator to progress methodically from asking "Is this argument good?" to determining "Is it cogent?"

Distinguishing Cogency, Validity, and Soundness

• Precise nature of validity:

  • Validity has a rigorous, exact definition: it is strictly impossible for all premises to be true while the conclusion is false.
  • Validity is an objective property of argument structure. It is applied either correctly or incorrectly, leaving no room for subjective debate.

• Subjectivity and divergence in cogency:

  • Cogency asks whether an argument provides adequate rational justification to believe its conclusion.
  • Unlike validity, reasonable individuals possessing different background beliefs can legitimately arrive at conflicting evaluations regarding an argument's cogency.
  • Evaluative disagreements typically emerge over the acceptability of premises, the relevance of premises, or the sufficiency of grounds within non-deductive arguments.

• Soundness versus cogency:

  • Soundness is traditionally defined in classical formal logic as an argument that is both deductively valid and composed entirely of true premises.
  • Many standard introductory logic textbooks define a good argument strictly as a sound argument.
  • This textbook view is inadequate for real-world argumentation, necessitating the broader framework of cogency over mere soundness.

The Good Grounds Criterion

• Definition of good grounds:

  • The grounds criterion evaluates the sufficiency of the reasons offered.
  • It asks whether the premises provide enough evidential weight to license the conclusion, completely independent of whether those premises are acceptable or factually true.
  • An argument may completely satisfy acceptability ($A$) and relevance ($R$), yet completely fail to establish good grounds ($G$).

• Illustrative examples of failed grounds:

  • Meteorological example: "There are some clouds gathering to the west, therefore it is going to storm."
  • Gathering clouds provide some evidence and are relevant, but fail to provide good grounds. The clouds might be the wrong formation, could break apart, or might drift north or south rather than producing a storm locally.
  • Academic preparation example: "You need to study to pass the exam; Kendra studied; therefore, Kendra will pass the exam."
  • Even if both premises are taken as true, they fail the grounds criterion.
  • The premises supply no information regarding how Kendra studied, what materials or chapters were covered, or the duration of study (for instance, whether she merely opened the textbook for five minutes or a single second).
  • Even if both premises were entirely false (e.g., Kendra never studied, and studying was not even required to pass), the argument still fails the grounds requirement structurally because assuming the premises does not render the conclusion likely true.

Deductive Arguments, Semantic Validity, and Formal Validity

• Deductive validity:

  • Deductive arguments aim to guarantee the absolute truth of the conclusion whenever the premises are true.
  • The information in the conclusion is fully contained within the semantic or structural content of the premises.
  • To accept the premises of a deductively valid argument while denying its conclusion constitutes a logical self-contradiction.
  • In evaluating deductive arguments under the ARG framework, the good grounds ($G$) condition is satisfied exclusively by establishing validity.

• Semantic validity:

  • Semantic validity occurs when an argument is valid strictly in virtue of the inherent meanings of the words employed.
  • Circular geometry example: "That shape is a circle; therefore, it is round / it has curvature."
  • Comprehending the definition and meaning of the word "circle" necessitates that the conclusion must be true if the premise is true.
  • Geographic direction example: "Moose Jaw is west of Regina; therefore, Regina is east of Moose Jaw."
  • The argument is valid because of the relational definitions of "east" and "west."
  • It is inconceivable to construct a scenario where Moose Jaw is west of Regina, but Regina is not east of Moose Jaw, unless the words "east" and "west" are misused.

• Formal validity:

  • Formal validity occurs when an argument is valid strictly in virtue of its grammatical form or structural organization, independent of specific semantic content.
  • Any argument possessing a formally valid structure makes it impossible to affirm the premises and deny the conclusion without generating a formal contradiction.
  • Mastering standard formally valid structures provides immediate proof of good grounds ($G$) in argumentative essays, allowing the writer to focus purely on defending premise acceptability ($A$) and relevance ($R$).

Propositional Variables, Schemata, and Possible Worlds

• Schemata and propositional variables:

  • In formal logic, concrete statements are replaced with variables (such as $p$ and $q$) to create an underlying blueprint or argument schema.
  • A variable represents a placeholder that cannot be substituted with arbitrary linguistic fragments, commands, questions, or exclamations (such as "What time does class start?", "How old is Mark Carney?", or an inarticulate yelp).
  • Variables must strictly range over declarative statements (propositions).

• Declarative propositions and possible worlds:

  • A proposition is a declaration of fact asserting that reality is configured in a specific way, possessing a definitive truth value ($\text{True}$ or $\text{False}$).
  • In formal linguistics and the philosophy of language, a proposition functions by partitioning the set of all possible worlds into two distinct subsets:
  • The set of possible worlds in which the proposition is true.
  • The set of possible worlds in which the proposition is false.
  • Classroom population example: The proposition "There are more than three students in class."
  • For any possible world where the student count $n$ satisfies $n > 3$, the proposition belongs to the set of true worlds.
  • For any possible world where the student count satisfies $n \le 3$, the proposition belongs to the set of false worlds.
  • The actual world occupies the true partition because more than three students are physically present.

• Uniform substitution principle:

  • An argument structure is formally valid if and only if any uniform substitution of its propositional variables preserves deductive validity.
  • As long as identical propositions are plugged into every instance of $p$ and $q$ throughout the schema, the inference from premises to conclusion guarantees the truth of the conclusion whenever the premises are true.
  • These underlying structural patterns reflect universal rules of rational inference, often described as foundational laws of thought across all human languages.

Logical Operators as Truth Functions

• Primitive sentential connectives:

  • Sentential connectives serve as the operational links between propositional variables in formal logic.
  • Common connectives include:
  • Conditional: "if… then…"
  • Disjunction: "or"
  • Conjunction: "and"
  • Negation: "not"
  • Advanced operators requiring higher levels of logical complexity (omitted from truth-functional propositional logic) include:
  • Quantifiers: "all" and "some"
  • Identity operators
  • Modal operators: necessity and possibility
  • Deontic operators: moral obligation and moral permissibility

• Mathematical concept of a truth function:

  • Sentential connectives operate analogously to mathematical functions.
  • A truth function takes one or more truth values as its input (its argument) and processes them to generate a single resulting truth value as its output (its value).

Truth-Functional Analysis of Negation and Conjunction

• Negation as a unary truth function:

  • Negation operates upon a single proposition ($p$).
  • Its truth function inverts the truth value of the input:
  • If the input is $\text{True}$, the negation output is $\text{False}$.
  • If the input is $\text{False}$, the negation output is $\text{True}$.
  • Flying dogs scenario:
  • Let $p = \text{"Dogs can fly."}$
  • In the actual world (excluding dogs riding inside airplanes), this statement is $\text{False}$. Applying negation yields $\text{not } p = \text{"Dogs cannot fly."}$, which maps to $\text{True}$.
  • In a conceivable science-fiction or comic-book world where a pet dachshund named Lance flaps his ears and flies across the room, $p$ would be $\text{True}$. Asserting $\text{not } p$ ("Dogs cannot fly") in that world maps to $\text{False}$.

• Conjunction as a binary truth function:

  • A statement combining two propositional variables ($p$ and $q$) in classical logic generates four ($2^2 = 4$) distinct input combinations of truth values.
  • Conjunction ("and") maps an ordered pair of truth values to a single resultant truth value.
  • A conjunction is true if and only if both constituent propositions are true; it yields false if either or both propositions are false.
  • Evaluative proposition example:
  • Let $p = \text{"Dogs are cute."}$
  • Let $q = \text{"Cats are cute."}$
  • If both $p$ and $q$ are true, the conjoined statement $p \text{ and } q$ evaluates to $\text{True}$.
  • Non-evaluative/objective proposition example:
  • Let $p = \text{"The dog is on the mat."}$
  • Let $q = \text{"The cat is outside."}$
  • If the dog is resting on the mat ($\text{True}$) and the cat is outdoors running up a tree ($\text{True}$), the conjunction $p \text{ and } q$ evaluates to $\text{True}$.
  • If the dog is on the mat ($\text{True}$) but the cat is curled up right next to the dog indoors rather than outside ($\text{False}$), the input pair is $(\text{True}, \text{False})$. The truth function evaluates this ordered pair to an output of $\text{False}$.

Questions & Discussion

• Question on the meaning of the ARG acronym:

  • Prompt: Can anybody state what ARG stands for?
  • Response: ARG stands for Acceptability, Relevance, and Good grounds.

• Discussion on examples of arguments lacking good grounds:

  • Prompt: A request for an example of an argument that fails to provide good grounds.
  • Response 1: A syllogistic attempt involving dancing snakes: "Some snakes can dance; some who get music are entertaining; therefore, some snakes are entertaining."
  • Clarification: This is structurally invalid, but an ideal example of grounds failure provides some relevant evidence that nonetheless remains insufficient to establish the conclusion.
  • Response 2: A conditional argument regarding weather: "When it snows, it's cold out. It's not snowing. Therefore, it's not cold out."
  • Clarification: This constitutes a formally invalid argument structure (denying the antecedent) rather than illustrating non-deductive evidential sufficiency.

• Question on final exam scope:

  • Question: Is the final exam cumulative, or does it cover only the final section of the course?
  • Answer: The final exam is mostly cumulative in that questions addressing validity and earlier concepts will appear, but the primary focus will be on the final section taught after the two midterms.

• Discussion on semantic validity versus formal validity:

  • Prompt: What distinguishes semantic validity from formal validity?
  • Response: A student suggested that one is based on individual premises, construction, and context, whereas the other is bound differently.
  • Clarification: Formally valid arguments derive validity entirely from organizational structure and schemata, allowing uniform variable substitution. Semantically valid arguments derive validity purely from the inherent definitions and meanings of their terms.

• Question on formal argument structures:

  • Question: In an argument of the second standard form, does it consist of a conditional and a negation?
  • Answer: Yes, that structure combines a conditional and a negation, which can be demonstrated visually when mapped onto formal truth tables.