vault backup: 2025-03-16 18:59:42

This commit is contained in:
boris
2025-03-16 18:59:42 +00:00
parent 6befcc90d4
commit ae837183f1
188 changed files with 17794 additions and 409 deletions

View File

@@ -27,16 +27,16 @@ Formula: p => q
(b) Increased spending overheats the economy.
Atomic Propositions:
Increased spending
Increased spending
Overheats the economy
Connectives:
Connectives:
None, implied non-linguistic
Formula: p => q
(c) Increased spending coupled with tax cuts overheats the economy.
Atomic Propositions:
Increased spending
There are tax cuts
There are tax cuts
Overheated economy
Connectives:
Coupled with
@@ -56,7 +56,7 @@ Atomic Propositions:
Inflation does not rise
Connectives:
either / or
Formula: p
Formula: p
1. Remove as many brackets as possible from the following propositions without altering their meaning (i.e. the truth table).

View File

@@ -19,7 +19,9 @@
- Disjunction (): p q is true if and only if at least one of p or q is true
- Implication (⇒): p ⇒ q is false if and only if p is true and q is false
- Equivalence (⇔): p ⇔ q is true if and only if p and q have the same truth value
## Precedence Order of Connectives
1. Negation (¬)
2. Conjunction (∧)
3. Disjunction ()
@@ -27,6 +29,7 @@
5. Equivalence (⇔)
This means that in a formula without parentheses, ¬ takes precedence over ∧ and , ∧ and have the same precedence but associativity to the left, and ⇒ and ⇔ also have the same precedence but associativity to the right. For example, p ∧ q ⇒ r is equivalent to (p ∧ q) ⇒ r, not p ∧ (q ⇒ r).
### Propositions and Connectives (Examples)
#### Atomic Propositions:
@@ -119,6 +122,7 @@ This means that in a formula without parentheses, ¬ takes precedence over ∧ a
- Formalized as: p ∧ q ⇒ ¬r
- Argument: If Bob eats carrots, then he will be able to see in the dark. Therefore, if Bob cant see in the dark, then he hasnt eaten carrots.
- Formalized as: p ⇒ q ≡ ¬q ⇒ ¬p
# Summary
- Logicians focus on argument form