Like the shortest axiom for classical propositional logic using NAND in the Chap... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		l- on Sept 25, 2021 \| parent \| context \| favorite \| on: Charting a Course for “Complexity”: Metamodeling, ... Like the shortest axiom for classical propositional logic using NAND in the Chapter 12, which is the last chapter, on page 773 in New Kind of Science with no proof or references?

l- on Sept 25, 2021 [–]

It does have a proof on pg 810, but it's still at the back of the book.

l- on Sept 26, 2021 | [–]

See https://en.wikipedia.org/wiki/Minimal_axioms_for_Boolean_alg... for claim dispute.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact