634 views

1 Answer

0 0 votes

Some people use "tautology" in logic in a wide sense, to mean any logically true wff.

But others use "tautology" more narrowly to mean true in virtue of truth-functional structure (so, "valid by the truth-table test").

So, for example, ∀xFx→Fa∀xFx→Fa would count as a tautology in the first, wide, sense but not in the second, narrow, sense.

How to use 'tautology', then, this is a matter of terminological preference, I think.

Position:
Show:

Related questions

1 1 vote
3 3 answers
355
355 views
NullPointer_Pro asked Mar 27
355 views
For the statement $$P \rightarrow Q$$Which of the following statements below is/are correct?If the hypothesis is true and the conclusion is false, then the conditional st...
10 10 votes
7 7 answers
996
996 views
GO Classes asked Mar 24
996 views
The compound statement $(\sim(P \wedge Q)) \vee((\sim P) \wedge Q) \Rightarrow((\sim P) \wedge(\sim Q))$ is equivalent to$((\sim P) \vee Q) \wedge(\sim Q)$$(\sim Q) \vee ...
7 7 votes
4 4 answers
451
451 views
GO Classes asked Mar 24
451 views
Let $\Delta, \nabla \in\{\wedge, \vee\}$ be such that $(\mathrm{p} \rightarrow \mathrm{q}) \Delta(\mathrm{p} \nabla \mathrm{q})$ is a tautology. Then$\Delta=\vee, \nabla=...
9 9 votes
7 7 answers
523
523 views
GO Classes asked Mar 24
523 views
If $p, q$ and $r$ are three propositions, then which of the following combination of truth values of $p, q$ and $r$ makes the logical expression $\{(p \vee q) \wedge((\si...