The incredible proof machine proof-machine is a game with a collection of theorems for classical propositional logic, classical first-order logic, and the simply typed lambda calculus.
Example (think Visio)
Add tag. Yes, one can use tags in an answer that have not been used in the question. Nice when you need it, like here.
Guy Coder
- 2.9k
- 1
- 12
- 39
The incredible proof machine is a game with a collection of theorems for classical propositional logic, classical first-order logic, and the simply typed lambda calculus.
Example (think Visio)
The incredible proof machine proof-machine is a game with a collection of theorems for classical propositional logic, classical first-order logic, and the simply typed lambda calculus.
Example (think Visio)
Added image because it took me a few mintues to figure out that one can create connectors (lines). If I saw this it would have been more apparent what to do.
Guy Coder
- 2.9k
- 1
- 12
- 39
The incredible proof machine is a game with a collection of theorems for classical propositional logic, classical first-order logic, and the simply typed lambda calculus.
Example (think Visio)
The incredible proof machine is a game with a collection of theorems for classical propositional logic, classical first-order logic, and the simply typed lambda calculus.
The incredible proof machine is a game with a collection of theorems for classical propositional logic, classical first-order logic, and the simply typed lambda calculus.
Example (think Visio)
