BranchesHistoryFPLHelpLogin
Welcome guest
You're not logged in.
328 users online, thereof 0 logged in

The Law of Excluded Middle tells us that if a string of a formal language $s\in L$ is a proposition, then the valuation function can take only two values – either the proposition is true or false: $[[s]]_I\in \mathbb B$ for all interpretations. This can also be expressed using the satisfaction relation: either we have $\models s$ or $\not{\models}s$.

However, we still do not know, how the satisfaction relation changes when we use the syntactical rules for building propositions. The following definition closes the gaps by defining the semantics of the propositional logic.

Definition: Semantics of PL0

Let $L$ be a f“ormal language”:https://www.bookofproofs.org/branches/formal-language-generated-from-a-grammar/ with the syntax of propositional logic $PL0$ and let $L’\subset L$ be the subset of $L$ which consists of propositions (i.e. Boolean constants, Boolean variables, and Boolean terms). The semantics of $PL0$* is defined recursively as its syntax was. We provide two equivalent definitions – one using interpretations “$I$” with the corresponding valuation functions $[[]]_I$, another using the satisfaction relation “$\models$” of $PL0$:

Definition I

For all interpretations of $PL0$ “$I$” of propositions, the corresponding valuation functions “$[[]]_I$” are defined as follows:

Equivalent Definition II

The satisfaction relation of $PL0$ “$\models$” is given by:

| | | | | created: 2018-01-30 15:13:09 | modified: 2020-05-04 19:24:57 | by: bookofproofs

1.Definition: $k$-nary Connectives, Prime and Compound Propositions

2.Lemma: Boolean Function

3.Definition: Truth Table

4.Definition: Negation

5.Definition: Conjunction

6.Definition: Disjunction

7.Definition: Implication

8.Definition: Equivalence

Edit or AddNotationAxiomatic Method

This work was contributed under CC BY-SA 4.0 by:

This work is a derivative of:

Bibliography (further reading)

(none)