ABSTRACT
Complicated propositions are built up from simpler ones using the following symbols. https://www.niso.org/standards/z39-96/ns/oasis-exchange/table"> Formal Expression English Translation ∼P P is not true. https://www.w3.org/1998/Math/MathML"> P ∧ Q https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9780429322587/a9fd1d07-92f0-4492-b3eb-f6636aeef293/content/inline-math2a_1.jpg" xmlns:xlink="https://www.w3.org/1999/xlink"/> P and Q. P∨Q P or Q. P ⇒ Q If P, then Q. P ⇔ Q P if and only if Q. https://www.w3.org/1998/Math/MathML"> P ⊕ Q https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9780429322587/a9fd1d07-92f0-4492-b3eb-f6636aeef293/content/inline-math2a_2.jpg" xmlns:xlink="https://www.w3.org/1999/xlink"/> P or Q, but not both. https://www.w3.org/1998/Math/MathML"> ∀ x ∈ U , P ( x ) https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9780429322587/a9fd1d07-92f0-4492-b3eb-f6636aeef293/content/inline-math2a_3.jpg" xmlns:xlink="https://www.w3.org/1999/xlink"/> For every x 0 in U, P(x 0) is true. https://www.w3.org/1998/Math/MathML"> ∃ x ∈ U , P ( x ) https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9780429322587/a9fd1d07-92f0-4492-b3eb-f6636aeef293/content/inline-math2a_4.jpg" xmlns:xlink="https://www.w3.org/1999/xlink"/> There exists at least one x 0 in U for which P(x 0) is true. https://www.w3.org/1998/Math/MathML"> ∃ ! x ∈ U , P ( x ) https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9780429322587/a9fd1d07-92f0-4492-b3eb-f6636aeef293/content/inline-math2a_5.jpg" xmlns:xlink="https://www.w3.org/1999/xlink"/> There exists exactly one x 0 in U for which P(x 0) is true.
