blob: ccdaf4891f99ba80871681a75c3b2f7ad152f48d (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
|
+++
title = "Kleene and Priest logics"
author = "Yann Herklotz"
tags = []
categories = []
backlinks = ["4e2b", "4e2"]
forwardlinks = ["4e2b", "4e2a1"]
zettelid = "4e2a"
+++
These logics are the more "standard", and seem to be the most
straightforward definition of three-valued logic. For example, it has a
lazy or and lazy and, becoming true and false when the answer could be
nothing else. Otherwise, the result can also be undefined.
| AND | F | U | T |
|-----|-----|-----|-----|
| F | F | F | F |
| U | F | U | U |
| T | F | U | T |
| OR | F | U | T |
|-----|-----|-----|-----|
| F | F | U | T |
| U | U | U | T |
| T | T | T | T |
Then, implication can be defined in terms of AND and OR. In addition to
that NEG(U) = U.
| A-\>B | F | U | T |
|-------|-----|-----|-----|
| F | T | T | T |
| U | U | U | T |
| T | F | U | T |
|
