(more info)

Math for the people, by the people.

Main Menu

sections Encyclopædia
Papers
Books
Expositions

meta Requests (200)
Orphanage
Unclass'd
Unproven (490)
Corrections (6)
Classification

talkback Polls
Forums
Feedback
Bug Reports

downloads Snapshots
PM Book

information News
Docs
Wiki
ChangeLog
TODO List
Legalese
About

Entry average rating: No information on entry rating

zeroth order logic

(Definition)

Note. This entry overlaps to some degree with other entries on boolean functions and propositional logic, but it furnishes a compact reference and a translation manual for several different styles of notation.

Zeroth order logic is a term in popular use among practitioners for the common principles underlying the algebra of sets, boolean algebra, boolean functions, logical connectives, monadic predicate calculus, propositional calculus, and sentential logic. The term serves to mark a level of abstraction in which the inessential differences among these subjects can be subsumed under the appropriate isomorphisms.

Propositional forms

Propositional forms

Table 1 lists equivalent expressions for the four functions of concrete type $X \to \mathbb{B}$ and abstract type $\mathbb{B} \to \mathbb{B}$ in a number of different languages for zeroth order logic.

Table 1. Propositional Forms on One Variable

$\mathcal{L}_1$ $\mathcal{L}_2$ $\mathcal{L}_3$ $\mathcal{L}_4$ $\mathcal{L}_5$ $\mathcal{L}_6$

1 0

$f_{0}$ $f_{00}$ 0 0 false 0

$f_{1}$ $f_{01}$ 0 1 not $\lnot x$

$f_{2}$ $f_{10}$ 1 0

$f_{3}$ $f_{11}$ 1 1 true

Table 2 lists equivalent expressions for the sixteen functions of concrete type $X \times Y \to \mathbb{B}$ and abstract type $\mathbb{B} \times \mathbb{B} \to \mathbb{B}$ in the same set of languages.

Table 2. Propositional Forms on Two Variables

$\mathcal{L}_1$ $\mathcal{L}_2$ $\mathcal{L}_3$ $\mathcal{L}_4$ $\mathcal{L}_5$ $\mathcal{L}_6$

1 1 0 0

1 0 1 0

$f_{0}$ $f_{0000}$ 0 0 0 0 false 0

$f_{1}$ $f_{0001}$ 0 0 0 1 neither nor $\lnot x \land \lnot y$

$f_{2}$ $f_{0010}$ 0 0 1 0 and not $\lnot x \land y$

$f_{3}$ $f_{0011}$ 0 0 1 1 not $\lnot x$

$f_{4}$ $f_{0100}$ 0 1 0 0 and not $x \land \lnot y$

$f_{5}$ $f_{0101}$ 0 1 0 1 not $\lnot y$

$f_{6}$ $f_{0110}$ 0 1 1 0 not equal to $x \ne y$

$f_{7}$ $f_{0111}$ 0 1 1 1 not both and $\lnot x \lor \lnot y$

$f_{8}$ $f_{1000}$ 1 0 0 0 and $x \land y$

$f_{9}$ $f_{1001}$ 1 0 0 1 equal to

$f_{10}$ $f_{1010}$ 1 0 1 0

$f_{11}$ $f_{1011}$ 1 0 1 1 not without $x \Rightarrow y$

$f_{12}$ $f_{1100}$ 1 1 0 0

$f_{13}$ $f_{1101}$ 1 1 0 1 not without $x \Leftarrow y$

$f_{14}$ $f_{1110}$ 1 1 1 0 or $x \lor y$

$f_{15}$ $f_{1111}$ 1 1 1 1 true

The columns of Tables 1 and 2 are conveniently described in the following order:

Language $\mathcal{L}_3$ .
In Table 1, $\mathcal{L}_3$ describes each boolean function $f : \mathbb{B} \to \mathbb{B}$ by means of the sequence of two boolean values .

In Table 2, $\mathcal{L}_3$ describes each boolean function $f : \mathbb{B}^2 \to \mathbb{B}$ by means of the sequence of four boolean values .

Sequences of these forms, perhaps in another order and perhaps with the logical values F and T instead of the boolean values 0 and 1, would normally be displayed vertically in a truth table under the column head for .
Language $\mathcal{L}_2$ lists the functions in the form , where the index is a bit string formed from the sequence of boolean values in $\mathcal{L}_3$ .
Language $\mathcal{L}_1$ notates the functions with an index that is the decimal equivalent of the binary numeral index in $\mathcal{L}_2$ .
Notice that the sense of the binary and decimal codings is highly dependent on context. One needs to know the number of variables in the function and the sequence of points over which it is evaluated in order to decode the indices properly.
Language $\mathcal{L}_4$ expresses the boolean functions in terms of two families of logical operations:
Logical conjunctions written as continued products. For example:

$\begin{displaymath}\begin{array}{ccc} x y & = & x \land y \ x y z & = & x \land y \land z \ \end{array}\end{displaymath}$

Minimal negation operators written as parenthesized lists. For example:

$\begin{displaymath}\begin{array}{ccc} ( ) & = & 0 \ (x) & = & \lnot x \ (x, y) & = & x \ne y \ \end{array}\end{displaymath}$
Language $\mathcal{L}_5$ lists ordinary language expressions for the propositional forms. Many other paraphrases are possible, but these afford a sample of the simplest equivalents.
Language $\mathcal{L}_6$ expresses the propositional forms in one of the several notations that are commonly used in formal logic.

"zeroth order logic" is owned by Jon Awbrey.

(view preamble)

Other names:

propositional calculus, propositional logic, sentential calculus, sentential logic

Log in to rate this entry.
(view current ratings)

Cross-references: logic, minimal negation operators, products, conjunctions, operations, indices, points, binary, string, index, truth table, Boolean, sequence, NOR, variable, languages, number, type, functions, expressions, equivalent, isomorphisms, predicate, monadic, logical connectives, Boolean algebra, algebra of sets, term, Boolean functions
There are 10 references to this entry.

This is version 12 of zeroth order logic, born on 2008-03-20, modified 2008-06-21.
Object id is 10424, canonical name is ZerothOrderLogic.
Accessed 696 times total.

Classification:

AMS MSC:	03B05 (Mathematical logic and foundations :: General logic :: Classical propositional logic)
	03G05 (Mathematical logic and foundations :: Algebraic logic :: Boolean algebras)

Pending Errata and Addenda

None.

Discussion

forum policy

Interact

Contents

Propositional forms