Written by one of the subject's foremost experts, this book focuses on the central developments and modern methods of the advanced theory of abelian groups, while remaining accessible, as an introduction and reference, to the non-specialist. It provides a coherent source for results scattered throughout the research literature with lots of new proofs. The presentation highlights major trends that have radically changed the modern character of the subject, in particular, the use of homological methods in the structure theory of various classes of abelian groups, and the use of advanced set-theoretical methods in the study of un decidability problems. The treatment of the latter trend includes Shelah's seminal work on the un decidability in ZFC of Whitehead's Problem; while the treatment of the former trend includes an extensive (but non-exhaustive) study of p-groups, torsion-free groups, mixed groups and important classes of groups arising from ring theory. To prepare the reader to tackle these topics, the book reviews the fundamentals of abelian group theory and provides some background material from category theory, set theory, topology and homological algebra. An abundance of exercises are included to test the reader's comprehension, and to explore noteworthy extensions and related sidelines of the main topics. A list of open problems and questions, in each chapter, invite the reader to take an active part in the subject's further development.

This edited volume focuses on the work of Professor Larisa Maksimova, providing a comprehensive account of her outstanding contributions to different branches of non-classical logic. The book covers themes ranging from rigorous implication, relevance and algebraic logic, to interpolation, definability and recognizability in superintuitionistic and modal logics. It features both her scientific autobiography and original contributions from experts in the field of non-classical logics. Professor Larisa Maksimova's influential work involved combining methods of algebraic and relational semantics. Readers will be able to trace both influences on her work, and the ways in which her work has influenced other logicians. In the historical part of this book, it is possible to trace important milestones in Maksimova's career. Early on, she developed an algebraic semantics for relevance logics and relational semantics for the logic of entailment. Later, Maksimova discovered that among the continuum of superintuitionisitc logics there are exactly three pretabular logics. She went on to obtain results on the decidability of tabularity and local tabularity problems for superintuitionistic logics and for extensions of S4. Further investigations by Maksimova were aimed at the study of fundamental properties of logical systems (different versions of interpolation and definability, disjunction property, etc.) in big classes of logics, and on decidability and recognizability of such properties. To this end she determined a powerful combination of algebraic and semantic methods, which essentially determine the modern state of investigations in the area, as can be seen in the later chapters of this book authored by leading experts in non-classical logics. These original contributions bring the reader up to date on the very latest work in this field.

This English edition of Yuri I. Manin's well-received lecture notes provides a concise but extremely lucid exposition of the basics of algebraic geometry and sheaf theory. The lectures were originally held in Moscow in the late 1960s, and the corresponding preprints were widely circulated among Russian mathematicians. This book will be of interest to students majoring in algebraic geometry and theoretical physics (high energy physics, solid body, astrophysics) as well as to researchers and scholars in these areas. "This is an excellent introduction to the basics of Grothendieck's theory of schemes; the very best first reading about the subject that I am aware of. I would heartily recommend every grad student who wants to study algebraic geometry to read it prior to reading more advanced textbooks."- Alexander Beilinson

The book "Foundational Theories of Classical and Constructive Mathematics" is a book on the classical topic of foundations of mathematics. Its originality resides mainly in its treating at the same time foundations of classical and foundations of constructive mathematics. This confrontation of two kinds of foundations contributes to answering questions such as: Are foundations/foundational theories of classical mathematics of a different nature compared to those of constructive mathematics? Do they play the same role for the resp. mathematics? Are there connections between the two kinds of foundational theories? etc. The confrontation and comparison is often implicit and sometimes explicit. Its great advantage is to extend the traditional discussion of the foundations of mathematics and to render it at the same time more subtle and more differentiated. Another important aspect of the book is that some of its contributions are of a more philosophical, others of a more technical nature. This double face is emphasized, since foundations of mathematics is an eminent topic in the philosophy of mathematics: hence both sides of this discipline ought to be and are being paid due to.

Exploring new variations of classical methods as well as recent approaches appearing in the field, Computational Fluid Dynamics demonstrates the extensive use of numerical techniques and mathematical models in fluid mechanics. It presents various numerical methods, including finite volume, finite difference, finite element, spectral, smoothed particle hydrodynamics (SPH), mixed-element-volume, and free surface flow. Taking a unified point of view, the book first introduces the basis of finite volume, weighted residual, and spectral approaches. The contributors present the SPH method, a novel approach of computational fluid dynamics based on the mesh-free technique, and then improve the method using an arbitrary Lagrange Euler (ALE) formalism. They also explain how to improve the accuracy of the mesh-free integration procedure, with special emphasis on the finite volume particle method (FVPM). After describing numerical algorithms for compressible computational fluid dynamics, the text discusses the prediction of turbulent complex flows in environmental and engineering problems. The last chapter explores the modeling and numerical simulation of free surface flows, including future behaviors of glaciers. The diverse applications discussed in this book illustrate the importance of numerical methods in fluid mechanics. With research continually evolving in the field, there is no doubt that new techniques and tools will emerge to offer greater accuracy and speed in solving and analyzing even more fluid flow problems.

This book covers work written by leading scholars from different schools within the research area of paraconsistency. The authors critically investigate how contemporary paraconsistent logics can be used to better understand human reasoning in science and mathematics. Offering a variety of perspectives, they shed a new light on the question of whether paraconsistent logics can function as the underlying logics of inconsistent but useful scientific and mathematical theories. The great variety of paraconsistent logics gives rise to various, interrelated questions, such as what are the desiderata a paraconsistent logic should satisfy, is there prospect of a universal approach to paraconsistent reasoning with axiomatic theories, and to what extent is reasoning about sets structurally analogous to reasoning about truth. Furthermore, the authors consider paraconsistent logic's status as either a normative or descriptive discipline (or one which falls in between) and which inconsistent but non-trivial axiomatic theories are well understood by which types of paraconsistent approaches. This volume addresses such questions from different perspectives in order to (i) obtain a representative overview of the state of the art in the philosophical debate on paraconsistency, (ii) come up with fresh ideas for the future of paraconsistency, and most importantly (iii) provide paraconsistent logic with a stronger philosophical foundation, taking into account the developments within the different schools of paraconsistency.

Iterative Splitting Methods for Differential Equations explains how to solve evolution equations via novel iterative-based splitting methods that efficiently use computational and memory resources. It focuses on systems of parabolic and hyperbolic equations, including convection-diffusion-reaction equations, heat equations, and wave equations.

In the theoretical part of the book, the author discusses the main theorems and results of the stability and consistency analysis for ordinary differential equations. He then presents extensions of the iterative splitting methods to partial differential equations and spatial- and time-dependent differential equations.

The practical part of the text applies the methods to benchmark and real-life problems, such as waste disposal, elastics wave propagation, and complex flow phenomena. The book also examines the benefits of equation decomposition. It concludes with a discussion on several useful software packages, including r3t and FIDOS.

Covering a wide range of theoretical and practical issues in multiphysics and multiscale problems, this book explores the benefits of using iterative splitting schemes to solve physical problems. It illustrates how iterative operator splitting methods are excellent decomposition methods for obtaining higher-order accuracy.

This text consists of a sequence of problems which develop a variety of aspects in the field of semigroupsof operators. Many of the problems are not found easily in other books. Written in the Socratic/Moore method, this is a problem book without the answers presented. To get the most out of the content requires high motivation from the reader to work out the exercises. The reader is given the opportunity to discover important developments of the subject and to quickly arrive at the point of independent research. The compactness of the volume and the reputation of the author lends this consider set of problems to be a 'classic' in the making. This text is highly recommended for us as supplementary material for 3 graduate level courses.

Most papers published in this volume are based on lectures presented at the Chico Conference on Semigroups held on the Chico campus of the Cal ifornia State University on April 10-12, 1986. The conference was spon sored by the California State University, Chico in cooperation with the Engineering Computer Sciences Department of the Pacific Gas and Electric Company. The program included seven 50-minute addresses and seventeen 30-minute lectures. Speakers were invited by the organizing committee consisting of S. M. Goberstein and P. M. Higgins. The purpose of the conference was to bring together some of the leading researchers in the area of semigroup theory for a discussion of major recent developments in the field. The algebraic theory of semigroups is growing so rapidly and new important results are being produced at such a rate that the need for another meeting was well justified. It was hoped that the conference would help to disseminate new results more rapidly among those working in semi groups and related areas and that the exchange of ideas would stimulate research in the subject even further. These hopes were realized beyond all expectations."

This impressive volume is dedicated to Mel Nathanson, a leading authoritative expert for several decades in the area of combinatorial and additive number theory. For several decades, Mel Nathanson's seminal ideas and results in combinatorial and additive number theory have influenced graduate students and researchers alike. The invited survey articles in this volume reflect the work of distinguished mathematicians in number theory, and represent a wide range of important topics in current research.

Problems in decision making and in other areas such as pattern recogni tion, control, structural engineering etc. involve numerous aspects of uncertainty. Additional vagueness is introduced as models become more complex but not necessarily more meaningful by the added details. During the last two decades one has become more and more aware of the fact that not all this uncertainty is of stochastic (random) cha racter and that, therefore, it can not be modelled appropriately by probability theory. This becomes the more obvious the more we want to represent formally human knowledge. As far as uncertain data are concerned, we have neither instru ments nor reasoning at our disposal as well defined and unquestionable as those used in the probability theory. This almost infallible do main is the result of a tremendous work by the whole scientific world. But when measures are dubious, bad or no longer possible and when we really have to make use of the richness of human reasoning in its variety, then the theories dealing with the treatment of uncertainty, some quite new and other ones older, provide the required complement, and fill in the gap left in the field of knowledge representation. Nowadays, various theories are widely used: fuzzy sets, belief function, the convenient associations between probability and fuzzines~ etc *** We are more and more in need of a wide range of instruments and theories to build models that are more and more adapted to the most complex systems.

The importance of having ef cient and effective methods for data mining and kn- ledge discovery (DM&KD), to which the present book is devoted, grows every day and numerous such methods have been developed in recent decades. There exists a great variety of different settings for the main problem studied by data mining and knowledge discovery, and it seems that a very popular one is formulated in terms of binary attributes. In this setting, states of nature of the application area under consideration are described by Boolean vectors de ned on some attributes. That is, by data points de ned in the Boolean space of the attributes. It is postulated that there exists a partition of this space into two classes, which should be inferred as patterns on the attributes when only several data points are known, the so-called positive and negative training examples. The main problem in DM&KD is de ned as nding rules for recognizing (cl- sifying) new data points of unknown class, i. e. , deciding which of them are positive and which are negative. In other words, to infer the binary value of one more attribute, called the goal or class attribute. To solve this problem, some methods have been suggested which construct a Boolean function separating the two given sets of positive and negative training data points.

The book presents surveys describing recent developments in most of the primary subfields of General Topology, and its applications to Algebra and Analysis during the last decade, following the previous editions (North Holland, 1992 and 2002). The book was prepared in connection with the Prague Topological Symposium, held in 2011. During the last 10 years the focus in General Topology changed and therefore the selection of topics differs from that chosen in 2002. The following areas experienced significant developments: Fractals, Coarse Geometry/Topology, Dimension Theory, Set Theoretic Topology and Dynamical Systems.

This book presents an in-depth and critical reconstruction of Prawitz's epistemic grounding, and discusses it within the broader field of proof-theoretic semantics. The theory of grounds is also provided with a formal framework, through which several relevant results are proved. Investigating Prawitz's theory of grounds, this work answers one of the most fundamental questions in logic: why and how do some inferences have the epistemic power to compel us to accept their conclusion, if we have accepted their premises? Prawitz proposes an innovative description of inferential acts, as applications of constructive operations on grounds for the premises, yielding a ground for the conclusion. The book is divided into three parts. In the first, the author discusses the reasons that have led Prawitz to abandon his previous semantics of valid arguments and proofs. The second part presents Prawitz's grounding as found in his ground-theoretic papers. Finally, in the third part, a formal apparatus is developed, consisting of a class of languages whose terms are equipped with denotation functions associating them to operations and grounds, as well as of a class of systems where important properties of the terms can be proved.

Th e vari a t i on al s p li ne t heo ry w h ic h orig i na t es from th e w ell-kn own p ap er b y J. e . Hollid a y ( 1957) i s t od a y a we ll- deve lo pe d fi eld in a p pr o x - mat i o n t he o ry . T he ge ne ra l d efinition of s p l i nes in t he Hilb er t s pace , - i st ence , uniquen e s s , and ch ar a c t eriz a tion t he o re ms w ere obt ain ed a b o ut 35 ye a r s ago b y M . A t t ei a , P . J . Laur en t , a n d P . M. An selon e , bu t in r e cent y e a r s important n e w r esult s h a v e b e en ob t ain ed in th e a bst ract va r i a t i o n a l s p l i ne theor y .

This monograph provides a theoretical treatment of the problems related to the embeddability of graphs. Among these problems are the planarity and planar embeddings of a graph, the Gaussian crossing problem, the isomorphisms of polyhedra, surface embeddability, problems concerning graphic and cographic matroids and the knot problem from topology to combinatorics are discussed. Rectilinear embeddability, and the net-embeddability of a graph, which appears from the VSLI circuit design and has been much improved by the author recently, is also illustrated. Furthermore, some optimization problems related to planar and rectilinear embeddings of graphs, including those of finding the shortest convex embedding with a boundary condition and the shortest triangulation for given points on the plane, the bend and the area minimizations of rectilinear embeddings, and several kinds of graph decompositions are specially described for conditions efficiently solvable. At the end of each chapter, the Notes Section sets out the progress of related problems, the background in theory and practice, and some historical remarks. Some open problems with suggestions for their solutions are mentioned for further research.

This book presents a collection of contributions from related logics to applied paraconsistency. Moreover, all of them are dedicated to Jair Minoro Abe,on the occasion of his sixtieth birthday. He is one of the experts in Paraconsistent Engineering, who developed the so-called annotated logics. The book includes important contributions on foundations and applications of paraconsistent logics in connection with engineering, mathematical logic, philosophical logic, computer science, physics, economics, and biology. It will be of interest to students and researchers, who are working on engineering and logic.

The authors explain in this work a new approach to observing and controlling linear systems whose inputs and outputs are not fixed in advance. They cover a class of linear time-invariant state/signal system that is general enough to include most of the standard classes of linear time-invariant dynamical systems, but simple enough that it is easy to understand the fundamental principles. They begin by explaining the basic theory of finite-dimensional and bounded systems in a way suitable for graduate courses in systems theory and control. They then proceed to the more advanced infinite-dimensional setting, opening up new ways for researchers to study distributed parameter systems, including linear port-Hamiltonian systems and boundary triplets. They include the general non-passive part of the theory in continuous and discrete time, and provide a short introduction to the passive situation. Numerous examples from circuit theory are used to illustrate the theory.

The main idea of statistical convergence is to demand convergence only for a majority of elements of a sequence. This method of convergence has been investigated in many fundamental areas of mathematics such as: measure theory, approximation theory, fuzzy logic theory, summability theory, and so on. In this monograph we consider this concept in approximating a function by linear operators, especially when the classical limit fails. The results of this book not only cover the classical and statistical approximation theory, but also are applied in the fuzzy logic via the fuzzy-valued operators. The authors in particular treat the important Korovkin approximation theory of positive linear operators in statistical and fuzzy sense. They also present various statistical approximation theorems for some specific real and complex-valued linear operators that are not positive. This is the first monograph in Statistical Approximation Theory and Fuzziness. The chapters are self-contained and several advanced courses can be taught. The research findings will be useful in various applications including applied and computational mathematics, stochastics, engineering, artificial intelligence, vision and machine learning. This monograph is directed to graduate students, researchers, practitioners and professors of all disciplines.

This book creates a conceptual schema that acts as a correlation between Epistemology and Epistemic Logic. It connects both fields and offers a proper theoretical foundation for the contemporary developments of Epistemic Logic regarding the dynamics of information. It builds a bridge between the view of Awareness Justification Internalism, and a dynamic approach to Awareness Logic. The book starts with an introduction to the main topics in Epistemic Logic and Epistemology and reviews the disconnection between the two fields. It analyses three core notions representing the basic structure of the conceptual schema: "Epistemic Awareness", "Knowledge" and "Justification". Next, it presents the Explicit Aware Knowledge (EAK) Schema, using a diagram of three ellipses to illustrate the schema, and a formal model based on a neighbourhood-model structure, that shows one concrete application of the EAK-Schema into a logical structure. The book ends by presenting conclusions and final remarks about the uses and applications of the EAK-Schema. It shows that the most important feature of the schema is that it serves both as a theoretical correlate to the dynamic extensions of Awareness Logic, providing it with a philosophical background, and as an abstract conceptual structure for a re-interpretation of Epistemology.

In this two-volume compilation of articles, leading researchers reevaluate the success of Hilbert's axiomatic method, which not only laid the foundations for our understanding of modern mathematics, but also found applications in physics, computer science and elsewhere. The title takes its name from David Hilbert's seminal talk Axiomatisches Denken, given at a meeting of the Swiss Mathematical Society in Zurich in 1917. This marked the beginning of Hilbert's return to his foundational studies, which ultimately resulted in the establishment of proof theory as a new branch in the emerging field of mathematical logic. Hilbert also used the opportunity to bring Paul Bernays back to Goettingen as his main collaborator in foundational studies in the years to come. The contributions are addressed to mathematical and philosophical logicians, but also to philosophers of science as well as physicists and computer scientists with an interest in foundations.

This book defines a logical system called the Protocol-theoretic Logic of Epistemic Norms (PLEN), it develops PLEN into a formal framework for representing and reasoning about epistemic norms, and it shows that PLEN is theoretically interesting and useful with regard to the aims of such a framework. In order to motivate the project, the author defends an account of epistemic norms called epistemic proceduralism. The core of this view is the idea that, in virtue of their indispensable, regulative role in cognitive life, epistemic norms are closely intertwined with procedural rules that restrict epistemic actions, procedures, and processes. The resulting organizing principle of the book is that epistemic norms are protocols for epistemic planning and control. The core of the book is developing PLEN, which is essentially a novel variant of propositional dynamic logic (PDL) distinguished by more or less elaborate revisions of PDL's syntax and semantics. The syntax encodes the procedural content of epistemic norms by means of the well-known protocol or program constructions of dynamic and epistemic logics. It then provides a novel language of operators on protocols, including a range of unique protocol equivalence relations, syntactic operations on protocols, and various procedural relations among protocols in addition to the standard dynamic (modal) operators of PDL. The semantics of the system then interprets protocol expressions and expressions embedding protocols over a class of directed multigraph-like structures rather than the standard labeled transition systems or modal frames. The intent of the system is to better represent epistemic dynamics, build a logic of protocols atop it, and then show that the resulting logic of protocols is useful as a logical framework for epistemic norms. The resulting theory of epistemic norms centers on notions of norm equivalence derived from theories of process equivalence familiar from the study of dynamic and modal logics. The canonical account of protocol equivalence in PLEN turns out to possess a number of interesting formal features, including satisfaction of important conditions on hyperintensional equivalence, a matter of recently recognized importance in the logic of norms, generally. To show that the system is interesting and useful as a framework for representing and reasoning about epistemic norms, the author applies the logical system to the analysis of epistemic deontic operators, and, partly on the basis of this, establishes representation theorems linking protocols to the action-guiding content of epistemic norms. The protocol-theoretic logic of epistemic norms is then shown to almost immediately validate the main principles of epistemic proceduralism.