combinatory logic (90 resultados)

Condición: New.

Condición: New. SUPER FAST SHIPPING.

Condición: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,300grams, ISBN:9780192801425.

Condición: New.

Hardcover. Condición: Very Good. First edition. 22 x 14 cm. 162pp. Index, bibliography. Grey cloth, no jacket. Spine is faded. Chapter headings include: "Functions", "Boolean Concepts and Identity", "Combinators", "Foundations of Arithmetic", "Recursion and Circuits", "A Theory of Propositions".

Softcover. 170 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 521096979 Sprache: Englisch Gewicht in Gramm: 550.

Hardcover. Condición: Very Good. Estado de la sobrecubierta: Good. 1st Edition. Pages are clean. Book is tight. Jacket's condition is good with slight edge wear and nicks. Combinatory logic has long been thought to hold great philosophical promise.

Condición: New.

Condición: Muy Bueno. 246. Oxford University Press, 1990, 246pp. En perfecto estado.

Soft cover. Condición: Very Good. 1st Edition. Not ex-library, but a few pages have several markings and notes from the previous owner. Moderate shelf wear to outer covers along the edges and a crease on the lower left back cover. Blemish on first and title page.

Hard Cover. Condición: Very Good -. Estado de la sobrecubierta: Very Good -. First Edition. (1985), 246pp, 215pp, 1st ed., 1st printing, slight soiling & shelfwear to cover, slight soiling to top pg edges, slight rubbing & edgewear to dj, contents clean & unmarked.

Hardcover. Condición: Near Fine. Estado de la sobrecubierta: Near Fine. Stated first edition. Near fine in a near fine, price clipped dust jacket.

Hardcover. Condición: Near Fine. Estado de la sobrecubierta: Near Fine. Stated first edition. Remainder mark on top edge, else near fine in a near fine dust jacket.

Paperback, 20 cm, 246 pp. Cond.: goed / good. ISBN: 9780192801425.

Condición: New.

Paperback. 170 p. -(Some signs of use on the cover, name in ink on the title page, but overall in good condition.).

Hardcover. Condición: Fine. Estado de la sobrecubierta: Near Fine. Stated first edition. From the personal library of philosopher Hector-Neri Castaneda with his name on the front free endpaper. Publisher's "With the Compliments of the author" card also affixed to front free endpaper. Fine in an about fine dust jacket.; 246 pages.

Hardcover. Condición: New.

Hardcover. 417 S. K03099 Ex-library with stamp and library-signature in good condition, some traces of use. Sprache: Englisch Gewicht in Gramm: 550.

Grey Wrappers. Condición: Very Good. First Edition. Volume 2 No 1, Containing Pp 1-64. Scarce In This, The Original Publication State Of Gray Printed Wrappers. Contains Two Articles, By Raphael M Robinson, H. B. Curry And A. Fraenkel, And 28 Pp Of Reviews Of Important Recent Works, Including Church's Reviews Of Turing's Important 1936 Work On Computability, And Post's Independent Related Work Proposing "A Definition Of 1-Finite 1-Process' Which Is Similar In Formulation, And In Fact Equivalent, To Computation By A Turing Machine. The Present Paper Was Written Independently Of Turing's, Which Was At The Time In Press But Had Not Yet Appeared." A Clean, Lightly Used Copy, But With A Dampstain Along The Foredge Starting With A Trace At A 1/8" X 1/2" Area At The Upper Edge Of P 13 And Becoming Progressively Larger Until It Is 1/2" X 9" Along The Edge Of The Rear Cover.

Hardcover. Condición: Very Good. Some shelf-wear. Name of former owner. Clean pages. No other markings.

Softcover. Condición: New. Estado de la sobrecubierta: no dj. First. Beyond Combinatory Logic presents a comprehensive exploration of the intricacies of combinatorial logic, a fundamental concept in mathematics and computer science. This book serves as a cornerstone for understanding the theoretical foundations of computation, providing readers with a deep dive into the principles that govern the behavior of algorithms and computational systems. By examining the properties and limitations of combinatorial logic, readers will gain a profound understanding of the underlying mechanisms that shape the digital world. Publication Year: 2025. SHIPPING TERMS - Depending on your location we may ship your book from the following locations: France, United Kingdom, India, Australia, Canada or the USA. This item is printed on demand.

Soft cover. Condición: Very Good. Original softcover edition. Moderate edge-wear and creasing to covers; old owner's name diminutively to first page. Otherwise clean, tight and unmarked. A sound and neat copy. Erratum slip laid in. viii,104pp. Size: 4to - over 9¾ - 12" tall. Book.

Hardcover. Condición: Near Fine. Estado de la sobrecubierta: Good. 1st Edition. Dust jacket slightly sunned, moderately worn, esp edges. Underlinings on title page. Minor crease to lower right corner of first 30 pages. 8vo. 417 p. English.

Bound in yellow cloth. 417 p. -good.-(Spine slightly sunned, naame in ink on the fly-leaf, but otherwise the book is in good condition.).

Leinen, dies sind regulär ausgesondertes Bibliotheksexemplare aus einer wissenschaftlichen Bibliothek, keine Markierungen/Anmerkungen, die Bücher sind in einem sehr guten Zustand --- Linen, Lib. Ex., no marks, the books arein a very good condition. Shipping to abroad insured with tracking number.

XVI, 417 S. Ln.mS. *gutes Expl.*.

[No place], The Association for Symbolic Logic, 1936 & 1937. Royal8vo. Bound in red half cloth with gilt lettering to spine. In "Journal of Symbolic Logic", Volume 1 & 2 bound together. Barcode label pasted on to back board. Small library stamp to lower part of 16 pages. A very fine copy. [Church:] Pp. 40-1" Pp. 101-2. [Post:] Pp. 103-5. [Turing:] Pp. 153-163" 164. [Entire volume: (4), 218, (2), IV, 188 pp.] First edition of this collection of seminal papers within mathematical logic, all constituting some of the most important contributions mathematical logic and computional mathematics. A NOTE ON THE ENTSCHEIDUNGSPROBLEM (+) CORRECTION TO A NOTE ON THE ENTSCHEIDUNGSPROBLEM (+) REVIEW OF "A. M. TURING. ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM":First publication of Church's seminal paper in which he proved the solution to David Hilbert's "Entscheidungsproblem" from 1928, namely that it is impossible to decide algorithmically whether statements within arithmetic are true or false. In showing that there is no general algorithm for determining whether or not a given statement is true or false, he not only solved Hilbert's "Entscheidungsproblem" but also laid the foundation for modern computer logic. This conclusion is now known as Church's Theorem or the Church-Turing Theorem (not to be mistaken with the Church-Turing Thesis). The present paper anticipates Turing's famous "On Computable Numbers" by a few months. "Church's paper, submitted on April 15, 1936, was the first to contain a demonstration that David Hilbert's 'Entscheidungsproblem' - i.e., the question as to whether there exists in mathematics a definite method of guaranteeing the truth or falsity of any mathematical statement - was unsolvable. Church did so by devising the 'lambda-calculus', [.] Church had earlier shown the existence of an unsolvable problem of elementary number theory, but his 1936 paper was the first to put his findings into the exact form of an answer to Hilbert's 'Entscheidungsproblem'. Church's paper bears on the question of what is computable, a problem addressed more directly by Alan Turing in his paper 'On computable numbers' published a few months later. The notion of an 'effective' or 'mechanical' computation in logic and mathematics became known as the Church-Turing thesis." (Hook & Norman: Origins of Cyberspace, 250) Church coined in his review of Turing's paper the phrase 'Turing machine'.FINITE COMBINATORY PROCESSES-FORMULATION I: The Polish-American mathematician Emil Post made notable contributions to the theory of recursive functions. In the 1930s, independently of Turing, Post came up with the concept of a logic automaton similar to a Turing machine, which he described in the present paper (received on October 7, 1936). Post's paper was intended to fill a conceptual gap in Alonzo Church's paper on 'An unsolvable problem of elementary number theory'. Church had answered in the negative Hilbert's 'Entscheidungsproblem' but failed to provide the assertion that any such definitive method could be expressed as a formula in Church's lambda-calculus. Post proposed that a definite method would be one written in the form of instructions to mind-less worker operating on an infinite line of 'boxes' (equivalent to the Turing machines 'tape'). The range of instructions proposed by Post corresponds exactly to those performed by a Turing machine, and Church, who edited the Journal of Symbolic Logic, felt it necessary to insert an editorial note referring to Turing's "shortly forthcoming" paper on computable numbers, and asserting that "the present article . although bearing a later date, was written entirely independently of Turing's". (Hook & Norman: Origins of Cyberspace, 356).COMPUTABILITY AND LAMBDA-DEFINABILITY (+) THE Ø-FUNCTION IN LAMBDA-K-CONVERSION: The volume also contains Turing's influential "Computability and lambda-definability" in which he proved that computable functions "are identical with the lambda-definable functions of Church and the general recursive functions due to Herbrand and Gödel and developed by Kleene". (Hook & Norman: Origins of Cyberspace, 395).

[No place], 1936. 8vo. Extract, unbound, unstapled. Pp. 103-105. The uncommon first printing of Post's seminal paper, in which he, simultaneously with but independently of Turing, describes a logic automaton, which very much resembles the Turing machine. The Universal Turing Machine, which is presented for the first time in Turing's seminal paper in the Proceedings of the London Mathematical Society for 1936 (same year as the present paper), is considered one of the most important innovations in the theory of computation and constitutes the most famous theoretical paper in the history of computing. "Post [in the present paper] suggests a computation scheme by which a "worker" can solve all problems in symbolic logic by performing only machinelike "primitive acts". Remarkably, the instructions given to the "worker" in Post's paper and to a Universal Turing Machine were identical." (A Computer Perspective, p. 125). "The Polish-American mathematician Emil Post made notable contributions to the theory of recursive functions. In the 1930s, indepently of Turing, Post came up with the concept of a logic automaton similar to a Turing machine, which he described in the present paper [the paper offered]. Post's paper was intended to fill a conceptual gap in Alonzo Churchs' paper on "An unsolvable problem of elementary number theory" (Americ. Journ. of Math. 58, 1936). Church's paper had answered in the negative Hilbert's question as to whether a definite method existed for proving the truth or falsity of any mathematical statement (the Entscheidungsproblem), but failed to provide the assertion that any such definite method could be expressed as a formula in Church's lambda-calculus. Post proposed that a definite method would be written in the form of instructions to a mindless worker operating on an infinite line of "boxes" (equivalent to Turing's machine's "tape"). The worker would be capable only of reading the instructions and performing the following tasks. This range of tasks corresponds exactly to those performed by a Turing machine, and Church, who edited the "Journal of Symbolic Logic", felt it necessary to insert an editorial note referring to Turing's "shortly forthcoming" paper on computable numbers, and ascertaining that "the present article. although bearing a later date, was written entirely independently of Turing's" (p. 103)." (Origins of Cyberspace, pp. 111-12).Hook & Norman, Origins of Cyberspace, 2002: 355.Charles & Ray Eames, A Computer Perspective, 1973: 125.

Wisconsin, The Association for Symbolic Logic, 1936. Lev8vo. Entire volume one of "Journal of Symbolic Logic" (i.e. number 1-4), March, June, September, December 1936) BOUND WITH ALL THE ORIGINAL WRAPPERS in a blue half cloth with gilt lettering to spine. Crossed-out library paper-label to lower part of spine and top left corner of front board. Two library stamps (in Chinese) to back of front free end-paper. Chinese library-stamp (red) and stamped inventory-number lower part of all four front wrappers. Minor bumping to lower corner of nr. 4, otherwise internally a very fine and clean copy of the entire volume. [Church:] Pp. 40-1" 101-2. [Post:] Pp. 103-5. [Entire volume: 218 pp.]. First publication of Church's seminal paper in which he proved the solution to David Hilbert's "Entscheidungsproblem" from 1928, namely that it is impossible to decide algorithmically whether statements within arithmetic are true or false. In showing that there is no general algorithm for determining whether or not a given statement is true or false, he not only solved Hilbert's "Entscheidungsproblem" but also laid the foundation for modern computer logic. This conclusion is now known as Church's Theorem or the Church-Turing Theorem (not to be mistaken with the Church-Turing Thesis). The present paper anticipates Turing's famous "On Computable Numbers" by a few months. "Church's paper, submitted on April 15, 1936, was the first to contain a demonstration that David Hilbert's 'Entscheidungsproblem' - i.e., the question as to whether there exists in mathematics a definite method of guaranteeing the truth or falsity of any mathematical statement - was unsolvable. Church did so by devising the 'lambda-calculus', [.] Church had earlier shown the existence of an unsolvable problem of elementary number theory, but his 1936 paper was the first to put his findings into the exact form of an answer to Hilbert's 'Entscheidungsproblem'. Church's paper bears on the question of what is computable, a problem addressed more directly by Alan Turing in his paper 'On computable numbers' published a few months later. The notion of an 'effective' or 'mechanical' computation in logic and mathematics became known as the Church-Turing thesis." (Hook & Norman: Origins of Cyberspace, 250) The volume also contains first printing of Post's seminal paper, in which he, simultaneously with but independently of Turing, describes a logic automaton, which very much resembles the Turing machine. The Universal Turing Machine, which is presented for the first time in Turing's seminal paper in the Proceedings of the London Mathematical Society for 1936, is considered one of the most important innovations in the theory of computation and constitutes the most famous theoretical paper in the history of computing. "Post [in the present paper] suggests a computation scheme by which a "worker" can solve all problems in symbolic logic by performing only machinelike "primitive acts". Remarkably, the instructions given to the "worker" in Post's paper and to a Universal Turing Machine were identical." (A Computer Perspective, p. 125)."The Polish-American mathematician Emil Post made notable contributions to the theory of recursive functions. In the 1930s, independently of Turing, Post came up with the concept of a logic automaton similar to a Turing machine, which he described in the present paper [the paper offered]. Post's paper was intended to fill a conceptual gap in Alonzo Churchs' paper on "An unsolvable problem of elementary number theory" (Americ. Journ. of Math. 58, 1936). Church's paper had answered in the negative Hilbert's question as to whether a definite method existed for proving the truth or falsity of any mathematical statement (the Entscheidungsproblem), but failed to provide the assertion that any such definite method could be expressed as a formula in Church's lambda-calculus. Post proposed that a definite method would be written in the form of instructions to a mindless worker operating on an infinite line of "boxes" (equivalent to Turing's machine's "tape"). The worker would be capable only of reading the instructions and performing the following tasks. This range of tasks corresponds exactly to those performed by a Turing machine, and Church, who edited the "Journal of Symbolic Logic", felt it necessary to insert an editorial note referring to Turing's "shortly forthcoming" paper on computable numbers, and ascertaining that "the present article. although bearing a later date, was written entirely independently of Turing's" (p. 103)." (Origins of Cyberspace, pp. 111-12).Even though Post's work to some degree has been outshined by Turing's, the present paper is of seminal importance in the history of the foundation for modern computer logic and the ideological basis for the modern computer.The volume also contains the following important papers by W. V. Quine:1. Toward a Calculus of Concepts. Pp. 2-25.2. Set-theoretic Foundations for Logic. Pp. 45-57.Hook & Norman, Origins of Cyberspace, 2002: 250 + 356 Charles & Ray Eames, A Computer Perspective, 1973: 125.