Logic for Computer Scientists pp 3-39 | Cite as

# Propositional Logic

## Abstract

Propositional logic explores simple grammatical connections, like *and, or* and *not*, between the simplest “atomic sentences”. Such atomic sentences are for example: *A* = “Paris is the capital of France” *B* = “mice chase elephants” Such atomic components (of possibly more complex sentences) can be either *true* or *false*. (In our understanding of the world, *A* is true but *B* is false.) The subject of propositional logic is to declare formally how such “truth values” of the atomic components extend to a truth value of a more complex structure, such as *A* and *B*. (For the above example, we know that *A* and *B* is false because *B* is already false.)

## Keywords

Propositional Logic Finite Subset Atomic Formula Compactness Theorem Horn Clause## Preview

Unable to display preview. Download preview PDF.