2024-02-11 19:05:17 +00:00
|
|
|
|
---
|
|
|
|
|
|
title: Normal Form
|
|
|
|
|
|
TARGET DECK: Obsidian::STEM
|
|
|
|
|
|
FILE TAGS: logic
|
|
|
|
|
|
tags:
|
|
|
|
|
|
- logic
|
|
|
|
|
|
---
|
|
|
|
|
|
|
|
|
|
|
|
## Overview
|
|
|
|
|
|
|
|
|
|
|
|
An object is said to be in **normal form** if it cannot be reduced any further. Examples of normal form include:
|
|
|
|
|
|
|
2024-02-12 18:27:16 +00:00
|
|
|
|
* [[truth-tables|Conjunctive Normal Form]]
|
|
|
|
|
|
* [[truth-tables|Disjunctive Normal Form]]
|
2024-02-11 19:05:17 +00:00
|
|
|
|
* [[quantification#Identifiers|Prenex Normal Form]]
|
|
|
|
|
|
|
|
|
|
|
|
%%ANKI
|
|
|
|
|
|
Basic
|
|
|
|
|
|
What does it mean for an object to be in normal form?
|
|
|
|
|
|
Back: It cannot be rewritten/reduced any further.
|
|
|
|
|
|
Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
|
|
|
|
|
|
<!--ID: 1707675146194-->
|
|
|
|
|
|
END%%
|
|
|
|
|
|
|
|
|
|
|
|
%%ANKI
|
|
|
|
|
|
Basic
|
|
|
|
|
|
What zero-order logical normal form(s) have only $\land$ and $\lor$ operators?
|
|
|
|
|
|
Back: CNF and DNF
|
|
|
|
|
|
Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
|
|
|
|
|
|
<!--ID: 1707675369145-->
|
|
|
|
|
|
END%%
|
|
|
|
|
|
|
|
|
|
|
|
%%ANKI
|
|
|
|
|
|
Basic
|
|
|
|
|
|
What first-order logical normal form(s) writes bound identifiers before free ones?
|
|
|
|
|
|
Back: PNF
|
|
|
|
|
|
Reference: Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
|
|
|
|
|
|
<!--ID: 1707675369187-->
|
|
|
|
|
|
END%%
|
|
|
|
|
|
|
2024-03-22 15:26:41 +00:00
|
|
|
|
## Bibliography
|
2024-02-11 19:05:17 +00:00
|
|
|
|
|
|
|
|
|
|
* Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
|
