Listing 1 - 10 of 140 | << page >> |
Sort by
|
Choose an application
Die ideale Vorbereitung für die Mathematikvorlesungen im Grundstudium. Dieser Brückenkurs hilft den Studierenden, vor oder zu Beginn des Studiums die unentbehrlichen mathematischen Grundkenntnisse aufzufrischen oder nachzulernen. Die einzelnen Abschnitte sind nicht aufeinander aufgebaut, sodass sich der Studierende auf die Gebiete konzentrieren kann, in denen er Schwierigkeiten oder Lücken hat. Am Ende eines jeden Kapitels befinden sich Aufgaben, deren Lösungen sich, zur Kontrolle, im Anhang befinden. Das Buch richtet sich an alle Studierenden, die in ihrem Studium mit Mathematik zu tun haben.
Choose an application
Choose an application
Dieses Werk gibt eine überwiegend elementare Einführung in philosophische Probleme und Hintergründe des mathematischen Denkens und Sprechens, Lehrens und Lernens. Sie wendet sich an Lehrende und Studierende der Mathematik und der Philosophie. Ausgangspunkt und immer wieder Bezugspunkt sind die reellen Zahlen. In pointierter Weise werden mathematische und philosophische Probleme und Fragen vermerkt, die sich auf dem Weg zu ihnen stellen. Ein umfangreicher Abriss von Auffassungen aus der Geschichte der Mathematik und der Philosophie bis hin zu aktuellen Strömungen bildet den Hintergrund für ihre eingehende Diskussion. Kapitel über Mengenlehre, Logik und Axiomatik, über ungelöste und unlösbare Probleme und fundamentale Ergebnisse schließen den Text ab.
Mathematics --- Mathematics. --- Philosophy. --- Axiomatics. --- Logic. --- Set Theory.
Choose an application
The starting point for this monograph is the previously unknown connection between the Continuum Hypothesis and the saturation of the non-stationary ideal on ω1; and the principle result of this monograph is the identification of a canonical model in which the Continuum Hypothesis is false. This is the first example of such a model and moreover the model can be characterized in terms of maximality principles concerning the universal-existential theory of all sets of countable ordinals. This model is arguably the long sought goal of the study of forcing axioms and iterated forcing but is obtained by completely different methods, for example no theory of iterated forcing whatsoever is required. The construction of the model reveals a powerful technique for obtaining independence results regarding the combinatorics of the continuum, yielding a number of results which have yet to be obtained by any other method. This monograph is directed to researchers and advanced graduate students in Set Theory. The second edition is updated to take into account some of the developments in the decade since the first edition appeared, this includes a revised discussion of Ω-logic and related matters.
Forcing (Model theory) --- Model theory. --- Continuum Hypothesis. --- Mathematical Logic. --- Set Theory.
Choose an application
Homology theory is a powerful algebraic tool that is at the centre of current research in topology and its applications. This accessible textbook will appeal to mathematics students interested in the application of algebra to geometrical problems, specifically the study of surfaces (sphere, torus, Mobius band, Klein bottle). In this introduction to simplicial homology - the most easily digested version of homology theory - the author studies interesting geometrical problems, such as the structure of two-dimensional surfaces and the embedding of graphs in surfaces, using the minimum of algebraic machinery and including a version of Lefschetz duality. Assuming very little mathematical knowledge, the book provides a complete account of the algebra needed (abelian groups and presentations), and the development of the material is always carefully explained with proofs given in full detail. Numerous examples and exercises are also included, making this an ideal text for undergraduate courses or for self-study.
Algebraic topology. --- Topology. --- Analysis situs --- Position analysis --- Rubber-sheet geometry --- Geometry --- Polyhedra --- Set theory --- Algebras, Linear --- Topology
Choose an application
Logic, Symbolic and mathematical. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism
Choose an application
This informal introduction provides a fresh perspective on isomorphism theory, which is the branch of ergodic theory that explores the conditions under which two measure preserving systems are essentially equivalent. It contains a primer in basic measure theory, proofs of fundamental ergodic theorems, and material on entropy, martingales, Bernoulli processes, and various varieties of mixing. Original proofs of classic theorems - including the Shannon-McMillan-Breiman theorem, the Krieger finite generator theorem, and the Ornstein isomorphism theorem - are presented by degrees, together with helpful hints that encourage the reader to develop the proofs on their own. Hundreds of exercises and open problems are also included, making this an ideal text for graduate courses. Professionals needing a quick review, or seeking a different perspective on the subject, will also value this book.
Ergodic theory. --- Isomorphisms (Mathematics) --- Categories (Mathematics) --- Group theory --- Morphisms (Mathematics) --- Set theory --- Ergodic transformations --- Continuous groups --- Mathematical physics --- Measure theory --- Transformations (Mathematics)
Choose an application
This collection of papers presents a series of in-depth examinations of a variety of advanced topics related to Boolean functions and expressions. The chapters are written by some of the most prominent experts in their respective fields and cover topics ranging from algebra and propositional logic to learning theory, cryptography, computational complexity, electrical engineering, and reliability theory. Beyond the diversity of the questions raised and investigated in different chapters, a remarkable feature of the collection is the common thread created by the fundamental language, concepts, models, and tools provided by Boolean theory. Many readers will be surprised to discover the countless links between seemingly remote topics discussed in various chapters of the book. This text will help them draw on such connections to further their understanding of their own scientific discipline and to explore new avenues for research.
Algebra --- Computer science --- Algebra, Boolean --- Probabilities --- Algebra, Boolean. --- Probabilities. --- Probability --- Statistical inference --- Combinations --- Mathematics --- Chance --- Least squares --- Mathematical statistics --- Risk --- Boolean algebra --- Boole's algebra --- Algebraic logic --- Set theory
Choose an application
This new edition of Introduction to Lattices and Order presents a radical reorganization and updating, though its primary aim is unchanged. The explosive development of theoretical computer science in recent years has, in particular, influenced the book's evolution: a fresh treatment of fixpoints testifies to this and Galois connections now feature prominently. An early presentation of concept analysis gives both a concrete foundation for the subsequent theory of complete lattices and a glimpse of a methodology for data analysis that is of commercial value in social science. Classroom experience has led to numerous pedagogical improvements and many new exercises have been added. As before, exposure to elementary abstract algebra and the notation of set theory are the only prerequisites, making the book suitable for advanced undergraduates and beginning graduate students. It will also be a valuable resource for anyone who meets ordered structures.
Ordered algebraic structures --- 681.3*G20 --- Computerwetenschap--?*G20 --- Lattice theory --- Lattice theory. --- Lattices (Mathematics) --- Space lattice (Mathematics) --- Structural analysis (Mathematics) --- Algebra, Abstract --- Algebra, Boolean --- Group theory --- Set theory --- Topology --- Transformations (Mathematics) --- Crystallography, Mathematical --- Computer science--?*G20
Choose an application
The problem of inducing, learning or inferring grammars has been studied for decades, but only in recent years has grammatical inference emerged as an independent field with connections to many scientific disciplines, including bio-informatics, computational linguistics and pattern recognition. This book meets the need for a comprehensive and unified summary of the basic techniques and results, suitable for researchers working in these various areas. In Part I, the objects of use for grammatical inference are studied in detail: strings and their topology, automata and grammars, whether probabilistic or not. Part II carefully explores the main questions in the field: What does learning mean? How can we associate complexity theory with learning? In Part III the author describes a number of techniques and algorithms that allow us to learn from text, from an informant, or through interaction with the environment. These concern automata, grammars, rewriting systems, pattern languages or transducers.
Mathematical logic --- Computer science --- Grammar --- Mathematical linguistics --- Formal languages. --- Logic, Symbolic and mathematical. --- Algebra of logic --- Logic, Universal --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Formalization (Linguistics) --- Language and languages --- Machine theory
Listing 1 - 10 of 140 | << page >> |
Sort by
|