Catalogue Bibliothèque de L'IMIST/CNRST › Résultats de la recherche pour 'su:Logic'

Votre recherche a retourné 547 résultats.

		A framework for priority arguments par Lerman,, M. Publication : New York Cambridge University Press 2010 . xvi, 176 pages , "This book presents a unifying framework for using priority arguments to prove theorems in computability. Priority arguments provide the most powerful theorem-proving technique in the field, but most of the applications of this technique are ad hoc, masking the unifying principles used in the proofs. The proposed framework presented isolates many of these unifying combinatorial principles and uses them to give shorter and easier-to-follow proofs of computability-theoretic theorems. Standard theorems of priority levels 1, 2, and 3 are chosen to demonstrate the framework's use, with all proofs following the same pattern. The last section features a new example requiring priority at all finite levels. The book will serve as a resource and reference for researchers in logic and computability, helping them to prove theorems in a shorter and more transparent manner"--Provided by publisher. 24 cm. Date : 2010 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1), Réserver Ajouter au panier (Supprimer)
		La logique floue et ses applications / par Bouchon-Meunier, B. Publication : Paris : Addison-Wesley France, 1995 . xii, 257 p. : 24 cm. Date : 1995 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1), Réserver Ajouter au panier (Supprimer)
		La négation : formes, figures, conceptualisation : actes du colloque de littérature et de linguistique, Université François Rabelais de Tours, les 8 et 9 octobre 2004 / Publication : Tours : Presses universitaires François Rabelais, 2006 . 540 pages : 21 cm. Date : 2006 Disponibilité : Exemplaires disponibles: La bibliothèque des lettres et sciences humaines et sociales (1), Réserver Ajouter au panier (Supprimer)
		The evolution of Principia mathematica : Bertrand Russell's manuscripts and notes for the second edition par Linsky, Bernard. Publication : Cambridge \| New York Cambridge University Press 2011 . vii, 407 pages , "Originally published in 1910, Principia Mathematica led to the development of mathematical logic and computers and thus to information sciences. It became a model for modern analytic philosophy and remains an important work. In the late 1960s the Bertrand Russell Archives at McMaster University in Canada obtained Russell's papers, letters and library. These archives contained the manuscripts for the new Introduction and three Appendices that Russell added to the second edition in 1925. Also included was another manuscript, 'The Hierarchy of Propositions and Functions', which was divided up and re-used to create the final changes for the second edition. These documents provide fascinating insight, including Russell's attempts to work out the theorems in the flawed Appendix B, 'On Induction'. An extensive introduction describes the stages of the manuscript material on the way to print and analyzes the proposed changes in the context of the development of symbolic logic after 1910"-- 26 cm. Date : 2011 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1), Réserver Ajouter au panier (Supprimer)
		A concise introduction to mathematical logic par Rautenberg,, Wolfgang. Publication : New York, NY Springer 2006 . xvii, 256 pages 24 cm. Date : 2006 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1), Réserver Ajouter au panier (Supprimer)
		A transition to abstract mathematics: learning mathematical thinking and writing par Maddox, Randall. Publication : [S.l.] Academic Press 2009 . 356 p. , Constructing concise and correct proofs is one of the most challenging aspects of learning to work with advanced mathematics. Meeting this challenge is a defining moment for those considering a career in mathematics or related fields. Mathematical Thinking and Writing teaches readers to construct proofs and communicate with the precision necessary for working with abstraction. It is based on two premises: composing clear and accurate mathematical arguments is critical in abstract mathematics, and that this skill requires development and support. Abstraction is the destination, not the starting point. Maddox methodically builds toward a thorough understanding of the proof process, demonstrating and encouraging mathematical thinking along the way. Skillful use of analogy clarifies abstract ideas. Clearly presented methods of mathematical precision provide an understanding of the nature of mathematics and its defining structure. After mastering the art of the proof process, the reader may pursue two independent paths. The latter parts are purposefully designed to rest on the foundation of the first, and climb quickly into analysis or algebra. Maddox addresses fundamental principles in these two areas, so that readers can apply their mathematical thinking and writing skills to these new concepts. From this exposure, readers experience the beauty of the mathematical landscape and further develop their ability to work with abstract ideas. * Covers the full range of techniques used in proofs, including contrapositive, induction, and proof by contradiction * Explains identification of techniques and how they are applied in the specific problem * Illustrates how to read written proofs with many step by step examples * Includes 20% more exercises than the first edition that are integrated into the material instead of end of chapter * The Instructors Guide and Solutions Manual points out which exercises simply must be either assigned or at least discussed because they undergird later results. 24 cm. Date : 2009 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1), Réserver Ajouter au panier (Supprimer)
		Advanced asic chip synthesis using synopsys℗ design compiler℗ physical compiler℗ and primetime℗ / par Bhatnagar, Himanshu. Publication : [S.l.] : Springer, 2001 . 360 p. ; , Advanced ASIC Chip Synthesis: Using Synopsys TM Design CompilerTM Physical CompilerTM and PrimeTime TM, Second Edition describes the advanced concepts and techniques used towards ASIC chip synthesis, physical synthesis, formal verification and static timing analysis, using the Synopsys suite of tools. In addition, the entire ASIC design flow methodology targeted for VDSM (Very-Deep-Sub-Micron) technologies is covered in detail. The emphasis of this book is on real-time application of Synopsys tools, used to combat various problems seen at VDSM geometries. Readers will be exposed to an effective design methodology for handling complex, sub-micron ASIC designs. Significance is placed on HDL coding styles, synthesis and optimization, dynamic simulation, formal verification, DFT scan insertion, links to layout, physical synthesis, and static timing analysis. At each step, problems related to each phase of the design flow are identified, with solutions and work-around described in detail. In addition, crucial issues related to layout, which includes clock tree synthesis and back-end integration (links to layout) are also discussed at length. Furthermore, the book contains in-depth discussions on the basis of Synopsys technology libraries and HDL coding styles, targeted towards optimal synthesis solution. Target audiences for this book are practicing ASIC design engineers and masters level students undertaking advanced VLSI courses on ASIC chip design and DFT techniques. 24 cm. Date : 2001 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1), Réserver Ajouter au panier (Supprimer)
		Advanced topics in bisimulation and coinduction Publication : Cambridge \| New York Cambridge University Press 2012 . xiii, 326 pages , "Coinduction is a method for specifying and reasoning about infinite data types and automata with infinite behaviour. In recent years, it has come to play an ever more important role in the theory of computing. It is studied in many disciplines, including process theory and concurrency, modal logic and automata theory. Typically, coinductive proofs demonstrate the equivalence of two objects by constructing a suitable bisimulation relation between them. This collection of surveys is aimed at both researchers and Master's students in computer science and mathematics and deals with various aspects of bisimulation and coinduction, with an emphasis on process theory. Seven chapters cover the following topics: history, algebra and coalgebra, algorithmics, logic, higher-order languages, enhancements of the bisimulation proof method, and probabilities. Exercises are also included to help the reader master new material"-- 24 cm. Date : 2012 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1), Réserver Ajouter au panier (Supprimer)
		An introduction to bisimulation and coinduction par Sangiorgi, Davide. Publication : Cambridge \| New York Cambridge University Press 2012 . xii, 247 pages , "Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning on them. Coinduction is the dual of induction and as such it brings in quite different tools. Today, it is widely used in computer science, but also in other fields, including artificial intelligence, cognitive science, mathematics, modal logics, philosophy and physics. The best known instance of coinduction is bisimulation, mainly employed to define and prove equalities among potentially infinite objects: processes, streams, non-well-founded sets, etc. This book presents bisimulation and coinduction: the fundamental concepts and techniques and the duality with induction. Each chapter contains exercises and selected solutions, enabling students to connect theory with practice. A special emphasis is placed on bisimulation as a behavioural equivalence for processes. Thus the book serves as an introduction to models for expressing processes (such as process calculi) and to the associated techniques of operational and algebraic analysis"-- \| "Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning on them. Coinduction is the dual of induction, and as such it brings in quite different tools. Today, it is widely used in computer science, but also in other fields, including artificial intelligence, cognitive science, mathematics, modal logics, philosophy and physics. The best known instance of coinduction is bisimulation, mainly employed to define and prove equalities among potentially infinite objects: processes, streams, nonwell- founded sets, etc"-- 25 cm. Date : 2012 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1), Réserver Ajouter au panier (Supprimer)
		An Introduction to quantum computing / par Kaye, Phillip. Publication : [S.l.] : Oxford University Press, USA, 2007 . 288 p. ; , This concise, accessible text provides a thorough introduction to quantum computing - an exciting emergent field at the interface of the computer, engineering, mathematical and physical sciences. Aimed at advanced undergraduate and beginning graduate students in these disciplines, the text is technically detailed and is clearly illustrated throughout with diagrams and exercises. Some prior knowledge of linear algebra is assumed, including vector spaces and inner products. However, prior familiarity with topics such as tensor products and spectral decomposition is not required, as the necessary material is reviewed in the text. 24 cm. Date : 2007 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1), Réserver Ajouter au panier (Supprimer)
		Around classification theory of models par Shelah,, Saharon. Publication : [S.l.] Springer 2008 . 279 p. 24 cm. Date : 2008 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1), Réserver Ajouter au panier (Supprimer)
		Category theory applications to algebra, logic and topology. proceedings of the international conference held at gummersbach, july 6-10, 1981 ... in mathematics) / Publication : [S.l.] Springer 2008 . 322 p. 24 cm. Date : 2008 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1), Réserver Ajouter au panier (Supprimer)
		Classification theory : proceedings of the U.S.-israel workshop on model theory in mathematical logic held in chicago, dec. 15-19, 1985 Publication : [S.l.] Springer 1988 . 500 p. 24 cm. Date : 1988 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1), Réserver Ajouter au panier (Supprimer)
		Cognitive reasoning : a formal approach / par Anshakov, O. M. Publication : Heidelberg ; \| New York : Springer, 2010 . 1 online resource (x, 437 pages) : Date : 2010 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1), Réserver Ajouter au panier (Supprimer)
		Coherent systems / par Schlechta,, Karl. Publication : Amsterdam ; \| Boston : Elsevier, 2004 . xx, 447 p. : 24 cm. Date : 2004 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1), Réserver Ajouter au panier (Supprimer)
		Computation engineering applied automata theory and logic par Gopalakrishnan, Ganesh. Publication : New York, NY Springer 2006 . xxxv, 471 pages 25 cm. Date : 2006 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1), Réserver Ajouter au panier (Supprimer)
		Computational logic and human thinking : how to be artificially intelligent par Kowalski, Robert. Publication : Cambridge \| New York : Cambridge University Press 2011 . xxii, 310 pages , "The practical benefits of computational logic need not be limited to mathematics and computing. As this book shows, ordinary people in their everyday lives can profit from the recent advances that have been developed for artificial intelligence. The book draws upon related developments in various fields from philosophy to psychology and law. It pays special attention to the integration of logic with decision theory, and the use of logic to improve the clarity and coherence of communication in natural languages such as English. This book is essential reading for teachers and researchers who may be out of touch with the latest developments in computational logic. It will also be useful in any undergraduate course that teaches practical thinking, problem solving or communication skills. Its informal presentation makes the book accessible to readers from any background, but optional, more formal, chapters are also included for those who are more technically oriented"-- \| "The practical benefits of computational logic need not be limited to mathematics and computing. As this book shows, ordinary people in their everyday lives can profit from the recent advances that have been developed for artificial intelligence. The book draws upon related developments in various fields from philosophy to psychology and law. It pays special attention to the integration of logic with decision theory, and the use of logic to improve the clarity and coherence of communication in natural languages such as English"-- 24 cm. Date : 2011 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1), Réserver Ajouter au panier (Supprimer)
		Computing in nonlinear media & automata collectives / par Adamatzky,, Andrew. Publication : [S.l.] : Taylor & Francis, 2001 . 395 p. ; , The book gives an account of new ways to design massively parallel computing devices in advanced mathematical models (such as cellular automata and lattice swarms), and from unconventional materials, for example chemical solutions, bio-polymers and excitable media. The subject of this book is computing in excitable and reaction-diffusion media. This is one approach to novel computing methods. Other approaches include quantum and evolutionary computation, and swarm optimization. The book explains how to design computing devices in nonlinear media. This is achieved in three steps. First, cellular automaton models of reaction-diffusion and excitable computing are built. Second, natural analogies of simulated phenomena are sought. Third, working prototypes of laboratory processors are fabricated. Throughout the book it is assumed a computation is implemented using spreading waves and spatially interacting reagents. The book is full of examples of computation in cellular automata, swarms of mobile machines, thin-layer chemical liquids, insect societies, solitons, breathers and other wonders of Nature. In this book computer scientists and engineers will find blueprints inspired by Nature for the design of novel computing devices. Mathematicians will find exciting reasons to theorise. Physicists and chemists will be surprised and pleased to find that the systems they study can be used in completely new contexts. Biologists will discover that results of their field experiments also give solutions for celebrated mathematical problems. 25 cm. Date : 2001 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1), Réserver Ajouter au panier (Supprimer)
		Concepts and fuzzy logic / Publication : Cambridge, Mass. : MIT Press, 2011 . ix, 274 pages : 24 cm Date : 2011 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1), Réserver Ajouter au panier (Supprimer)
		Conference in Mathematical Logic, London '70. Publication : Berlin \| New York Springer-Verlag 1972 . vi, 351 pages , Held at Bedford College, London, on 24th-28th August 1970. 26 cm. Date : 1972 Disponibilité : Exemplaires disponibles: La bibliothèque des Sciences Exactes et Naturelles (1), Réserver Ajouter au panier (Supprimer)