![]() |
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
||
|
Books > Science & Mathematics > Mathematics > Mathematical foundations > General
Introduction to Probability with Texas Hold'em Examples illustrates both standard and advanced probability topics using the popular poker game of Texas Hold'em, rather than the typical balls in urns. The author uses students' natural interest in poker to teach important concepts in probability.
Dirk van Dalen's popular textbook "Logic and Structure," now in its fifth edition, provides a comprehensive introduction to the basics of classical and intuitionistic logic, model theory and Godel's famous incompleteness theorem. Propositional and predicate logic are presented in an easy-to-read style using Gentzen's natural deduction. The book proceeds with some basic concepts and facts of model theory: a discussion on compactness, Skolem-Lowenheim, non-standard models and quantifier elimination. The discussion of classical logic is concluded with a concise exposition of second-order logic. In view of the growing recognition of constructive methods and principles, intuitionistic logic and Kripke semantics is carefully explored. A number of specific constructive features, such as apartness and equality, the Godel translation, the disjunction and existence property are also included. The last chapter on Godel's first incompleteness theorem is self-contained and provides a systematic exposition of the necessary recursion theory. This new edition has been properly revised and contains a new section on ultra-products."
Teach Your Students Both the Mathematics of Numerical Methods and the Art of Computer Programming Introduction to Computational Linear Algebra presents classroom-tested material on computational linear algebra and its application to numerical solutions of partial and ordinary differential equations. The book is designed for senior undergraduate students in mathematics and engineering as well as first-year graduate students in engineering and computational science. The text first introduces BLAS operations of types 1, 2, and 3 adapted to a scientific computer environment, specifically MATLAB (R). It next covers the basic mathematical tools needed in numerical linear algebra and discusses classical material on Gauss decompositions as well as LU and Cholesky's factorizations of matrices. The text then shows how to solve linear least squares problems, provides a detailed numerical treatment of the algebraic eigenvalue problem, and discusses (indirect) iterative methods to solve a system of linear equations. The final chapter illustrates how to solve discretized sparse systems of linear equations. Each chapter ends with exercises and computer projects.
Exploring Geometry, Second Edition promotes student engagement with the beautiful ideas of geometry. Every major concept is introduced in its historical context and connects the idea with real-life. A system of experimentation followed by rigorous explanation and proof is central. Exploratory projects play an integral role in this text. Students develop a better sense of how to prove a result and visualize connections between statements, making these connections real. They develop the intuition needed to conjecture a theorem and devise a proof of what they have observed. Features: Second edition of a successful textbook for the first undergraduate course Every major concept is introduced in its historical context and connects the idea with real life Focuses on experimentation Projects help enhance student learning All major software programs can be used; free software from author
In many areas of mathematics some "higher operations" are arising. These havebecome so important that several research projects refer to such expressions. Higher operationsform new types of algebras. The key to understanding and comparing them, to creating invariants of their action is operad theory. This is a point of view that is 40 years old in algebraic topology, but the new trend is its appearance in several other areas, such as algebraic geometry, mathematical physics, differential geometry, and combinatorics. The present volume is the first comprehensive and systematic approach to algebraic operads. An operad is an algebraic device that serves to study all kinds of algebras (associative, commutative, Lie, Poisson, A-infinity, etc.) from a conceptual point of view. The book presents this topic with an emphasis on Koszul duality theory. After a modern treatment of Koszul duality for associative algebras, the theory is extended to operads. Applications to homotopy algebra are given, for instance the Homotopy Transfer Theorem. Although the necessary notions of algebra are recalled, readers are expected to be familiar with elementary homological algebra. Each chapter ends with a helpful summary and exercises. A full chapter is devoted to examples, and numerous figures are included. After a low-level chapter on Algebra, accessible to (advanced) undergraduate students, the level increases gradually through the book. However, the authors have done their best to make it suitable for graduate students: three appendicesreview the basic results needed in order to understand the various chapters. Since higher algebra is becoming essential in several research areas like deformation theory, algebraic geometry, representation theory, differential geometry, algebraic combinatorics, and mathematical physics, the book can also be used as a reference work by researchers. "
This book formally introduces synthetic differential topology, a natural extension of the theory of synthetic differential geometry which captures classical concepts of differential geometry and topology by means of the rich categorical structure of a necessarily non-Boolean topos and of the systematic use of logical infinitesimal objects in it. Beginning with an introduction to those parts of topos theory and synthetic differential geometry necessary for the remainder, this clear and comprehensive text covers the general theory of synthetic differential topology and several applications of it to classical mathematics, including the calculus of variations, Mather's theorem, and Morse theory on the classification of singularities. The book represents the state of the art in synthetic differential topology and will be of interest to researchers in topos theory and to mathematicians interested in the categorical foundations of differential geometry and topology.
Clear, concise compendium of about 150 time-saving math short-cuts features faster, easier ways to add, subtract, multiply, and divide. Each problem includes an explanation of the method, a step-by-step solution, the short-cut solution, and proof, as well as an explanation of why it works. No special math ability needed.
One of the most illuminating, useful and exciting books ever published in the mathematical field Taking only a modicum of knowledge for granted, Lancelot Hogben leads readers of this famous book through the whole course from simple arithmetic to calculus. His illuminating explanation is addressed to the person who wants to understand the place of mathematics in modern civilization but who has been intimidated by its supposed difficulty. Mathematics is the language of size, shape, and order - a language Hogben shows one can both master and enjoy.
The hybrid/heterogeneous nature of future microprocessors and large high-performance computing systems will result in a reliance on two major types of components: multicore/manycore central processing units and special purpose hardware/massively parallel accelerators. While these technologies have numerous benefits, they also pose substantial performance challenges for developers, including scalability, software tuning, and programming issues. Researchers at the Forefront Reveal Results from Their Own State-of-the-Art Work Edited by some of the top researchers in the field and with contributions from a variety of international experts, Scientific Computing with Multicore and Accelerators focuses on the architectural design and implementation of multicore and manycore processors and accelerators, including graphics processing units (GPUs) and the Sony Toshiba IBM (STI) Cell Broadband Engine (BE) currently used in the Sony PlayStation 3. The book explains how numerical libraries, such as LAPACK, help solve computational science problems; explores the emerging area of hardware-oriented numerics; and presents the design of a fast Fourier transform (FFT) and a parallel list ranking algorithm for the Cell BE. It covers stencil computations, auto-tuning, optimizations of a computational kernel, sequence alignment and homology, and pairwise computations. The book also evaluates the portability of drug design applications to the Cell BE and illustrates how to successfully exploit the computational capabilities of GPUs for scientific applications. It concludes with chapters on dataflow frameworks, the Charm++ programming model, scan algorithms, and a portable intracore communication framework. Explores the New Computational Landscape of Hybrid Processors By offering insight into the process of constructing and effectively using the technology, this volume provides a thorough and practical introduction to the area of hybrid computing. It discusses introductory concepts and simple examples of parallel computing, logical and performance debugging for parallel computing, and advanced topics and issues related to the use and building of many applications.
Gerhard Gentzen is best known for his development of the proof systems of natural deduction and sequent calculus, central in many areas of logic and computer science today. Another noteworthy achievement is his resolution of the embarrassing situation created by Goedel's incompleteness results, especially the second one about the unprovability of consistency of elementary arithmetic. After these successes, Gentzen dedicated the rest of his short life to the main problem of Hilbert's proof theory, the question of the consistency of analysis. He was arrested in the summer of 1945 with other professors of the German University of Prague and died soon afterward of starvation in a prison cell. Attempts at locating his lost manuscripts failed at the time, but several decades later, two slim folders of shorthand notes were found. In this volume, Jan von Plato gives an overview of Gentzen's life and scientific achievements, based on detailed archival and systematic studies, and essential for placing the translations of shorthand manuscripts that follow in the right setting. The materials in this book are singular in the way they show the birth and development of Gentzen's central ideas and results, sometimes in a well-developed form, and other times as flashes into the anatomy of the workings of a unique mind.
This book provides an organized exposition of the current state of the theory of commutative semigroup cohomology, a theory which was originated by the author and has matured in the past few years. The work contains a fundamental scientific study of questions in the theory. The various approaches to commutative semigroup cohomology are compared. The problems arising from definitions in higher dimensions are addressed. Computational methods are reviewed. The main application is the computation of extensions of commutative semigroups and their classification. Previously the components of the theory were scattered among a number of research articles. This work combines all parts conveniently in one volume. It will be a valuable resource for future students of and researchers in commutative semigroup cohomology and related areas.
Strange Attractors is a collection of approximately 150 poems with strong links to mathematics in content, form, or imagery. The common theme is love, and the editors draw from its various manifestations-romantic love, spiritual love, humorous love, love between parents and children, mathematicians in love, love of mathematics. The poets include literary masters as well as celebrated mathematicians and scientists. "What, after all, is mathematics but the poetry of the mind, and what is poetry but the mathematics of the heart?" So wrote the American mathematician and educator David Eugene Smith. In a similar vein, the German mathematician Karl Weierstrass declared, "A mathematician who is not at the same time something of a poet will never be a full mathematician." Most mathematicians will know what they meant. But what do professional poets think of mathematics? In this delightful collection, the editors present the view of the same terrain-the connections between mathematics and poetry-from the other side of the equation: the poets. Now is your chance to see if the equation balances. -Keith Devlin, mathematician, Stanford University, and author of The Math Gene, The Math Instinct, and The Language of Mathematics
This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of computing. Beginning with an introduction to the mathematisation of "mechanical process" using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs. Advanced chapters cover the Ackerman function, Tarski's theorem on the non-representability of truth, Goedel's incompleteness and Rosser's incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Church's thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oracle computations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blum's complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions.
This book provides comprehensive, graduate-level treatment of analog and digital signal analysis suitable for course use and self-guided learning. This expert text guides the reader from the basics of signal theory through a range of application tools for use in acoustic analysis, geophysics, and data compression. Each concept is introduced and explained step by step, and the necessary mathematical formulae are integrated in an accessible and intuitive way. The first part of the book explores how analog systems and signals form the basics of signal analysis. This section covers Fourier series and integral transforms of analog signals, Laplace and Hilbert transforms, the main analog filter classes, and signal modulations. Part II covers digital signals, demonstrating their key advantages. It presents z and Fourier transforms, digital filtering, inverse filters, deconvolution, and parametric modeling for deterministic signals. Wavelet decomposition and reconstruction of non-stationary signals are also discussed. The third part of the book is devoted to random signals, including spectral estimation, parametric modeling, and Tikhonov regularization. It covers statistics of one and two random variables and the principles and methods of spectral analysis. Estimation of signal properties is discussed in the context of ergodicity conditions and parameter estimations, including the use of Wiener and Kalman filters. Two appendices cover the basics of integration in the complex plane and linear algebra. A third appendix presents a basic Matlab toolkit for computer signal analysis. This expert text provides both a solid theoretical understanding and tools for real-world applications.
This volume collects chapters that examine representation theory as connected with affine Lie algebras and their quantum analogues, in celebration of the impact Vyjayanthi Chari has had on this area. The opening chapters are based on mini-courses given at the conference "Interactions of Quantum Affine Algebras with Cluster Algebras, Current Algebras and Categorification", held on the occasion of Chari's 60th birthday at the Catholic University of America in Washington D.C., June 2018. The chapters that follow present a broad view of the area, featuring surveys, original research, and an overview of Vyjayanthi Chari's significant contributions. Written by distinguished experts in representation theory, a range of topics are covered, including: String diagrams and categorification Quantum affine algebras and cluster algebras Steinberg groups for Jordan pairs Dynamical quantum determinants and Pfaffians Interactions of Quantum Affine Algebras with Cluster Algebras, Current Algebras and Categorification will be an ideal resource for researchers in the fields of representation theory and mathematical physics.
This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2022, held in Deerfield Beach, FL, USA, in January 2022. The 23 revised full papers were carefully reviewed and selected from 35 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science.
This book is an exposition of recent progress on the Donaldson-Thomas (DT) theory. The DT invariant was introduced by R. Thomas in 1998 as a virtual counting of stable coherent sheaves on Calabi-Yau 3-folds. Later, it turned out that the DT invariants have many interesting properties and appear in several contexts such as the Gromov-Witten/Donaldson-Thomas conjecture on curve-counting theories, wall-crossing in derived categories with respect to Bridgeland stability conditions, BPS state counting in string theory, and others. Recently, a deeper structure of the moduli spaces of coherent sheaves on Calabi-Yau 3-folds was found through derived algebraic geometry. These moduli spaces admit shifted symplectic structures and the associated d-critical structures, which lead to refined versions of DT invariants such as cohomological DT invariants. The idea of cohomological DT invariants led to a mathematical definition of the Gopakumar-Vafa invariant, which was first proposed by Gopakumar-Vafa in 1998, but its precise mathematical definition has not been available until recently. This book surveys the recent progress on DT invariants and related topics, with a focus on applications to curve-counting theories.
Professor Chandrasekhar's work is an attempt by a distinguished practising scientist to read and comprehend the enormous intellectual achievement of the Principia without recourse to secondary sources. This text has stimulated great interest and debate among the scientific community, illuminating the brilliance of Newton's work under the gaze of Chandrasekhar's rare perception.
This graphic novel is both a historical novel as well as an entertaining way of using mathematics to solve a crime. The plot, the possible motive of every suspect, and the elements of his or her character are based on actual historical figures. The 2nd International Congress of Mathematicians is being held in Paris in 1900. The main speaker, the renowned Professor X, is found dead in the hotel dining room. Foul play is suspected. The greatest mathematicians of all time (who are attending the Congress) are called in for questioning. Their statements to the police, however, take the form of mathematical problems. The Chief Inspector enlists the aid of a young mathematician to help solve the crime. Do numbers always tell the truth? Or don't they?
Is mathematics a highly sophisticated intellectual game in which
the adepts display their skill by tackling invented problems, or
are mathematicians engaged in acts of discovery as they explore an
independent realm of mathematical reality? Why does this seemingly
abstract discipline provide the key to unlocking the deep secrets
of the physical universe? How one answers these questions will
significantly influence metaphysical thinking about reality.
This book explores the premise that a physical theory is an interpretation of the analytico-canonical formalism. Throughout the text, the investigation stresses that classical mechanics in its Lagrangian formulation is the formal backbone of theoretical physics. The authors start from a presentation of the analytico-canonical formalism for classical mechanics, and its applications in electromagnetism, Schroedinger's quantum mechanics, and field theories such as general relativity and gauge field theories, up to the Higgs mechanism. The analysis uses the main criterion used by physicists for a theory: to formulate a physical theory we write down a Lagrangian for it. A physical theory is a particular instance of the Lagrangian functional. So, there is already an unified physical theory. One only has to specify the corresponding Lagrangian (or Lagrangian density); the dynamical equations are the associated Euler-Lagrange equations. The theory of Suppes predicates as the main tool in the axiomatization and examples from the usual theories in physics. For applications, a whole plethora of results from logic that lead to interesting, and sometimes unexpected, consequences. This volume looks at where our physics happen and which mathematical universe we require for the description of our concrete physical events. It also explores if we use the constructive universe or if we need set-theoretically generic spacetimes.
Gaisi Takeuti was one of the most brilliant, genius, and influential logicians of the 20th century. He was a long-time professor and professor emeritus of mathematics at the University of Illinois at Urbana-Champaign, USA, before he passed away on May 10, 2017, at the age of 91. Takeuti was one of the founders of Proof Theory, a branch of mathematical logic that originated from Hilbert's program about the consistency of mathematics. Based on Gentzen's pioneering works of proof theory in the 1930s, he proposed a conjecture in 1953 concerning the essential nature of formal proofs of higher-order logic now known as Takeuti's fundamental conjecture and of which he gave a partial positive solution. His arguments on the conjecture and proof theory in general have had great influence on the later developments of mathematical logic, philosophy of mathematics, and applications of mathematical logic to theoretical computer science. Takeuti's work ranged over the whole spectrum of mathematical logic, including set theory, computability theory, Boolean valued analysis, fuzzy logic, bounded arithmetic, and theoretical computer science. He wrote many monographs and textbooks both in English and in Japanese, and his monumental monograph Proof Theory, published in 1975, has long been a standard reference of proof theory. He had a wide range of interests covering virtually all areas of mathematics and extending to physics. His publications include many Japanese books for students and general readers about mathematical logic, mathematics in general, and connections between mathematics and physics, as well as many essays for Japanese science magazines. This volume is a collection of papers based on the Symposium on Advances in Mathematical Logic 2018. The symposium was held September 18-20, 2018, at Kobe University, Japan, and was dedicated to the memory of Professor Gaisi Takeuti.
Accessible to all students with a sound background in high school mathematics, A Concise Introduction to Pure Mathematics, Fourth Edition presents some of the most fundamental and beautiful ideas in pure mathematics. It covers not only standard material but also many interesting topics not usually encountered at this level, such as the theory of solving cubic equations; Euler's formula for the numbers of corners, edges, and faces of a solid object and the five Platonic solids; the use of prime numbers to encode and decode secret information; the theory of how to compare the sizes of two infinite sets; and the rigorous theory of limits and continuous functions. New to the Fourth Edition Two new chapters that serve as an introduction to abstract algebra via the theory of groups, covering abstract reasoning as well as many examples and applications New material on inequalities, counting methods, the inclusion-exclusion principle, and Euler's phi function Numerous new exercises, with solutions to the odd-numbered ones Through careful explanations and examples, this popular textbook illustrates the power and beauty of basic mathematical concepts in number theory, discrete mathematics, analysis, and abstract algebra. Written in a rigorous yet accessible style, it continues to provide a robust bridge between high school and higher-level mathematics, enabling students to study more advanced courses in abstract algebra and analysis. |
You may like...
New Directions in Thin Film…
Sreekanth K. V., Mohamed ElKabbash, …
Hardcover
R2,653
Discovery Miles 26 530
Microwave Active Circuit Analysis and…
Clive Poole, Izzat Darwazeh
Hardcover
Ferroelectric Crystals for Photonic…
Pietro Ferraro, Simonetta Grilli, …
Hardcover
R4,925
Discovery Miles 49 250
Fundamentals of Data Warehouses
Matthias Jarke, Maurizio Lenzerini, …
Hardcover
R1,534
Discovery Miles 15 340
|