The Incompleteness of Deductive Logic (Paperback)
Language: English
Published by Zhi Systems, 2026
- Softcover
- New

Seller: CitiRetail, Stevenage, United KingdomCitiRetail
AbeBooks seller since June 29, 2022
Condition: New
US$ 24.25
Quantity: 1 available
Add to basketItem description from seller
Paperback. This book proves a new theorem in recursion theory with major consequences for logic, philosophy, AI, and epistemic engineering. The main result is that the class of all recursive, truth-preserving deductive logics is not recursively enumerable-no algorithm can list all possible formal systems. This strengthens Goedel: incompleteness does not just block any single system from capturing all truths; it prevents recursion itself from surveying the space of formal systems. The core philosophical payoff is overturning the long-standing but false assumption that rationality = recursivity. Rational thought includes both recursive rule-following and non-recursive pattern-recognition capacities, and neither can be reduced to the other. This insight dissolves classical problems (induction, rule-following, foundationalism), explains why GOFAI failed, clarifies why neural networks succeed, and reframes mathematical and linguistic understanding as non-recursive pattern-based cognition. As a result, epistemic engineering-the design of systems that expand, stabilize, and operationalize human knowledge-must integrate non-recursive rational mechanisms rather than treating rationality as algorithmic. A new theorem in recursion theory showing that formal systems cannot be recursively enumerated, with major consequences for logic, AI, and epistemology. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. …
Seller Inventory # 9781968752057
- Title
- The Incompleteness of Deductive Logic (Paperback)
- Author
- John-Michael M. Kuczynski
- Publisher
- Zhi Systems
- Publication year
- 2026
- Condition
- new
- Binding
- Paperback
- Language
- English
- ISBN 10
- 1968752056
- ISBN 13
- 9781968752057
This book proves a new theorem in recursion theory with major consequences for logic, philosophy, AI, and epistemic engineering. The main result is that the class of all recursive, truth-preserving deductive logics is not recursively enumerable-no algorithm can list all possible formal systems. This strengthens Gödel: incompleteness does not just block any single system from capturing all truths; it prevents recursion itself from surveying the space of formal systems. The core philosophical payoff is overturning the long-standing but false assumption that rationality = recursivity. Rational thought includes both recursive rule-following and non-recursive pattern-recognition capacities, and neither can be reduced to the other. This insight dissolves classical problems (induction, rule-following, foundationalism), explains why GOFAI failed, clarifies why neural networks succeed, and reframes mathematical and linguistic understanding as non-recursive pattern-based cognition. As a result, epistemic engineering-the design of systems that expand, stabilize, and operationalize human knowledge-must integrate non-recursive rational mechanisms rather than treating rationality as algorithmic.
"Synopsis" may belong to another edition of this title.
CitiRetail
Stevenage, United Kingdom
AbeBooks seller since June 29, 2022
Shipping rates from United Kingdom to U.S.A.
| Item | 7 to 14 business days | 7 to 60 business days |
|---|---|---|
| First item | US$ 48.42 | US$ 48.42 |
Payment methods
Store description
Online business
Seller's business information
ABC BOOKS LIMITED
10 John Street
London, United Kingdom WC1N 2EB
Terms of sale
Orders can be returned within 30 days of receipt.
Shipping terms
Please note that titles are dispatched from our US, Canadian or Australian warehouses. Delivery times specified in shipping terms. Orders ship within 2 business days. Delivery to your door then takes 7-14 days.