Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Connectives

  • FOL formulas are joined together by logical operators to form more complex formulas (just like in propositional logic)

  • The basic logical operators are the same as in propositional logic as well:

    • Negation: ¬p („it is not the case that p“)

    • Conjunction: p ∧ q („p and q“)

    • Disjunction: p ∨ q („p or q“)

    • Implication: p → q („p implies q“ or “q if p“)

    • Equivalence: p ↔ q („p if and only if q“)


Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.