Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America
EUR 16,18
Cantidad disponible: 5 disponibles
Añadir al carritoPaperback or Softback. Condición: New. The Incompleteness of Deductive Logic: And Its Consequences for Epistemic Engineering. Book.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 18,05
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por John Benjamins Publishing Company, 2007
ISBN 10: 902725205X ISBN 13: 9789027252050
Librería: Antiquariat Bookfarm, Löbnitz, Alemania
EUR 10,38
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. 541 S. Ex-library with stamp and library-signature in good condition, some traces of use. C07359 9789027252050 Sprache: Englisch Gewicht in Gramm: 1150.
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 19,06
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Idioma: Inglés
Publicado por John Benjamins Publishing Compan, 2012
ISBN 10: 9027213534 ISBN 13: 9789027213532
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
EUR 77,80
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Fine. sealed in original plastic, but has minor ripping.
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
EUR 19,81
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 17,67
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Idioma: Inglés
Publicado por John Benjamins Publishing Co, 2007
ISBN 10: 902725205X ISBN 13: 9789027252050
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
EUR 106,52
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: New.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 15,53
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
EUR 105,23
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Brand New. 412 pages. 9.70x1.30x6.60 inches. In Stock.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 21,09
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 115,99
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Brand New. 524 pages. 9.75x7.00x1.25 inches. In Stock.
Librería: Yushodo Co., Ltd., Fuefuki-shi, Yamanashi Pref., Japon
Miembro de asociación: ILAB
EUR 106,00
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Fine. x, 524p.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 15,78
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 19,83
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.
Librería: Librería Anticuaria Galgo, Oviedo, O, España
EUR 12,90
Cantidad disponible: 10 disponibles
Añadir al carritoRevista internacional de filosofía. 160 pp. 15x23 cm. KRK Ediciones. Oviedo.
Librería: CitiRetail, Stevenage, Reino Unido
EUR 21,51
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: 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.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 19,92
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Librería: preigu, Osnabrück, Alemania
EUR 16,45
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: 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.