Kuczynski John Michael M (11 results)
- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller4-star sellerCondition: New
£ 15.37
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.BargainBookStores
Contact seller5-star sellerCondition: New
£ 18.92
Free ShippingShips within U.S.A.Quantity: 5 available
Paperback or Softback. Condition: New. The Incompleteness of Deductive Logic: And Its Consequences for Epistemic Engineering. Book.
- Softcover
- Print on Demand
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contact seller5-star sellerCondition: New
£ 15.33
Free ShippingShips within U.S.A.Quantity: 1 available
Paperback. Condition: new. 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 syste…ms. 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 multiple locations in the US or from the UK, depending on stock availability.
- Softcover
- Print on Demand
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
£ 16.22
Free ShippingShips within U.S.A.Quantity: Over 20 available
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
- Softcover
- Print on Demand
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
£ 14.78
£ 3.29 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, , United KingdomMajestic Books
Contact seller4-star sellerCondition: New
£ 12.84
£ 6.50 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand.
- Softcover
- Print on Demand
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 17.95
£ 2.98 shippingShips within U.S.A.Quantity: 4 available
Condition: New. Print on Demand.
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
£ 13.70
£ 8.59 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND.
- Softcover
- Print on Demand
Seller: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contact seller5-star sellerCondition: New
£ 17.22
£ 27.60 shippingShips from Australia to U.S.A.Quantity: 1 available
Paperback. Condition: new. 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 syste…ms. 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 Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
- Softcover
- Print on Demand
Seller: CitiRetail, Stevenage, United KingdomCitiRetail
Contact seller5-star sellerCondition: New
£ 17.99
£ 37.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: new. 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 syste…ms. 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.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 17.71
£ 52.88 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 enu…merable-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.
