12-27-2010, 04:10 AM
Validity concept in logics
Definition of Valid Formulas and Contradictions.
Let A ∈ L. If for every assignment a to the atoms in A, v(A, a) = T (True), then A is called a valid formula. If to every assignment a to the atoms of A, v(A, a) = F,
then A is called a (semantical) contradiction. If a formula A is valid, we use the notation |= A to indicate this fact
Definition of Valid Formulas and Contradictions.
Let A ∈ L. If for every assignment a to the atoms in A, v(A, a) = T (True), then A is called a valid formula. If to every assignment a to the atoms of A, v(A, a) = F,
then A is called a (semantical) contradiction. If a formula A is valid, we use the notation |= A to indicate this fact
در یک گزاره مانند:
- آسمان آبی است.
برای درست بودن (valid بودن) آن، بایستی همه زابهای «آبی بودن»
زیرگردآیهای از زابهای آسمان باشند، که در اینجا یکی هم بیشتر نمیباشد.
- زاب = صفت
- زیرگردآیه = زیرمجموعه