![]() |
Set Theory: The Third Millennium Edition, revised and expanded
ISBN: 9783540440857 / Angielski / Twarda / 772 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This monograph covers the recent major advances in various areas of set theory. From the reviews: "One of the classical textbooks and reference books in set theory....The present 'Third Millennium' edition...is a whole new book. In three parts the author offers us what in his view every young set theorist should learn and master....This well-written book promises to influence the next generation of set theorists, much as its predecessor has done." --MATHEMATICAL REVIEWS This monograph covers the recent major advances in various areas of set theory. From the reviews: "One of the classical textbooks a... |
cena:
805,10 |
![]() |
Substitutions in Dynamics, Arithmetics and Combinatorics
ISBN: 9783540441410 / Angielski / Miękka / 404 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. A certain category of infinite strings of letters on a finite alphabet is presented here, chosen among the 'simplest' possible one may build, both because they are very deterministic and because they are built by simple rules (a letter is replaced by a word, a sequence is produced by iteration). These substitutive sequences have a surprisingly rich structure.
The authors describe the concepts of quantity of natural interactions, with combinatorics on words, ergodic theory, linear algebra, spectral theory, geometry of tilings, theoretical computer science, diophantine approximation,... A certain category of infinite strings of letters on a finite alphabet is presented here, chosen among the 'simplest' possible one may build, both bec...
|
cena:
301,89 |
![]() |
Perfect Lattices in Euclidean Spaces
ISBN: 9783540442363 / Angielski / Twarda / 526 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Lattices are discrete subgroups of maximal rank in a Euclidean space. To each such geometrical object, we can attach a canonical sphere packing which, assuming some regularity, has a density. The question of estimating the highest possible density of a sphere packing in a given dimension is a fascinating and difficult problem: the answer is known only up to dimension 3. This book thus discusses a beautiful and central problem in mathematics, which involves geometry, number theory, coding theory and group theory, centering on the study of extreme lattices, i.e.... Lattices are discrete subgroups of maximal rank in a Euclidean space. To each such geometrical object, we can attach a canonical sphere packing whi... |
cena:
603,81 |
![]() |
Many-Valued Logics 1: Theoretical Foundations
ISBN: 9783540559269 / Angielski / Twarda / 288 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Many-valued logics were developed as an attempt to handle philosophical doubts about the "law of excluded middle" in classical logic. The first many-valued formal systems were developed by J. Lukasiewicz in Poland and E.Post in the U.S.A. in the 1920s, and since then the field has expanded dramatically as the applicability of the systems to other philosophical and semantic problems was recognized. Intuitionisticlogic, for example, arose from deep problems in the foundations of mathematics. Fuzzy logics, approximation logics, and probability logics all address questions that classical logic...
Many-valued logics were developed as an attempt to handle philosophical doubts about the "law of excluded middle" in classical logic. The first many-v...
|
cena:
402,53 |
![]() |
Complexité Et Décidabilité
ISBN: 9783540568995 / Francuski / Miękka / 201 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Cet ouvrage presente les bases de la theorie de la complexite des algorithmes et en derive les theoremes fondamentaux de decidabilite et d'indecidabilite pour la logique et l'arithmetique, dont le premier theoreme d'incompletude de Godel. En faisant reposer toutes les preuves sur le codage de l'arret d'une machine de Turing, on a souligne l'homogeneite et l'unite profonde des resultats presentes. L'approche par les machines de Turing est tres accessible grace a la familiarite donnee aujourd'hui par l'informatique. Le livre n'est pas une encyclopedie exhaustive, mais parvient de facon rapide a...
Cet ouvrage presente les bases de la theorie de la complexite des algorithmes et en derive les theoremes fondamentaux de decidabilite et d'indecidabil...
|
cena:
261,63 |
![]() |
Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Volume 2
ISBN: 9783540582762 / Angielski / Twarda / 177 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This three-volume work presents a coherent description of the theoretical and practical aspects of coloured Petri nets (CP-nets). The second volume contains a detailed presentation of the analysis methods for CP-nets. They allow the modeller to investigate dynamic properties of CP-nets.
The main ideas behind the analysis methods are described as well as the mathematics on which they are based and also how the methods are supported by computer tools. Some parts of the volume are theoretical while others are application oriented. The purpose of the volume is to teach the reader how to use... This three-volume work presents a coherent description of the theoretical and practical aspects of coloured Petri nets (CP-nets). The second volume co...
|
cena:
402,53 |
![]() |
Boolean Functions and Computation Models
ISBN: 9783540594369 / Angielski / Twarda / 602 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures deciding the validity of mathematical statements. The first example of such a problem was the undecidability of the Halting Problem which is essentially the question of debugging a computer program: Will a given program eventu- ally halt? Computational complexity today addresses the quantitative aspects of the solutions obtained: Is the problem to be solved tractable? But how does one measure the intractability of computation? Several ideas were...
The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures de...
|
cena:
301,73 |
![]() |
Algebraic Complexity Theory
ISBN: 9783540605829 / Angielski / Twarda / 618 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a...
The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuiti...
|
cena:
563,56 |
![]() |
Elementare Berechenbarkeitstheorie
ISBN: 9783540606673 / Niemiecki / Miękka / 166 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Das Buch fuhrt in leicht verstandlicher und dennoch praziser Form in die Grundlagen der Berechenbarkeitstheorie ein. Es richtet sich an Informatikstudenten, ist aber fur alle an der algorithmischen Berechenbarkeit Interessierten geeignet; vom Leser wird nur eine gewisse Vertrautheit mit formaler Argumentation erwartet. Der Darstellung liegt das Modell der Registermaschine zugrunde, das dem Umgang mit realen Computern und Programmiersprachen entlehnt ist. Daneben werden auch die klassischen Berechenbarkeitsmodelle betrachtet und die Gleichwertigkeit der Ansatze untereinander gezeigt. Daruber...
Das Buch fuhrt in leicht verstandlicher und dennoch praziser Form in die Grundlagen der Berechenbarkeitstheorie ein. Es richtet sich an Informatikstud...
|
cena:
86,51 |
![]() |
Constraint-Programmierung: Grundlagen Und Anwendungen
ISBN: 9783540606703 / Niemiecki / Miękka / 165 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Das Buch gibt einen kompakten, aber umfassenden Uberblick uber das Problemlosen und Programmieren mit "Constraints" (Randbedingungen). Diese aktuelle Programmiermethodik ermoglicht es, Aufgaben direkt zu formulieren und effizient zu losen. Sie gewinnt zusehends Bedeutung in Anwendungsbereichen wie Kombinatorische Suchprobleme (z.B. Zeitplanen, Layout-Optimierung), Berechnungen (Finanzanalyse), Simulation (Hardware-Verifikation) oder allgemein Schliessen und Rechnen mit ungenauer oder unvollstandiger Information (z.B. Kostenschatzung). Die theoretisch fundierte Darstellung mit Aufgaben und...
Das Buch gibt einen kompakten, aber umfassenden Uberblick uber das Problemlosen und Programmieren mit "Constraints" (Randbedingungen). Diese aktuelle ...
|
cena:
86,51 |
![]() |
Lectures on Proof Verification and Approximation Algorithms
ISBN: 9783540642015 / Angielski / Miękka / 348 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabilistically checkable proofs and aproximation algorithms. The basic concepts, methods, and results are presented in a unified way to provide a smooth introduction for newcomers. These...
During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization probl...
|
cena:
201,24 |
![]() |
Completeness and Reduction in Algebraic Complexity Theory
ISBN: 9783540667520 / Angielski / Twarda / 168 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. One of the most important and successful theories in computational complex ity is that of NP-completeness. This discrete theory is based on the Turing machine model and achieves a classification of discrete computational prob lems according to their algorithmic difficulty. Turing machines formalize al gorithms which operate on finite strings of symbols over a finite alphabet. By contrast, in algebraic models of computation, the basic computational step is an arithmetic operation (or comparison) of elements of a fixed field, for in stance of real numbers. Hereby one assumes exact arithmetic....
One of the most important and successful theories in computational complex ity is that of NP-completeness. This discrete theory is based on the Turing...
|
cena:
402,53 |
![]() |
Lattice-Gas Cellular Automata and Lattice Boltzmann Models: An Introduction
ISBN: 9783540669739 / Angielski / Miękka / 314 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Lattice-gas cellular automata (LGCA) and lattice Boltzmann models (LBM) are relatively new and promising methods for the numerical solution of nonlinear partial differential equations. The book provides an introduction for graduate students and researchers. Working knowledge of calculus is required and experience in PDEs and fluid dynamics is recommended. Some peculiarities of cellular automata are outlined in Chapter 2. The properties of various LGCA and special coding techniques are discussed in Chapter 3. Concepts from statistical mechanics (Chapter 4) provide the necessary theoretical...
Lattice-gas cellular automata (LGCA) and lattice Boltzmann models (LBM) are relatively new and promising methods for the numerical solution of nonline...
|
cena:
261,63 |
![]() |
Formal Correctness of Security Protocols
ISBN: 9783540681342 / Angielski / Twarda / 296 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The author investigates proofs of correctness of realistic security protocols in a formal, intuitive setting. The protocols examined include Kerberos versions, smartcard protocols, non-repudiation protocols, and certified email protocols. The method of analysis turns out to be both powerful and flexible. This research advances significant extensions to the method of analysis, while the findings on the protocols analysed are novel and illuminating. The author investigates proofs of correctness of realistic security protocols in a formal, intuitive setting. The protocols examined include Kerber... |
cena:
201,24 |
![]() |
Theory and Applications of Satisfiability Testing - SAT 2007: 10th International Conference, Lisbon, Portugal, May 28-31, 2007 Proceedings
ISBN: 9783540727873 / Angielski / Miękka / 404 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This volume contains the papers presented at SAT 2007: 10th International Conference on Theory and Applications of Satis?ability Testing. The International Conferences on Theory and Applications of Satis?ability Testing (SAT) originated in 1996 as a series of workshops on Satis?ability. By the third meeting in 2000, the workshop had attracted a mix of theorists and experimentalists whose common interest was the enhancement of our basic understanding of the theoretical underpinnings of the Satis?ability problem as well as the development of scalable algorithms for its solution in a wide range...
This volume contains the papers presented at SAT 2007: 10th International Conference on Theory and Applications of Satis?ability Testing. The Internat...
|
cena:
201,24 |
![]() |
Rewriting, Computation and Proof: Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday
ISBN: 9783540731467 / Angielski / Miękka / 276 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Jean-Pierre Jouannaud has deeply influenced, and is still influencing, research in Informatics, through the many important results he has produced in various research fields and through the generations of scholars he has educated. He has played a leading role in field of rewriting and its technology, advancing the research areas of unification, rewriting and completion modulo, conditional rewriting, termination proofs, modular properties, and automated proofs by induction in rewrite theories. Following his strong interest for algebraic specification languages and their efficient... Jean-Pierre Jouannaud has deeply influenced, and is still influencing, research in Informatics, through the many important results he has produced ... |
cena:
201,24 |
![]() |
Modelling Distributed Systems
ISBN: 9783540739371 / Angielski / Twarda / 154 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This textbook guides students through algebraic specification and verification of distributed systems, and some of the most prominent formal verification techniques. The author employs CRL as the vehicle, a language developed to combine process algebra and abstract data types. The book evolved from introductory courses on protocol verification taught to undergraduate and graduate students of computer science, and the text is supported throughout with examples and exercises. Full solutions are provided in an appendix, while exercise sheets, lab exercises, example specifications and lecturer... This textbook guides students through algebraic specification and verification of distributed systems, and some of the most prominent formal verifi... |
cena:
201,24 |
![]() |
Elements of Logic Via Numbers and Sets
ISBN: 9783540761235 / Angielski / Miękka / 188 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. In mathematics we are interested in why a particular formula is true. Intuition and statistical evidence are insufficient, so we need to construct a formal logical proof. The purpose of this book is to describe why such proofs are important, what they are made of, how to recognize valid ones, how to distinguish different kinds, and how to construct them. This book is written for 1st year students with no previous experience of formulating proofs. Dave Johnson has drawn from his considerable experience to provide a text that concentrates on the most important elements of the subject using...
In mathematics we are interested in why a particular formula is true. Intuition and statistical evidence are insufficient, so we need to construct a f...
|
cena:
140,86 |
![]() |
George Boole: Selected Manuscripts on Logic and Its Philosophy
ISBN: 9783764354565 / Angielski / Twarda / 236 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. George Boole (1815-1864) is well known to mathematicians for his research and textbooks on the calculus, but his name has spread world-wide for his innovations in symbolic logic and the development and applications made since his day. The utility of "Boolean algebra" in computing has greatly increased curiosity in the nature and extent of his achievements. His work is most accessible in his two books on logic, "A mathematical analysis of logic" (1947) and "An investigation of the laws of thought" (1954). But at various times he wrote manuscript essays, especially after the publication of the...
George Boole (1815-1864) is well known to mathematicians for his research and textbooks on the calculus, but his name has spread world-wide for his in...
|
cena:
201,24 |
![]() |
Gnomes in the Fog: The Reception of Brouwer's Intuitionism in the 1920s
ISBN: 9783764365363 / Angielski / Twarda / 448 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The significance of foundational debate in mathematics that took place in the 1920s seems to have been recognized only in circles of mathematicians and philosophers. A period in the history of mathematics when mathematics and philosophy, usually so far away from each other, seemed to meet. The foundational debate is presented with all its brilliant contributions and its shortcomings, its new ideas and its misunderstandings. The significance of foundational debate in mathematics that took place in the 1920s seems to have been recognized only in circles of mathem... |
cena:
402,53 |