Arithmetics based on computability logic
This paper is a brief survey of number theories based on computability logic (CoL) — a game-semantically conceived logic of computational tasks of resources. Such theories, termed clarithmetics, are conservative extensions of first-order Peano arithmetic. The first section of the paper lays out the...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
RAS Institute of Philosophy
2019
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |