Vendeur : BargainBookStores, Grand Rapids, MI, Etats-Unis
EUR 16,26
Quantité disponible : 5 disponible(s)
Ajouter au panierPaperback or Softback. Etat : New. The Incompleteness of Deductive Logic: And Its Consequences for Epistemic Engineering. Book.
Vendeur : California Books, Miami, FL, Etats-Unis
EUR 18,13
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Langue: anglais
Edité par John Benjamins Publishing Company, 2007
ISBN 10 : 902725205X ISBN 13 : 9789027252050
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
EUR 10,38
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. 541 S. Ex-library with stamp and library-signature in good condition, some traces of use. C07359 9789027252050 Sprache: Englisch Gewicht in Gramm: 1150.
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
EUR 19,14
Quantité disponible : Plus de 20 disponibles
Ajouter au panierPAP. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Langue: anglais
Edité par John Benjamins Publishing Compan, 2012
ISBN 10 : 9027213534 ISBN 13 : 9789027213532
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
EUR 78,16
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Fine. sealed in original plastic, but has minor ripping.
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
EUR 19,90
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : 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 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 multiple locations in the US or from the UK, depending on stock availability.
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
EUR 17,67
Quantité disponible : Plus de 20 disponibles
Ajouter au panierPAP. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 15,16
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand.
Langue: anglais
Edité par John Benjamins Publishing Co, 2007
ISBN 10 : 902725205X ISBN 13 : 9789027252050
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
EUR 113,62
Quantité disponible : 2 disponible(s)
Ajouter au panierHardcover. Etat : New.
EUR 105,21
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Brand New. 412 pages. 9.70x1.30x6.60 inches. In Stock.
Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 21,19
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand.
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 115,97
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Brand New. 524 pages. 9.75x7.00x1.25 inches. In Stock.
Vendeur : Yushodo Co., Ltd., Fuefuki-shi, Yamanashi Pref., Japon
Membre d'association : ILAB
EUR 106,48
Quantité disponible : 2 disponible(s)
Ajouter au panierHardcover. Etat : Fine. x, 524p.
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 15,41
Quantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND.
Vendeur : AussieBookSeller, Truganina, VIC, Australie
EUR 19,90
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : 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 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 Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Vendeur : Librería Anticuaria Galgo, Oviedo, O, Espagne
EUR 12,90
Quantité disponible : 10 disponible(s)
Ajouter au panierRevista internacional de filosofía. 160 pp. 15x23 cm. KRK Ediciones. Oviedo.
Vendeur : CitiRetail, Stevenage, Royaume-Uni
EUR 21,51
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : 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 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.
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 19,92
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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 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.
Vendeur : preigu, Osnabrück, Allemagne
EUR 16,45
Quantité disponible : 5 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. The Incompleteness of Deductive Logic | And Its Consequences for Epistemic Engineering | John-Michael M Kuczynski | Taschenbuch | Englisch | 2026 | Zhi Systems | EAN 9781968752057 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.