Propositional Sentence Connective Operation

A Propositional Sentence Connective Operation is a logic operation within a propositional logic grammar (that can be used to form valid propositional logic formulas).

• AKA: Propositional Logic Formula Connective Relation.
• Context:
  • It can be a part of a Propositional Logic Sentence.
  • It can be expressed by some Logic Symbol.
• Example(s):
  • a Logical Negation Relation (Not, ¬), such as in [math]\displaystyle{ ¬A }[/math].
  • a Logical Conjunction (And, ∧), such as in [math]\displaystyle{ A ∨ B }[/math].
  • a Logical Disjunction (Or, ∨), such as in [math]\displaystyle{ A ∧ B }[/math].
  • a Logical Implication (Implies, →), such as in [math]\displaystyle{ A → B }[/math].
  • a Logical Bi-implication (iff, ↔), such as in [math]\displaystyle{ A ↔ B }[/math].
• See: Connective, Propositional Variable, P Language.

---

---

References

• (Goldrei, 2005) ⇒ Derek Goldrei. (2005). “Propositional and Predicate Calculus: A Model of Argument." Springer.

---