Science involves descriptions of the world we live in. It also depends on nature exhibiting what we can best describe as a high aLgorithmic content. The theme running through this collection of papers is that of the interaction between descriptions, in the form of formal theories, and the algorithmic content of what is described, namely of the modeLs of those theories. This appears most explicitly here in a number of valuable, and substantial, contributions to what has until recently been known as 'recursive model theory' - an area in which researchers from the former Soviet Union (in particular Novosibirsk) have been pre-eminent. There are also articles concerned with the computability of aspects of familiar mathematical structures, and - a return to the sort of basic underlying questions considered by Alan Turing in the early days of the subject - an article giving a new perspective on computability in the real world. And, of course, there are also articles concerned with the classical theory of computability, including the first widely available survey of work on quasi-reducibility. The contributors, all internationally recognised experts in their fields, have been associated with the three-year INTAS-RFBR Research Project "Com putability and Models" (Project No. 972-139), and most have participated in one or more of the various international workshops (in Novosibirsk, Heidelberg and Almaty) and otherresearch activities of the network."

Methods of dimensionality reduction provide a way to understand and visualize the structure of complex data sets. Traditional methods like principal component analysis and classical metric multidimensional scaling suffer from being based on linear models. Until recently, very few methods were able to reduce the data dimensionality in a nonlinear way. However, since the late nineties, many new methods have been developed and nonlinear dimensionality reduction, also called manifold learning, has become a hot topic. New advances that account for this rapid growth are, e.g. the use of graphs to represent the manifold topology, and the use of new metrics like the geodesic distance. In addition, new optimization schemes, based on kernel techniques and spectral decomposition, have lead to spectral embedding, which encompasses many of the

'A wealth of examples to which solutions are given permeate the text so the reader will certainly be active.'The Mathematical GazetteThis is the final book written by the late great puzzle master and logician, Dr. Raymond Smullyan.This book is a sequel to my Beginner's Guide to Mathematical Logic.The previous volume deals with elements of propositional and first-order logic, contains a bit on formal systems and recursion, and concludes with chapters on Goedel's famous incompleteness theorem, along with related results.The present volume begins with a bit more on propositional and first-order logic, followed by what I would call a 'fein' chapter, which simultaneously generalizes some results from recursion theory, first-order arithmetic systems, and what I dub a 'decision machine.' Then come five chapters on formal systems, recursion theory and metamathematical applications in a general setting. The concluding five chapters are on the beautiful subject of combinatory logic, which is not only intriguing in its own right, but has important applications to computer science. Argonne National Laboratory is especially involved in these applications, and I am proud to say that its members have found use for some of my results in combinatory logic.This book does not cover such important subjects as set theory, model theory, proof theory, and modern developments in recursion theory, but the reader, after studying this volume, will be amply prepared for the study of these more advanced topics.

'A wealth of examples to which solutions are given permeate the text so the reader will certainly be active.'The Mathematical GazetteThis is the final book written by the late great puzzle master and logician, Dr. Raymond Smullyan.This book is a sequel to my Beginner's Guide to Mathematical Logic.The previous volume deals with elements of propositional and first-order logic, contains a bit on formal systems and recursion, and concludes with chapters on Goedel's famous incompleteness theorem, along with related results.The present volume begins with a bit more on propositional and first-order logic, followed by what I would call a 'fein' chapter, which simultaneously generalizes some results from recursion theory, first-order arithmetic systems, and what I dub a 'decision machine.' Then come five chapters on formal systems, recursion theory and metamathematical applications in a general setting. The concluding five chapters are on the beautiful subject of combinatory logic, which is not only intriguing in its own right, but has important applications to computer science. Argonne National Laboratory is especially involved in these applications, and I am proud to say that its members have found use for some of my results in combinatory logic.This book does not cover such important subjects as set theory, model theory, proof theory, and modern developments in recursion theory, but the reader, after studying this volume, will be amply prepared for the study of these more advanced topics.

There are many proposed aims for scientific inquiry - to explain or predict events, to confirm or falsify hypotheses, or to find hypotheses that cohere with our other beliefs in some logical or probabilistic sense. This book is devoted to a different proposal - that the logical structure of the scientist's method should guarantee eventual arrival at the truth, given the scientist's background assumptions. Interest in this methodological property, called "logical reliability", stems from formal learning theory, which draws its insights not from the theory of probability, but from the theory of computability. Kelly first offers an accessible explanation of formal learning theory, then goes on to develop and explore a systematic framework in which various standard learning-theoretic results can be seen as special cases of simpler and more general considerations. Finally, Kelly clarifies the relationship between the resulting framework and other standard issues in the philosophy of science, such as probability, causation, and relativism. Extensively illustrated with figures by the author, The Logic of Reliable Inquiry assumes only introductory knowledge of basic logic and computability theory. It is a major contribution to the literature and will be essential reading for scientists, statiticians, psychologists, linguists, logicians, and philosophers.

The book is designed for students studying on their own, without access to lecturers and other reading, along the lines of the internationally renowned course produced by the Open University. There are thus a large number of exercises within the main body of the text designed to help students engage with the subject, many of which have full teaching solutions. In addition, there are a number of exercises without answers so that students studying under the guidance of a tutor may be assessed.

This book casts the theory of periods of algebraic varieties in the natural setting of Madhav Nori's abelian category of mixed motives. It develops Nori's approach to mixed motives from scratch, thereby filling an important gap in the literature, and then explains the connection of mixed motives to periods, including a detailed account of the theory of period numbers in the sense of Kontsevich-Zagier and their structural properties. Period numbers are central to number theory and algebraic geometry, and also play an important role in other fields such as mathematical physics. There are long-standing conjectures about their transcendence properties, best understood in the language of cohomology of algebraic varieties or, more generally, motives. Readers of this book will discover that Nori's unconditional construction of an abelian category of motives (over fields embeddable into the complex numbers) is particularly well suited for this purpose. Notably, Kontsevich's formal period algebra represents a torsor under the motivic Galois group in Nori's sense, and the period conjecture of Kontsevich and Zagier can be recast in this setting. Periods and Nori Motives is highly informative and will appeal to graduate students interested in algebraic geometry and number theory as well as researchers working in related fields. Containing relevant background material on topics such as singular cohomology, algebraic de Rham cohomology, diagram categories and rigid tensor categories, as well as many interesting examples, the overall presentation of this book is self-contained.

Dirk van Dalen's biography studies the fascinating life of the famous Dutch mathematician and philosopher Luitzen Egbertus Jan Brouwer. Brouwer belonged to a special class of genius; complex and often controversial and gifted with a deep intuition, he had an unparalleled access to the secrets and intricacies of mathematics. Most mathematicians remember L.E.J. Brouwer from his scientific breakthroughs in the young subject of topology and for the famous Brouwer fixed point theorem. Brouwer's main interest, however, was in the foundation of mathematics which led him to introduce, and then consolidate, constructive methods under the name 'intuitionism'. This made him one of the main protagonists in the 'foundation crisis' of mathematics. As a confirmed internationalist, he also got entangled in the interbellum struggle for the ending of the boycott of German and Austrian scientists. This time during the twentieth century was turbulent; nationalist resentment and friction between formalism and intuitionism led to the Mathematische Annalen conflict ('The war of the frogs and the mice'). It was here that Brouwer played a pivotal role. The present biography is an updated revision of the earlier two volume biography in one single book. It appeals to mathematicians and anybody interested in the history of mathematics in the first half of the twentieth century.

Handbook of Mathematical Induction: Theory and Applications shows how to find and write proofs via mathematical induction. This comprehensive book covers the theory, the structure of the written proof, all standard exercises, and hundreds of application examples from nearly every area of mathematics. In the first part of the book, the author discusses different inductive techniques, including well-ordered sets, basic mathematical induction, strong induction, double induction, infinite descent, downward induction, and several variants. He then introduces ordinals and cardinals, transfinite induction, the axiom of choice, Zorn's lemma, empirical induction, and fallacies and induction. He also explains how to write inductive proofs. The next part contains more than 750 exercises that highlight the levels of difficulty of an inductive proof, the variety of inductive techniques available, and the scope of results provable by mathematical induction. Each self-contained chapter in this section includes the necessary definitions, theory, and notation and covers a range of theorems and problems, from fundamental to very specialized. The final part presents either solutions or hints to the exercises. Slightly longer than what is found in most texts, these solutions provide complete details for every step of the problem-solving process.

Applicable to any problem that requires a finite number of solutions, finite state-based models (also called finite state machines or finite state automata) have found wide use in various areas of computer science and engineering. Handbook of Finite State Based Models and Applications provides a complete collection of introductory materials on finite state theories, algorithms, and the latest domain applications. For beginners, the book is a handy reference for quickly looking up model details. For more experienced researchers, it is suitable as a source of in-depth study in this area. The book first introduces the fundamentals of automata theory, including regular expressions, as well as widely used automata, such as transducers, tree automata, quantum automata, and timed automata. It then presents algorithms for the minimization and incremental construction of finite automata and describes Esterel, an automata-based synchronous programming language for embedded system software development. Moving on to applications, the book explores regular path queries on graph-structured data, timed automata in model checking security protocols, pattern matching, compiler design, and XML processing. It also covers other finite state-based modeling approaches and applications, including Petri nets, statecharts, temporal logic, and UML state machine diagrams.

This is a systematic and well-paced introduction to mathematical logic. Excellent as a course text, the book presupposes only elementary background and can be used also for self-study by more ambitious students.Starting with the basics of set theory, induction and computability, it covers propositional and first order logic - their syntax, reasoning systems and semantics. Soundness and completeness results for Hilbert's and Gentzen's systems are presented, along with simple decidability arguments. The general applicability of various concepts and techniques is demonstrated by highlighting their consistent reuse in different contexts.Unlike in most comparable texts, presentation of syntactic reasoning systems precedes the semantic explanations. The simplicity of syntactic constructions and rules - of a high, though often neglected, pedagogical value - aids students in approaching more complex semantic issues. This order of presentation also brings forth the relative independence of syntax from the semantics, helping to appreciate the importance of the purely symbolic systems, like those underlying computers.An overview of the history of logic precedes the main text, while informal analogies precede introduction of most central concepts. These informal aspects are kept clearly apart from the technical ones. Together, they form a unique text which may be appreciated equally by lecturers and students occupied with mathematical precision, as well as those interested in the relations of logical formalisms to the problems of computability and the philosophy of logic.This revised edition contains also, besides many new exercises, a new chapter on semantic paradoxes. An equivalence of logical and graphical representations allows us to see vicious circularity as the odd cycles in the graphical representation and can be used as a simple tool for diagnosing paradoxes in natural discourse.

This is a systematic and well-paced introduction to mathematical logic. Excellent as a course text, the book presupposes only elementary background and can be used also for self-study by more ambitious students.Starting with the basics of set theory, induction and computability, it covers propositional and first order logic - their syntax, reasoning systems and semantics. Soundness and completeness results for Hilbert's and Gentzen's systems are presented, along with simple decidability arguments. The general applicability of various concepts and techniques is demonstrated by highlighting their consistent reuse in different contexts.Unlike in most comparable texts, presentation of syntactic reasoning systems precedes the semantic explanations. The simplicity of syntactic constructions and rules - of a high, though often neglected, pedagogical value - aids students in approaching more complex semantic issues. This order of presentation also brings forth the relative independence of syntax from the semantics, helping to appreciate the importance of the purely symbolic systems, like those underlying computers.An overview of the history of logic precedes the main text, while informal analogies precede introduction of most central concepts. These informal aspects are kept clearly apart from the technical ones. Together, they form a unique text which may be appreciated equally by lecturers and students occupied with mathematical precision, as well as those interested in the relations of logical formalisms to the problems of computability and the philosophy of logic.This revised edition contains also, besides many new exercises, a new chapter on semantic paradoxes. An equivalence of logical and graphical representations allows us to see vicious circularity as the odd cycles in the graphical representation and can be used as a simple tool for diagnosing paradoxes in natural discourse.

The book is devoted to the theory of groups of finite Morley rank. These groups arise in model theory and generalize the concept of algebraic groups over algebraically closed fields. The book contains almost all the known results in the subject. Trying to attract pure group theorists in the subject and to prepare the graduate student to start the research in the area, the authors adopted an algebraic and self evident point of view rather than a model theoretic one, and developed the theory from scratch. All the necessary model theoretical and group theoretical notions are explained in length. The book is full of exercises and examples and one of its chapters contains a discussion of open problems and a program for further research.

Compactly supported smooth piecewise polynomial functions provide an efficient tool for the approximation of curves and surfaces and other smooth functions of one and several arguments. Since they are locally polynomial, they are easy to evaluate. Since they are smooth, they can be used when smoothness is required, as in the numerical solution of partial differential equations (in the Finite Element method) or the modeling of smooth sur faces (in Computer Aided Geometric Design). Since they are compactly supported, their linear span has the needed flexibility to approximate at all, and the systems to be solved in the construction of approximations are 'banded'. The construction of compactly supported smooth piecewise polynomials becomes ever more difficult as the dimension, s, of their domain G ~ IRs, i. e. , the number of arguments, increases. In the univariate case, there is only one kind of cell in any useful partition, namely, an interval, and its boundary consists of two separated points, across which polynomial pieces would have to be matched as one constructs a smooth piecewise polynomial function. This can be done easily, with the only limitation that the num ber of smoothness conditions across such a breakpoint should not exceed the polynomial degree (since that would force the two joining polynomial pieces to coincide). In particular, on any partition, there are (nontrivial) compactly supported piecewise polynomials of degree ~ k and in C(k-l), of which the univariate B-spline is the most useful example.

The Mathematics That Power Our World: How Is It Made? is an attempt to unveil the hidden mathematics behind the functioning of many of the devices we use on a daily basis. For the past years, discussions on the best approach in teaching and learning mathematics have shown how much the world is divided on this issue. The one reality we seem to agree on globally is the fact that our new generation is lacking interest and passion for the subject. One has the impression that the vast majority of young students finishing high school or in their early post-secondary studies are more and more divided into two main groups when it comes to the perception of mathematics. The first group looks at mathematics as a pure academic subject with little connection to the real world. The second group considers mathematics as a set of tools that a computer can be programmed to use and thus, a basic knowledge of the subject is sufficient. This book serves as a middle ground between these two views. Many of the elegant and seemingly theoretical concepts of mathematics are linked to state-of-the-art technologies. The topics of the book are selected carefully to make that link more relevant. They include: digital calculators, basics of data compression and the Huffman coding, the JPEG standard for data compression, the GPS system studied both from the receiver and the satellite ends, image processing and face recognition.This book is a great resource for mathematics educators in high schools, colleges and universities who want to engage their students in advanced readings that go beyond the classroom discussions. It is also a solid foundation for anyone thinking of pursuing a career in science or engineering. All efforts were made so that the exposition of each topic is as clear and self-contained as possible and thus, appealing to anyone trying to broaden his mathematical horizons.

The Mathematics That Power Our World: How Is It Made? is an attempt to unveil the hidden mathematics behind the functioning of many of the devices we use on a daily basis. For the past years, discussions on the best approach in teaching and learning mathematics have shown how much the world is divided on this issue. The one reality we seem to agree on globally is the fact that our new generation is lacking interest and passion for the subject. One has the impression that the vast majority of young students finishing high school or in their early post-secondary studies are more and more divided into two main groups when it comes to the perception of mathematics. The first group looks at mathematics as a pure academic subject with little connection to the real world. The second group considers mathematics as a set of tools that a computer can be programmed to use and thus, a basic knowledge of the subject is sufficient. This book serves as a middle ground between these two views. Many of the elegant and seemingly theoretical concepts of mathematics are linked to state-of-the-art technologies. The topics of the book are selected carefully to make that link more relevant. They include: digital calculators, basics of data compression and the Huffman coding, the JPEG standard for data compression, the GPS system studied both from the receiver and the satellite ends, image processing and face recognition.This book is a great resource for mathematics educators in high schools, colleges and universities who want to engage their students in advanced readings that go beyond the classroom discussions. It is also a solid foundation for anyone thinking of pursuing a career in science or engineering. All efforts were made so that the exposition of each topic is as clear and self-contained as possible and thus, appealing to anyone trying to broaden his mathematical horizons.

This book leads readers from a basic foundation to an advanced level understanding of algebra, logic and combinatorics. Perfect for graduate or PhD mathematical-science students looking for help in understanding the fundamentals of the topic, it also explores more specific areas such as invariant theory of finite groups, model theory, and enumerative combinatorics.Algebra, Logic and Combinatorics is the third volume of the LTCC Advanced Mathematics Series. This series is the first to provide advanced introductions to mathematical science topics to advanced students of mathematics. Edited by the three joint heads of the London Taught Course Centre for PhD Students in the Mathematical Sciences (LTCC), each book supports readers in broadening their mathematical knowledge outside of their immediate research disciplines while also covering specialized key areas.

This book leads readers from a basic foundation to an advanced level understanding of algebra, logic and combinatorics. Perfect for graduate or PhD mathematical-science students looking for help in understanding the fundamentals of the topic, it also explores more specific areas such as invariant theory of finite groups, model theory, and enumerative combinatorics.Algebra, Logic and Combinatorics is the third volume of the LTCC Advanced Mathematics Series. This series is the first to provide advanced introductions to mathematical science topics to advanced students of mathematics. Edited by the three joint heads of the London Taught Course Centre for PhD Students in the Mathematical Sciences (LTCC), each book supports readers in broadening their mathematical knowledge outside of their immediate research disciplines while also covering specialized key areas.

This volume focuses on the important mathematical idea of functions that, with the technology of computers and calculators, can be dynamically represented in ways that have not been possible previously. The book's editors contend that as result of recent technological developments combined with the integrated knowledge available from research on teaching, instruction, students' thinking, and assessment, curriculum developers, researchers, and teacher educators are faced with an unprecedented opportunity for making dramatic changes. The book presents content considerations that occur when the mathematics of graphs and functions relate to curriculum. It also examines content in a carefully considered integration of research that conveys where the field stands and where it might go. Drawing heavily on their own work, the chapter authors reconceptualize research in their specific areas so that this knowledge is integrated with the others' strands. This model for synthesizing research can serve as a paradigm for how research in mathematics education can -- and probably should -- proceed.

This careful selection of participant contributions reflects the focus of the 14th International Conference on Operator Theory, held in Timisoara (Romania) in June 1992, centering on the problems of extensions of operators and their connections with interpolation of analytic functions and with the spectral theory of differential operators. Other topics concern operator inequalities, spectral theory in general spaces and operator theory in Krein spaces.

This book explores an important central thread that unifies Russell's thoughts on logic in two works previously considered at odds with each other, the Principles of Mathematics and the later Principia Mathematica. This thread is Russell's doctrine that logic is an absolutely general science and that any calculus for it must embrace wholly unrestricted variables. The heart of Landini's book is a careful analysis of Russell's largely unpublished "substitutional" theory. On Landini's showing, the substitutional theory reveals the unity of Russell's philosophy of logic and offers new avenues for a genuine solution of the paradoxes plaguing Logicism.

A comprehensive philosophical introduction to set theory. Anyone wishing to work on the logical foundations of mathematics must understand set theory, which lies at its heart. Potter offers a thorough account of cardinal and ordinal arithmetic, and the various axiom candidates. He discusses in detail the project of set-theoretic reduction, which aims to interpret the rest of mathematics in terms of set theory. The key question here is how to deal with the paradoxes that bedevil set theory. Potter offers a strikingly simple version of the most widely accepted response to the paradoxes, which classifies sets by means of a hierarchy of levels. What makes the book unique is that it interweaves a careful presentation of the technical material with a penetrating philosophical critique. Potter does not merely expound the theory dogmatically but at every stage discusses in detail the reasons that can be offered for believing it to be true.

Computational Thinking (CT) involves fundamental concepts and reasoning, distilled from computer science and other computational sciences, which become powerful general mental tools for solving problems, increasing efficiency, reducing complexity, designing procedures, or interacting with humans and machines. An easy-to-understand guidebook, From Computing to Computational Thinking gives you the tools for understanding and using CT. It does not assume experience or knowledge of programming or of a programming language, but explains concepts and methods for CT with clarity and depth. Successful applications in diverse disciplines have shown the power of CT in problem solving. The book uses puzzles, games, and everyday examples as starting points for discussion and for connecting abstract thinking patterns to real-life situations. It provides an interesting and thought-provoking way to gain general knowledge about modern computing and the concepts and thinking processes underlying modern digital technologies.

This volume presents the lecture notes of short courses given by three leading experts in mathematical logic at the 2010 and 2011 Asian Initiative for Infinity Logic Summer Schools. The major topics covered set theory and recursion theory, with particular emphasis on forcing, inner model theory and Turing degrees, offering a wide overview of ideas and techniques introduced in contemporary research in the field of mathematical logic.

Mild Cognitive Impairment (MCI) has been identified as an important clinical transition between normal aging and the early stages of Alzheimer's disease (AD). Since treatments for AD are most likely to be most effective early in the course of the disease, MCI has become a topic of great importance and has been investigated in different populations of interest in many countries. This book brings together these differing perspectives on MCI for the first time. This volume provides a comprehensive resource for clinicians, researchers, and students involved in the study, diagnosis, treatment, and rehabilitation of people with MCI. Clinical investigators initially defined mild cognitive impairment (MCI) as a transitional condition between normal aging and the early stages of Alzheimer's disease (AD). Because the prevalence of AD increases with age and very large numbers of older adults are affected worldwide, these clinicians saw a pressing need to identify AD as early as possible. It is at this very early stage in the disease course that treatments to slow the progress and control symptoms are likely to be most effective. Since the first introduction of MCI, research interest has grown exponentially, and the utility of the concept has been investigated from a variety of perspectives in different populations of interest (e.g., clinical samples, volunteers, population-based screening) in many different countries. Much variability in findings has resulted. Although it has been acknowledged that the differences observed between samples may be 'legitimate variations', there has been no attempt to understand what it is we have learned about MCI (i.e., common features and differences) from each of these perspectives. This book brings together information about MCI in different populations from around the world. Mild Cognitive Impairment will be an important resource for any clinician, researcher, or student involved in the study, detection, treatment, and rehabilitation of people with MCI.