Grove Press. 1967. In-12. Broché. Bon état, Couv. légèrement passée, Dos plié, Intérieur acceptable. 256 pages. Dos des plats jaunis.. . . . Classification Dewey : 420-Langue anglaise. Anglo-saxon
Reference : RO60111353
Grove Press, B 171. By the author of 'City of Night'. Classification Dewey : 420-Langue anglaise. Anglo-saxon
Le-livre.fr / Le Village du Livre
ZI de Laubardemont
33910 Sablons
France
05 57 411 411
Les ouvrages sont expédiés à réception du règlement, les cartes bleues, chèques , virements bancaires et mandats cash sont acceptés. Les frais de port pour la France métropolitaine sont forfaitaire : 6 euros pour le premier livre , 2 euros par livre supplémentaire , à partir de 49.50 euros les frais d'envoi sont de 8€ pour le premier livre et 2€ par livre supplémentaire . Pour le reste du monde, un forfait, selon le nombre d'ouvrages commandés sera appliqué. Tous nos envois sont effectués en courrier ou Colissimo suivi quotidiennement.
Leipzig, Grosse & Gleditsch, 1747. 4to. Contemp. full vellum. Faint handwritten title on spine. Two small stamps to title page and pasted library label to pasted down front free end-paper. In: ""Nova Actorum Eruditorum Anno MDCCXLVII"". (4), 720, (27) pp. + 6 engraved plates. The entire volume offered. [Euler's paper:] Pp. 267-9.
First edition of Euler's paper in which he describes the work that European mathematicians have done on amicable numbers and shows how to find pairs of amicable numbers. He gives the first 30 pairs of which some, but not all, were found with his method.When Euler began his studies only three pairs of amicable numbers were known. In the present and early Euler-paper he mentions the technique that Descartes and Fermat had used ""and listing 30 amicable pairs, including the three already known, and including one ""pair"" that was not actually amicable. Nevertheless, in one paper, Euler lengthened the list of known amicable pairs by a factor of almost ten. Euler gives us almost no clue about how he found these numbers"" (Sandifer, Charles Edward. How Euler did it, 2007, p. 50). ""At this time in which mathematical Analysis has opened the way to many profound observations, those problems which have to do with the nature and properties of numbers seem almost completely neglected by Geometers, and the contemplation of numbers has been judged by many to add nothing to Analysis. Yet truly the investigation of the properties of numbers on many occasions requires more acuity than the subtlest questions of geometry, and for this reason it seems improper to neglect arithmetic questions for those. And indeed the greatest thinkers who are recognized as having made the most important contributions to Analysis have judged the affection of numbers as not unworthy, and in pursuing them have expended much work and study."" (Translation of the introduction of the present paper by Jordan Bell of Carleton University).Enestroem E100.Many other papers by influential contemporary mathematicians, philosophers and historians are to be found in the present volume.
Augustus M. Kelley , Reprints of Economic Classics Malicorne sur Sarthe, 72, Pays de la Loire, France 1967 Book condition, Etat : Bon hardcover, editor's blue printed binding, no dust-jacket grand In-8 1 vol. - 571 pages
61 black and white tables reprint,1967 "Contents, Chapitres : Prefatory note, Prefaces, Suggestions to readers, Table of contents, Contents of appendices, List of tables, List of charts, xxxiii, Text, Appendices, Index, 538 pages - Six types of index numbers compared - Four methods of weighting - Two great reversal tests - Erratic, biased, and freakish index numbers - The two reversal tests as finders of formulae - Rectifying formulae by "" crossing "" them - Rectifying formulae by crossing their weights - The enlarged series of formulae - What simple index number is best ? - What is the best index number ? - Comparing all the index numbers with the "" ideal "", formula 353 - The so-called circular test - Blending the apparently inconsistent results - Speed of calculation - Other practical considerations - Summary and outlook - Appendices : Notes to text - The influence of weighting - An index number an average of ratios rather than a ratio of averages - Landmarks in the history of index numbers - List of formulae for index numbers - Numerical data and examples - Index numbers by 134 formulae for prices by the fixed base system and, in note-worthy cases, the chain system - Selcted bibliography - Review of literature since the first edition" near fine copy, the editor's binding is fine, inside is fine, clean and unmarked, without dust-jacket
(Berlin, Haude et Spener, 1751). 4to. No wrappers, as issued in ""Mémoires de l'Academie Royale des Sciences et Belles-Lettres"", tome V, pp. 139-179.
First edition of this importent paper on the logarithms of complex numbers, where Euler clarified such functions. He disagreed with Leibniz that a special function was only applicable for positive numbers, and showed that i was applicable for both negative and positive numbers, only with a difference of a constant. When Euler here (the offered item) came out with the correct form for the logarithm, it was not generally accepted. - Enestrom, Euler Bibliography E 168.
[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).
1965 1965. Lot 8 Numbers The Charivari (Extreme Droite 1 2 3 4 5 7 10+ Folder Pétain 1965 The description of this item has been automatically translated. If you have any questions please feel free to contact us. 8 issues of the monthly Charivari a monthly clearly anti Gaullist and pro French Algeria; published between October 1965 and July 1966 the numbers 1 2 3 4 5 7 and 10 + the special number 2 bis: the Pétain file by André Figueras (with a preface by Jacques Isorni defender of Pétain) lot in GOOD CONDITION all copies are complete and clean no serious defect to report; Note that apart from numbers 1 and 2 all the newspapers are folded in half. Perlenbook company Siret n ° 49982801100010. RCS Lure Tgi 499 828 911 N ° GESTION 2007 A 111. Created by eBay
Etat correct