![]() |
Complexity: Knots, Colourings and Counting
ISBN: 9780521457408 / Angielski / Miękka / 172 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The aim of these notes is to link algorithmic problems arising in knot theory with statistical physics and classical combinatorics. Apart from the theory of computational complexity needed to deal with enumeration problems, introductions are given to several of the topics, such as combinatorial knot theory, randomized approximation models, percolation, and random cluster models.
The aim of these notes is to link algorithmic problems arising in knot theory with statistical physics and classical combinatorics. Apart from the the...
|
cena:
292,80 zł |
![]() |
The Logical Status of Diagrams
ISBN: 9780521461573 / Angielski / Twarda / 212 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Diagrams are widely used in reasoning about problems in physics, mathematics, and logic, but have traditionally been considered to be only heuristic tools and not valid elements of mathematical proof. This book challenges the prejudice against visualization in the history of logic and mathematics and provides a formal foundation for work on natural reasoning in a visual mode. The author presents Venn diagrams as a formal system of representation and specifies rules of transformation that make this system sound and complete. The soundness of the diagrammatic system refutes the contention that...
Diagrams are widely used in reasoning about problems in physics, mathematics, and logic, but have traditionally been considered to be only heuristic t...
|
cena:
537,73 zł |
![]() |
First Steps in Modal Logic
ISBN: 9780521464826 / Angielski / Twarda / 332 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This is a graduate-level text for a first course in propositional modal logic. It is written from the semantical point of view rather than the more usual proof theoretic approach, and the book covers all basic material including the propositional languages, the semantics and correspondence results, and proof systems and completeness results--as well as some topics not usually covered in a modal logic course, such as bisimulation. Important features of the book are the many exercises and extensive set of solutions that are included.
This is a graduate-level text for a first course in propositional modal logic. It is written from the semantical point of view rather than the more us...
|
cena:
449,93 zł |
![]() |
Set Theory, Logic and Their Limitations
ISBN: 9780521479981 / Angielski / Miękka / 300 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. In this introduction to set theory and logic, the author discusses first order logic, and gives a rigorous axiomatic presentation of Zermelo-Fraenkel set theory. He includes many methodological remarks and explanations, and demonstrates how the basic concepts of mathematics can be reduced to set theory. He explains concepts and results of recursion theory in intuitive terms, and reaches the limitative results of Skolem, Tarski, Church and Godel (the celebrated incompleteness theorems). For students of mathematics and philosophy, this book provides an excellent introduction to logic and set...
In this introduction to set theory and logic, the author discusses first order logic, and gives a rigorous axiomatic presentation of Zermelo-Fraenkel ...
|
cena:
218,87 zł |
![]() |
Complexity and Information
ISBN: 9780521485067 / Angielski / Miękka / 154 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The twin themes of computational complexity and information pervade this book. It starts with an introduction to information-based complexity, that is, the computational complexity of continuous mathematical models. It then moves to a variety of topics, including breaking the curse of dimensionality, complexity of path integration, solvability of ill-posed problems, value of information in computation, assigning values to mathematical hypotheses, and mathematical finance. The style is informal, and the goal is motivation and insight. Precise statements and proofs can be found in the...
The twin themes of computational complexity and information pervade this book. It starts with an introduction to information-based complexity, that is...
|
cena:
223,49 zł |
![]() |
Computability, Enumerability, Unsolvability
ISBN: 9780521557368 / Angielski / Miękka / 356 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book provide a picture of current ideas and methods in the ongoing investigations into the structure of the computable and noncomputable universe. A number of the articles contain introductory and background material that will make the volume an invaluable resource for mathematicians and computer scientists.
The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science....
|
cena:
297,42 zł |
![]() |
Advances in Linear Logic
ISBN: 9780521559614 / Angielski / Miękka / 400 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This volume gives an overview of linear logic in five parts: category theory; complexity and expressivity; proof theory; proof nets; and the geometry of interaction. The book includes a general introduction to linear logic that will ensure this book's use by the novice as well as the expert. Mathematicians and computer scientists will learn much from this book.
This volume gives an overview of linear logic in five parts: category theory; complexity and expressivity; proof theory; proof nets; and the geometry ...
|
cena:
334,39 zł |
![]() |
A Shorter Model Theory
ISBN: 9780521587136 / Angielski / Miękka / 324 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This is an up-to-date textbook of model theory taking the reader from first definitions to Morley's theorem and the elementary parts of stability theory. Besides standard results such as the compactness and omitting types theorems, it also describes various links with algebra, including the Skolem-Tarski method of quantifier elimination, model completeness, automorphism groups and omega-categoricity, ultraproducts, O-minimality and structures of finite Morley rank. The material on back-and-forth equivalences, interpretations and zero-one laws can serve as an introduction to applications of...
This is an up-to-date textbook of model theory taking the reader from first definitions to Morley's theorem and the elementary parts of stability theo...
|
cena:
311,29 zł |
![]() |
The Principles of Mathematics Revisited
ISBN: 9780521624985 / Angielski / Miękka / 304 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This book, written by one of philosophy's preeminent logicians, argues that many of the basic assumptions common to logic, philosophy of mathematics and metaphysics are in need of change. Jaakko Hintikka proposes a new basic first-order logic and uses it to explore the foundations of mathematics. This new logic enables logicians to express on the first-order level such concepts as equicardinality, infinity, and truth in the same language. Hintikka's new logic is highly original and will prove appealing to logicians, philosophers of mathematics, and mathematicians concerned with the...
This book, written by one of philosophy's preeminent logicians, argues that many of the basic assumptions common to logic, philosophy of mathematics a...
|
cena:
135,69 zł |
![]() |
Principia Mathematica to *56
ISBN: 9780521626064 / Angielski / Miękka / 460 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The great three-volume Principia Mathematica (CUP 1927) is deservedly the most famous work ever written on the foundations of mathematics. Its aim is to deduce all the fundamental propositions of logic and mathematics from a small number of logical premises and primitive ideas, establishing that mathematics is a development of logic. This abridged text of Volume I contains the material that is most relevant to an introductory study of logic and the philosophy of mathematics (more advanced students will of course wish to refer to the complete edition). It contains the whole of the preliminary...
The great three-volume Principia Mathematica (CUP 1927) is deservedly the most famous work ever written on the foundations of mathematics. Its aim is ...
|
cena:
468,41 zł |
![]() |
Practical Foundations of Mathematics
ISBN: 9780521631075 / Angielski / Twarda / 588 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Practical Foundations of Mathematics explains the basis of mathematical reasoning both in pure mathematics itself (algebra and topology in particular) and in computer science. In addition to the formal logic, this volume examines the relationship between computer languages and "plain English" mathematical proofs. The book introduces the reader to discrete mathematics, reasoning, and categorical logic. It offers a new approach to term algebras, induction and recursion and proves in detail the equivalence of types and categories. Each idea is illustrated by wide-ranging examples, and followed...
Practical Foundations of Mathematics explains the basis of mathematical reasoning both in pure mathematics itself (algebra and topology in particular)...
|
cena:
736,43 zł |
![]() |
Sets and Proofs
ISBN: 9780521635493 / Angielski / Miękka / 448 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Together, Sets and Proofs and its sister volume Models and Computability will provide readers with a comprehensive guide to the current state of mathematical logic. All the authors are leaders in their fields and are drawn from the invited speakers at "Logic Colloquium "97" (the major international meeting of the Association of Symbolic Logic). It is expected that the breadth and timeliness of these two volumes will prove an invaluable and unique resource for specialists, postgraduate researchers, and the informed and interested nonspecialist.
Together, Sets and Proofs and its sister volume Models and Computability will provide readers with a comprehensive guide to the current state of mathe...
|
cena:
315,91 zł |
![]() |
Models and Computability
ISBN: 9780521635509 / Angielski / Miękka / 430 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Together, Models and Computability and its sister volume Sets and Proofs provide readers with a comprehensive guide to the current state of mathematical logic. All the authors are leaders in their fields and are drawn from the invited speakers at "Logic Colloquium '97" (the major international meeting of the Association of Symbolic Logic). It is expected that the breadth and timeliness of these two volumes will prove an invaluable and unique resource for specialists, post-graduate researchers, and the informed and interested nonspecialist.
Together, Models and Computability and its sister volume Sets and Proofs provide readers with a comprehensive guide to the current state of mathematic...
|
cena:
315,91 zł |
![]() |
Analysis and Logic
ISBN: 9780521648615 / Angielski / Miękka / 284 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This volume presents articles from four outstanding researchers who work at the cusp of analysis and logic. The emphasis is on active research topics; many results are presented that have not been published before and open problems are formulated. Considerable effort has been made by the authors to make their articles accessible to mathematicians new to the area
This volume presents articles from four outstanding researchers who work at the cusp of analysis and logic. The emphasis is on active research topics;...
|
cena:
297,42 zł |
![]() |
Computability and Logic
ISBN: 9780521701464 / Angielski / Miękka / 366 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel s incompleteness theorems, but also a large number of optional topics, from Turing s theory of computability to Ramsey s theorem. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel...
Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simp...
|
cena:
154,17 zł |
![]() |
An Introduction to Many-Valued and Fuzzy Logic: Semantics, Algebras, and Derivation Systems
ISBN: 9780521707572 / Angielski / Miękka / 342 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. This volume is an accessible introduction to the subject of many-valued and fuzzy logic suitable for use in relevant advanced undergraduate and graduate courses. The text opens with a discussion of the philosophical issues that give rise to fuzzy logic - problems arising from vague language - and returns to those issues as logical systems are presented. For historical and pedagogical reasons, three-valued logical systems are presented as useful intermediate systems for studying the principles and theory behind fuzzy logic.
This volume is an accessible introduction to the subject of many-valued and fuzzy logic suitable for use in relevant advanced undergraduate and gradua...
|
cena:
388,45 zł |
![]() |
Derivation and Computation: Taking the Curry-Howard Correspondence Seriously
ISBN: 9780521771733 / Angielski / Twarda / 412 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. The two notions of proofs and calculations are intimately related. Proofs can involve calculations, and the algorithm underlying a calculation should be proved correct. This volume explores this key relationship and introduces simple type theory. Starting from the familiar propositional calculus, the author develops the central idea of an applied lambda-calculus. This is illustrated by an account of Godel's T, a system that codifies number-theoretic function hierarchies. Each of the book's 52 sections ends with a set of exercises, some 200 in total. An appendix contains complete solutions of...
The two notions of proofs and calculations are intimately related. Proofs can involve calculations, and the algorithm underlying a calculation should ...
|
cena:
625,52 zł |
![]() |
Model Theory, Algebra, and Geometry
ISBN: 9780521780681 / Angielski / Twarda / 236 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Model theory is a branch of mathematical logic that has found applications in several areas of algebra and geometry. It provides a unifying framework for the understanding of old results and more recently has led to significant new results, such as a proof of the Mordell-Lang conjecture for function fields in positive characteristic. Perhaps surprisingly, it is sometimes the most abstract aspects of model theory that are relevant to those applications. This book gives the necessary background for understanding both the model theory and the mathematics behind the applications. Aimed at...
Model theory is a branch of mathematical logic that has found applications in several areas of algebra and geometry. It provides a unifying framework ...
|
cena:
537,73 zł |
![]() |
Introduction to Lattices and Order
ISBN: 9780521784511 / Angielski / Miękka / 312 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Ordered structures have been increasingly recognized in recent years due to an explosion of interest in theoretical computer science and all areas of discrete mathematics. This book covers areas such as ordered sets and lattices. A key feature of ordered sets, one which is emphasized in the text, is that they can be represented pictorially. Lattices are also considered as algebraic structures and hence a purely algebraic study is used to reinforce the ideas of homomorphisms and of ideals encountered in group theory and ring theory. Exposure to elementary abstract algebra and the rotation of...
Ordered structures have been increasingly recognized in recent years due to an explosion of interest in theoretical computer science and all areas of ...
|
cena:
214,20 zł |
![]() |
Computability and Logic
ISBN: 9780521877527 / Angielski / Twarda / 366 str. Termin realizacji zamówienia: ok. 5-8 dni roboczych. Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel s incompleteness theorems, but also a large number of optional topics, from Turing s theory of computability to Ramsey s theorem. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel...
Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simp...
|
cena:
422,19 zł |