44 lines
1.3 KiB
Markdown
44 lines
1.3 KiB
Markdown
|
---
|
|||
|
|
title: Normal Form
|
|||
|
|
TARGET DECK: Obsidian::STEM
|
|||
|
|
FILE TAGS: ars::normal
|
|||
|
|
tags:
|
|||
|
|
- ars
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Overview
|
|||
|
|
|
|||
|
|
An object is said to be in **normal form** if it cannot be reduced any further. Examples of normal form include:
|
|||
|
|
|
|||
|
|
* [[truth-tables|Conjunctive Normal Form]]
|
|||
|
|
* [[truth-tables|Disjunctive Normal Form]]
|
|||
|
|
* [[pred-logic#Identifiers|Prenex Normal Form]]
|
|||
|
|
* [[beta-reduction#Normal Form|β-normal forms]]
|
|||
|
|
|
|||
|
|
%%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%%
|
|||
|
|
|
|||
|
|
## Bibliography
|
|||
|
|
|
|||
|
|
* Gries, David. *The Science of Programming*. Texts and Monographs in Computer Science. New York: Springer-Verlag, 1981.
|