This book is the first systematic treatment of this area so far scattered in a vast number of articles. As in classical topology, concrete problems require restricting the (generalized point-free) spaces by various conditions playing the roles of classical separation axioms. These are typically formulated in the language of points; but in the point-free context one has either suitable translations, parallels, or satisfactory replacements. The interrelations of separation type conditions, their merits, advantages and disadvantages, and consequences are discussed. Highlights of the book include a treatment of the merits and consequences of subfitness, various approaches to the Hausdorff's axiom, and normality type axioms. Global treatment of the separation conditions put them in a new perspective, and, a.o., gave some of them unexpected importance. The text contains a lot of quite recent results; the reader will see the directions the area is taking, and may find inspiration for her/his further work. The book will be of use for researchers already active in the area, but also for those interested in this growing field (sometimes even penetrating into some parts of theoretical computer science), for graduate and PhD students, and others. For the reader's convenience, the text is supplemented with an Appendix containing necessary background on posets, frames and locales.

Until the mid-twentieth century, topological studies were focused on the theory of suitable structures on sets of points. The concept of open set exploited since the twenties offered an expression of the geometric intuition of a "realistic" place (spot, grain) of non-trivial extent. Imitating the behaviour of open sets and their relations led to a new approach to topology flourishing since the end of the fifties.It has proved to be beneficial in many respects. Neglecting points, only little information was lost, while deeper insights have been gained; moreover, many results previously dependent on choice principles became constructive. The result is often a smoother, rather than a more entangled, theory. No monograph of this nature has appeared since Johnstone's celebrated Stone Spaces in 1983. The present book is intended as a bridge from that time to the present. Most of the material appears here in book form for the first time or is presented from new points of view. Two appendices provide an introduction to some requisite concepts from order and category theories.

The essentials of point-set topology, complete with motivation and numerous examples Topology: Point-Set and Geometric presents an introduction to topology that begins with the axiomatic definition of a topology on a set, rather than starting with metric spaces or the topology of subsets of Rn. This approach includes many more examples, allowing students to develop more sophisticated intuition and enabling them to learn how to write precise proofs in a brand-new context, which is an invaluable experience for math majors. Along with the standard point-set topology topics—connected and path-connected spaces, compact spaces, separation axioms, and metric spaces—Topology covers the construction of spaces from other spaces, including products and quotient spaces. This innovative text culminates with topics from geometric and algebraic topology (the Classification Theorem for Surfaces and the fundamental group), which provide instructors with the opportunity to choose which "capstone" best suits his or her students. Topology: Point-Set and Geometric features: A short introduction in each chapter designed to motivate the ideas and place them into an appropriate context Sections with exercise sets ranging in difficulty from easy to fairly challenging Exercises that are very creative in their approaches and work well in a classroom setting A supplemental Web site that contains complete and colorful illustrations of certain objects, several learning modules illustrating complicated topics, and animations of particularly complex proofs

This volume is devoted to the main areas of mathematical logic and applications to computer science. There are articles on weakly o-minimal theories, algorithmic complexity of relations, models within the computable model theory, hierarchies of randomness tests, computable numberings, and complexity problems of minimal unsatisfiable formulas. The problems of characterization of the deduction-detachment theorem, Δ1-induction, completeness of Leśniewski's systems, and reduction calculus for the satisfiability problem are also discussed.The coverage includes the answer to Kanovei's question about the upper bound for the complexity of equivalence relations by convergence at infinity for continuous functions. The volume also gives some applications to computer science such as solving the problems of inductive interference of languages from the full collection of positive examples and some negative data, the effects of random negative data, methods of formal specification and verification on the basis of model theory and multiple-valued logics, interval fuzzy algebraic systems, the problems of information exchange among agents on the base topological structures, and the predictions provided by inductive theories.

This volume is devoted to the main areas of mathematical logic and applications to computer science. There are articles on weakly o-minimal theories, algorithmic complexity of relations, models within the computable model theory, hierarchies of randomness tests, computable numberings, and complexity problems of minimal unsatisfiable formulas. The problems of characterization of the deduction-detachment theorem, o 1 -induction, completeness of Leoniewski''s systems, and reduction calculus for the satisfiability problem are also discussed. The coverage includes the answer to Kanovei''s question about the upper bound for the complexity of equivalence relations by convergence at infinity for continuous functions. The volume also gives some applications to computer science such as solving the problems of inductive interference of languages from the full collection of positive examples and some negative data, the effects of random negative data, methods of formal specification and verification on the basis of model theory and multiple-valued logics, interval fuzzy algebraic systems, the problems of information exchange among agents on the base topological structures, and the predictions provided by inductive theories. Sample Chapter(s). Chapter 1: Another Characterization of the Deduction-Detachment Theorem (535 KB). Contents: Another Characterization of the Deduction-Detachment Theorem (S V Babyonyshev); On Behavior of 2-Formulas in Weakly o-Minimal Theories (B S Baizhanov & B Sh Kulpeshov); Arithmetic Turing Degrees and Categorical Theories of Computable Models (E Fokina); Negative Data in Learning Languages (S Jain & E Kinber); Effective Cardinals in the Nonstandard Universe (V Kanovei & M Reeken); Model-Theoretic Methods of Analysis of Computer Arithmetic (S P Kovalyov); The Functional Completeness of Leoniewski''s Systems (F Lepage); Hierarchies of Randomness Tests (J Reimann & F Stephan); Intransitive Linear Temporal Logic Based on Integer Numbers, Decidability, Admissible Logical Consecutions (V V Rybakov); The Logic of Prediction (E Vityaev); Conceptual Semantic Systems Theory and Applications (K E Wolff); Complexity Results on Minimal Unsatisfiable Formulas (X Zhao); and other papers. Readership: Researchers in mathematical logic and algebra, computer scientists in artificial intelligence and fuzzy logic."

This anthology reviews the programmes in the foundations of mathematics from the classical period and assesses their possible relevance for contemporary philosophy of mathematics. A special section is concerned with constructive mathematics.

Mathematical and philosophical thought about continuity has changed considerably over the ages, from Aristotle's insistence that a continuum is a unified whole, to the dominant account today, that a continuum is composed of infinitely many points. This book explores the key ideas and debates concerning continuity over more than 2500 years.

This edited collection bridges the foundations and practice of constructive mathematics and focusses on the contrast between the theoretical developments, which have been most useful for computer science (eg constructive set and type theories), and more specific efforts on constructive analysis, algebra and topology. Aimed at academic logicians, mathematicians, philosophers and computer scientists Including, with contributions from leading researchers, it is up-to-date, highly topical and broad in scope. This is the latest volume in the Oxford Logic Guides, which also includes: 41. J.M. Dunn and G. Hardegree: Algebraic Methods in Philosophical Logic 42. H. Rott: Change, Choice and Inference: A study of belief revision and nonmonotoic reasoning 43. Johnstone: Sketches of an Elephant: A topos theory compendium, volume 1 44. Johnstone: Sketches of an Elephant: A topos theory compendium, volume 2 45. David J. Pym and Eike Ritter: Reductive Logic and Proof Search: Proof theory, semantics and control 46. D.M. Gabbay and L. Maksimova: Interpolation and Definability: Modal and Intuitionistic Logics 47. John L. Bell: Set Theory: Boolean-valued models and independence proofs, third edition

Topology Through Inquiry is a comprehensive introduction to point-set, algebraic, and geometric topology, designed to support inquiry-based learning (IBL) courses for upper-division undergraduate or beginning graduate students. The book presents an enormous amount of topology, allowing an instructor to choose which topics to treat. The point-set material contains many interesting topics well beyond the basic core, including continua and metrizability. Geometric and algebraic topology topics include the classification of 2-manifolds, the fundamental group, covering spaces, and homology (simplicial and singular). A unique feature of the introduction to homology is to convey a clear geometric motivation by starting with mod 2 coefficients. The authors are acknowledged masters of IBL-style teaching. This book gives students joy-filled, manageable challenges that incrementally develop their knowledge and skills. The exposition includes insightful framing of fruitful points of view as well as advice on effective thinking and learning. The text presumes only a modest level of mathematical maturity to begin, but students who work their way through this text will grow from mathematics students into mathematicians. Michael Starbird is a University of Texas Distinguished Teaching Professor of Mathematics. Among his works are two other co-authored books in the Mathematical Association of America's (MAA) Textbook series. Francis Su is the Benediktsson-Karwa Professor of Mathematics at Harvey Mudd College and a past president of the MAA. Both authors are award-winning teachers, including each having received the MAA's Haimo Award for distinguished teaching. Starbird and Su are, jointly and individually, on lifelong missions to make learning—of mathematics and beyond—joyful, effective, and available to everyone. This book invites topology students and teachers to join in the adventure.

Now in paperback, Topology via Logic is an advanced textbook on topology for computer scientists. Based on a course given by the author to postgraduate students of computer science at Imperial College, it has three unusual features. First, the introduction is from the locale viewpoint, motivated by the logic of finite observations: this provides a more direct approach than the traditional one based on abstracting properties of open sets in the real line. Second, the methods of locale theory are freely exploited. Third, there is substantial discussion of some computer science applications. Although books on topology aimed at mathematics exist, no book has been written specifically for computer scientists. As computer scientists become more aware of the mathematical foundations of their discipline, it is appropriate that such topics are presented in a form of direct relevance and applicability. This book goes some way towards bridging the gap.