Angles Dauriac (30 results)

Condition: Good. *Price HAS BEEN REDUCED by 10% until Monday, Jan. 12 (weekend sale item)* 150 pp., 4 folding graphs, reprinted from Bulletin de la Societe de l'industrie Minerale; library book plate and markings, light general age toning, later cloth with original paper sides retained, - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.

Couverture souple. Condition: Assez bon. Sciences. Avant-propos de M. Drancourt. Economie. 16x24 cm. 215 p. Broché à couverture souple illustrée. Etat correct. Couverture défraîchie avec trace de pliure et frottements (1er plat). Papier légèrement bruni. Rares rousseurs en tranche. in-8°.

Couverture souple. Condition: Bon. Coll. "Bibliothèque de philosophie contemporaine Histoire de la philosophie et philosophie générale". Philosophie. Tome II (2) seul. 1 seul volume ! 14,5x23,5 cm. 228 p. Broché. Bon état. Intérieur en bon état. Dos insolé. Non coupé. in-8°.

Paris, Editions du Tambourinaire, 1958, format 260x215mm, broché, 310 pages, nombreuses illustrations photographiques sur l'ensemble de l'ouvrage, exemplaire en bon état. Sommaire : PREMIERE PARTIE ( TECHNIQUE ) : Introduction historique par Pierre David, Principes fondamentaux de la Télévision en noir et blanc par Yvon Delbord, L'Oeil impose à la Télévision sa technique par Jean Devaux, Développement actuel de la Télévison en France et dans le Monde par Maurice Jean, Applications scientifiques, pédagogiques et industrielles de la Télévision par Mario Sollima, Applications militaires par Pierre David, Studios et reportages, installations, exploitations techniques par Yves Angel, Télévision de demain, couleur, relief et autres merveilles par Henri Angles d'Auriac, La Télévision dans l'économie française par Roger Marty, DEUXIEME PARTIE ( ARTISTIQUE ) : Ce que devrait être la Télévision par Sacha Guitry, La Critique et la Télévision par Etienne Lalou, Reportages en direct ( Que l'objectif reste objectif ) par Pierre Tchernia, Cinéma et Télévision par Georges Charensol, Cirque et Music-hall par Gilles Margaritis, Les Variétés par Pierre Brive, La Télévision et les Echanges internationaux par Michel Robida, La Télévision sous-marine par le Commandant Jacques-Yves Cousteau, Une Faune électronique par Nicole Vedres, TROISIEME PARTIE ( PSYCHOLOGIQUE ) : Rôle éducateur de la Télévision par Mgr Pierre Jobit, Hygiène mentale et Télévision ( Emprise de l'image visuelle ) par le Docteur Henri Ey, La Télévision au foyer par Yves Gandon, Hygiène du Téléspectateur ( Discipline - Posologie ) par Claude Mauriac, L'Inconnue dans la maison par Jeanine Delpech, De la Télévision sentimentale par Pierre Mac Orlan .

Paris, Presses Universitaire de France, 1954, in-8, br. edit., pp. XXIII, 293, [3]. "Essai de philosophie générale", tome I.

Paperback. Condition: Brand New. 288 pages. French language. 9.45x6.30x0.71 inches. In Stock.

Condition: DISCRETO USATO. Bibliothèque de philosophie contemporaine Francese Volume in lingua francese. Brossura illustrata ed ingiallita dal tempo mostrante segni di usura ai margini abrasi con piccoli strappi alle cuffie e tracce di usura da sfregamento ai piatti. Pagine ingiallite dal tempo. Bordi a barbe cotti e logorati non impedenti la fruibilità. Fogli intonsi. Numero pagine 228.

Condition: like new. Envoi avec suivi, rapide et soigné. Vendeur Pro specialiste livre depuis plus de 10 ans, produit en stock, expédié en 24 heures depuis la France, emballage soigné sous bulles (pour les envois de plus de 6 euros).

Condition: like new. sous blister. Envoi avec suivi, rapide et soigné. Vendeur Pro specialiste livre depuis plus de 10 ans, produit en stock, expédié en 24 heures depuis la France, emballage soigné sous bulles (pour les envois de plus de 6 euros).

Paperback. Condition: New. Milliken's tree theorem is a deep result in combinatorics that generalizes a vast number of other results in the subject, most notably Ramsey's theorem and its many variants and consequences. In this sense, Milliken's tree theorem is paradigmatic of structural Ramsey theory, which seeks to identify the common combinatorial and logical features of partition results in general. Its investigation in this area has consequently been extensive.Motivated by a question of Dobrinen, we initiate the study of Milliken's tree theorem from the point of view of computability theory. The goal is to understand how close it is to being algorithmically solvable, and how computationally complex are the constructions needed to prove it. This kind of examination enjoys a long and rich history, and continues to be a highly active endeavor. Applied to combinatorial principles, particularly Ramsey's theorem, it constitutes one of the most fruitful research programs in computability theory as a whole. The challenge to studying Milliken's tree theorem using this framework is its unusually intricate proof, and more specifically, the proof of the Halpern-La¨uchli theorem, which is a key ingredient.Our advance here stems from a careful analysis of the Halpern-Läuchli theorem which shows that it can be carried out effectively (i.e., that it is computably true). We use this as the basis of a new inductive proof of Milliken's tree theorem that permits us to gauge its effectivity in turn. The key combinatorial tool we develop for the inductive step is a fast-growing computable function that can be used to obtain a finitary, or localized, version of Milliken's tree theorem. This enables us to build solutions to the full Milliken's tree theorem using effective forcing. The principal result of this is a full classification of the computable content of Milliken's tree theorem in terms of the jump hierarchy, stratified by the size of instance. As usual, this also translates into the parlance of reverse mathematics, yielding a complete understanding of the fragment of second-order arithmetic required to prove Milliken's tree theorem.We apply our analysis also to several well-known applications of Milliken's tree theorem, namely Devlin's theorem, a partition theorem for Rado graphs, and a generalized version of the so-called tree theorem of Chubb, Hirst, and McNicholl. These are all certain kinds of extensions of Ramsey's theorem for different structures, namely the rational numbers, the Rado graph, and perfect binary trees, respectively. We obtain a number of new results about how these principles relate to Milliken's tree theorem and to each other, in terms of both their computability-theoretic and combinatorial aspects. In particular, we establish new structural Ramsey-theoretic properties of the Rado graph theorem and the generalized Chubb-Hirst-McNicholl tree theorem using Zucker's notion of big Ramsey structure.

Paperback. Condition: Brand New. 118 pages. In Stock.

Condition: Très bon. Pour les expéditions internationales, nous consulter au préalable pour l ajustement des frais de port qui pourront peut-être revus à la baisse/ For international shipments, please contact us in advance to adjust shipping costs. | L'Homme et ses machines | Angles d'Auriac, Verhoye | Masson, 1983. In-8° cartonné, 215 pages. Couverture propre . Dos solide . Intérieur frais sans soulignage ou annotation. Exemplaire de bibliothèque : petit code barre en pied de 1re de couv., cotation au dos, rares et discrets petits tampons à l'intérieur de l'ouvrage. Très bon état général pour cet ouvrage. [BT55+].

Condition: Bon. Merci, votre achat aide à financer des programmes de lutte contre l'illettrisme.

Condition: Comme neuf. Merci, votre achat aide à financer des programmes de lutte contre l'illettrisme.

Paperback. Condition: New. Milliken's tree theorem is a deep result in combinatorics that generalizes a vast number of other results in the subject, most notably Ramsey's theorem and its many variants and consequences. In this sense, Milliken's tree theorem is paradigmatic of structural Ramsey theory, which seeks to identify the common combinatorial and logical features of partition results in general. Its investigation in this area has consequently been extensive.Motivated by a question of Dobrinen, we initiate the study of Milliken's tree theorem from the point of view of computability theory. The goal is to understand how close it is to being algorithmically solvable, and how computationally complex are the constructions needed to prove it. This kind of examination enjoys a long and rich history, and continues to be a highly active endeavor. Applied to combinatorial principles, particularly Ramsey's theorem, it constitutes one of the most fruitful research programs in computability theory as a whole. The challenge to studying Milliken's tree theorem using this framework is its unusually intricate proof, and more specifically, the proof of the Halpern-La¨uchli theorem, which is a key ingredient.Our advance here stems from a careful analysis of the Halpern-Läuchli theorem which shows that it can be carried out effectively (i.e., that it is computably true). We use this as the basis of a new inductive proof of Milliken's tree theorem that permits us to gauge its effectivity in turn. The key combinatorial tool we develop for the inductive step is a fast-growing computable function that can be used to obtain a finitary, or localized, version of Milliken's tree theorem. This enables us to build solutions to the full Milliken's tree theorem using effective forcing. The principal result of this is a full classification of the computable content of Milliken's tree theorem in terms of the jump hierarchy, stratified by the size of instance. As usual, this also translates into the parlance of reverse mathematics, yielding a complete understanding of the fragment of second-order arithmetic required to prove Milliken's tree theorem.We apply our analysis also to several well-known applications of Milliken's tree theorem, namely Devlin's theorem, a partition theorem for Rado graphs, and a generalized version of the so-called tree theorem of Chubb, Hirst, and McNicholl. These are all certain kinds of extensions of Ramsey's theorem for different structures, namely the rational numbers, the Rado graph, and perfect binary trees, respectively. We obtain a number of new results about how these principles relate to Milliken's tree theorem and to each other, in terms of both their computability-theoretic and combinatorial aspects. In particular, we establish new structural Ramsey-theoretic properties of the Rado graph theorem and the generalized Chubb-Hirst-McNicholl tree theorem using Zucker's notion of big Ramsey structure.

xxiii + 293pp., dans la série "Bibliothèque de philosophie contemporaine", non coupé, qqs. cachets, bon état, F28312.

Couverture souple. Condition: Bon. Coll. "Publications scientifiques et techniques du ministère de l'air". Vol. n°306. Préface de Julien Kravtchenko. Sciences. III + V + 139 p. 18x27 cm. 139 p. Broché. Bon état. Couverture légèrement défraîchie. Intérieur en bon état. in-4°.

Couverture souple. Condition: bon. R160218246: 1954. In-8. Broché. Etat d'usage, Couv. convenable, Dos satisfaisant, Intérieur acceptable. 228 pages - quelques traces de crayon de couleur rouge en marge à l'intérieur du livre sans conséquence sur la lecture. . . . Classification Dewey : 100-PHILOSOPHIE ET DISCIPLINES CONNEXES.

Couverture souple. Condition: bon. RO80242667: 1954. In-8. Broché. Etat d'usage, Tâchée, Dos fané, Non coupé. 228 pages. . . . Classification Dewey : 190-Philosophie occidentale moderne.

Condition: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Condition: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present.

Condition: Hervorragend. Zustand: Hervorragend | Sprache: Französisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Condition: Sehr gut. Zustand: Sehr gut | Sprache: Französisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Condition: Sehr gut. Zustand: Sehr gut | Seiten: 288 | Sprache: Französisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Condition: Sehr gut. Zustand: Sehr gut | Seiten: 288 | Sprache: Französisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Condition: Hervorragend. Zustand: Hervorragend | Seiten: 288 | Sprache: Französisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Nº Edición: 10 Paginas: 716,00 Idioma: ESPAÑOL.

16 x 24, 714 pp., 206 figures, reliure dos/coins toilés, état moyen (dos légèrement gauchi; 1 cachet).

Couverture souple. Condition: bon. RO40143306: 1955. In-4. Broché. Bon état, Couv. convenable, Dos satisfaisant, Intérieur frais. 139 pages. Illustré de nombreux graphiques et schémas en noir et blanc. Etiquette de code sur le dos, et annotations et tampons de bibliothèque sur le 1er plat et en page de titre. . . . Classification Dewey : 355.021-Militaria.

Leatherbound. Condition: NEW. BOOKS ARE EXEMPT FROM IMPORT DUTIES AND TARIFFS; NO EXTRA CHARGES APPLY. Leatherbound edition. Condition: New. Leather Binding on Spine and Corners with Golden leaf printing on spine. Bound in genuine leather with Satin ribbon page markers and Spine with raised gilt bands. Pages: 734. A perfect gift for your loved ones. Reprinted from 1920 edition. NO changes have been made to the original text. This is NOT a retyped or an ocr'd reprint. Illustrations, Index, if any, are included in black and white. Each page is checked manually before printing. As this print on demand book is reprinted from a very old book, there could be some missing or flawed pages, but we always try to make the book as complete as possible. Fold-outs, if any, are not part of the book. If the original book was published in multiple volumes then this reprint is of only one volume, not the whole set. IF YOU WISH TO ORDER PARTICULAR VOLUME OR ALL THE VOLUMES YOU CAN CONTACT US. Resized as per current standards. Sewing binding for longer life, where the book block is actually sewn (smythe sewn/section sewn) with thread before binding which results in a more durable type of binding. Language: French Pages: 734.