Skip to main content
Elsevier

Books in Mathematical logic and foundations

  • The Nuts and Bolts of Proofs

    An Introduction to Mathematical Proofs
    • 5th Edition
    • Antonella Cupillari
    • English
    The Nuts and Bolts of Proofs: An Introduction to Mathematical Proofs, Fifth Edition provides basic logic of mathematical proofs and how they work. The book offers techniques for both reading and writing proofs, discusses techniques in proving if/then statements by contrapositive and proofing by contradiction, includes the negation statement, and/or, examines various theorems, such as the if and only-if, equivalence theorems, existence theorems, and the uniqueness theorems. In addition, the use of counter examples, mathematical induction, composite statements including multiple hypothesis and multiple conclusions, and equality of numbers are also covered. The book also provides mathematical topics for practicing proof techniques. Included here are the Cartesian products, indexed families, functions, and relations. The last chapter of the book provides review exercises on various topics. Undergraduate students in engineering and physical science will find this book accessible as well as invaluable.

  • Calculus for Engineering Students

    Fundamentals, Real Problems, and Computers
    • 1st Edition
    • Jesus Martin Vaquero + 3 more
    • English
    Calculus for Engineering Students: Fundamentals, Real Problems, and Computers insists that mathematics cannot be separated from chemistry, mechanics, electricity, electronics, automation, and other disciplines. It emphasizes interdisciplinary problems as a way to show the importance of calculus in engineering tasks and problems. While concentrating on actual problems instead of theory, the book uses Computer Algebra Systems (CAS) to help students incorporate lessons into their own studies. Assuming a working familiarity with calculus concepts, the book provides a hands-on opportunity for students to increase their calculus and mathematics skills while also learning about engineering applications.

  • Optimization Theory Based on Neutrosophic and Plithogenic Sets

    • 1st Edition
    • Florentin Smarandache + 1 more
    • English
    Optimization Theory Based on Neutrosophic and Plithogenic Sets presents the state-of-the-art research on neutrosophic and plithogenic theories and their applications in various optimization fields. Its table of contents covers new concepts, methods, algorithms, modelling, and applications of green supply chain, inventory control problems, assignment problems, transportation problem, nonlinear problems and new information related to optimization for the topic from the theoretical and applied viewpoints in neutrosophic sets and logic.

  • Matrix Logic

    Theory and Applications
    • 1st Edition
    • A. Stern
    • English
    In this pioneering work, the author develops a fundamental formulation of logic in terms of theory of matrices and vector spaces. The discovery of matrix logic represents a landmark in the further formalization of logic. For the first time the power of direct mathematical computation is applied to the whole set of logic operations, allowing the derivation of both the classical and modal logics from the same formal base.The new formalism allows the author to enlarge the alphabet of the truth-values with negative logic antivalues and to link matrix logic descriptions with the Dirac formulation of quantum theory - a result having fundamental implications and repercussions for science as a whole.As a unified language which permits a logical examination of the underlying phenomena of quantum field theory and vice versa, matrix logic opens new avenues for the study of fundamental interactions and gives rise to a revolutionary conclusion that physics as such can be viewed and studied as a logic in the fundamental sense.Finally, modelling itself on exact sciences, matrix logic does not refute the classical logic but instead incorporates it as a special deterministic limit. The book requires multidisciplinary knowledge and will be of interest to physicists, mathematicians, computer scientists and engineers.

  • Topoi

    The Categorial Analysis of Logic
    • 2nd Edition
    • Volume 98
    • R. Goldblatt
    • English
    The first of its kind, this book presents a widely accessible exposition of topos theory, aimed at the philosopher-logician as well as the mathematician. It is suitable for individual study or use in class at the graduate level (it includes 500 exercises). It begins with a fully motivated introduction to category theory itself, moving always from the particular example to the abstract concept. It then introduces the notion of elementary topos, with a wide range of examples and goes on to develop its theory in depth, and to elicit in detail its relationship to Kripke's intuitionistic semantics, models of classical set theory and the conceptual framework of sheaf theory (``localization'' of truth). Of particular interest is a Dedekind-cuts style construction of number systems in topoi, leading to a model of the intuitionistic continuum in which a ``Dedekind-real'' becomes represented as a ``continuously-varia... classical real number''.The second edition contains a new chapter, entitled Logical Geometry, which introduces the reader to the theory of geometric morphisms of Grothendieck topoi, and its model-theoretic rendering by Makkai and Reyes. The aim of this chapter is to explain why Deligne's theorem about the existence of points of coherent topoi is equivalent to the classical Completeness theorem for ``geometric'' first-order formulae.

  • Higher Order Logic Theorem Proving and its Applications

    Proceedings of the IFIP TC10/WG10.2 International Workshop on Higher Order Logic Theorem Proving and its Applications - HOL '92 Leuven, Belgium, 21-24 September 1992
    • 1st Edition
    • Volume 20
    • L.J.M. Claesen + 1 more
    • English
    The HOL system is a higher order logic theorem proving system implemented at Edinburgh University, Cambridge University and INRIA. Its many applications, from the verification of hardware designs at all levels to the verification of programs and communication protocols are considered in depth in this volume. Other systems based on higher order logic, namely Nuprl and LAMBDA are also discussed. Features given particular consideration are: novel developments in higher order logic and its implementations in HOL; formal design and verification methodologies for hardware and software; public domain availability of the HOL system. Papers addressing these issues have been divided as follows: Mathematical Logic; Induction; General Modelling and Proofs; Formalizing and Modelling of Automata; Program Verification; Hardware Description Language Semantics; Hardware Verification Methodologies; Simulation in Higher Order Logic; Extended Uses of Higher Order Logic. Academic and industrial researchers involved in formal hardware and software design and verification methods should find the publication especially interesting and it is hoped it will also provide a useful reference tool for those working at software institutes and within the electronics industries.

  • Philosophy and Foundations of Mathematics

    L. E. J. Brouwer
    • 1st Edition
    • A. Heyting
    • English
    L.E.J. Brouwer: Collected Works, Volume 1: Philosophy and Foundations of Mathematics focuses on the principles, operations, and approaches promoted by Brouwer in studying the philosophy and foundations of mathematics. The publication first ponders on the construction of mathematics. Topics include arithmetic of integers, negative numbers, measurable continuum, irrational numbers, Cartesian geometry, similarity group, characterization of the linear system of the Cartesian or Euclidean and hyperbolic space, and non-Archimedean uniform groups on the one-dimensional continuum. The book then examines mathematics and experience and mathematics and logic. Topics include denumerably unfinished sets, continuum problem, logic of relations, consistency proofs for formal systems independent of their interpretation, infinite numbers, and problems of space and time. The text is a valuable reference for students, mathematicians, and researchers interested in the contributions of Brouwer in the studies on the philosophy and foundations of mathematics.

  • Essentials of Elementary School Mathematics

    • 1st Edition
    • Max D. Larsen + 1 more
    • English
    Essentials of Elementary School Mathematics is an introductory text on the essentials of mathematics taught in elementary schools. It presents a systematic development of the mathematics of arithmetic. A primary objective is to give students a background sufficient to understand and answer at an appropriate level the various quite penetrating questions asked by young students. Some examples and exercises are concerned primarily with pedagogical aspects of arithmetic. Comprised of 14 chapters, this book begins with an overview of the language of mathematics, focusing on concepts such as the conjunction (and); negation (not); disjunction (or); and conditional (if...then...). The discussion then turns to the theory of sets; the concept of binary operations; and recognition and identification of properties of various relations. The next section deals with the number systems of arithmetic: whole numbers, integers, rational numbers, and real numbers. Number theory and clock arithmetic are also examined, along with counting techniques and probability. The final section is devoted to motion geometry and analytic geometry. This monograph should be of interest to students and teachers of mathematicians at the elementary level.

  • The Mathematical Foundations of the Finite Element Method with Applications to Partial Differential Equations

    • 1st Edition
    • A. K. Aziz
    • English
    The Mathematical Foundations of the Finite Element Method with Applications to Partial Differential Equations is a collection of papers presented at the 1972 Symposium by the same title, held at the University of Maryland, Baltimore County Campus. This symposium relates considerable numerical analysis involved in research in both theoretical and practical aspects of the finite element method. This text is organized into three parts encompassing 34 chapters. Part I focuses on the mathematical foundations of the finite element method, including papers on theory of approximation, variational principles, the problems of perturbations, and the eigenvalue problem. Part II covers a large number of important results of both a theoretical and a practical nature. This part discusses the piecewise analytic interpolation and approximation of triangulated polygons; the Patch test for convergence of finite elements; solutions for Dirichlet problems; variational crimes in the field; and superconvergence result for the approximate solution of the heat equation by a collocation method. Part III explores the many practical aspects of finite element method. This book will be of great value to mathematicians, engineers, and physicists.

  • The Lambda Calculus

    Its Syntax and Semantics
    • 2nd Edition
    • Volume 103
    • H.P. Barendregt
    • English
    The revised edition contains a new chapter which provides an elegant description of the semantics. The various classes of lambda calculus models are described in a uniform manner. Some didactical improvements have been made to this edition. An example of a simple model is given and then the general theory (of categorical models) is developed. Indications are given of those parts of the book which can be used to form a coherent course.

  • The Nuts and Bolts of Proofs

    An Introduction to Mathematical Proofs
    • 4th Edition
    • Antonella Cupillari
    • English
    The Nuts and Bolts of Proofs: An Introduction to Mathematical Proofs provides basic logic of mathematical proofs and shows how mathematical proofs work. It offers techniques for both reading and writing proofs. The second chapter of the book discusses the techniques in proving if/then statements by contrapositive and proofing by contradiction. It also includes the negation statement, and/or. It examines various theorems, such as the if and only-if, or equivalence theorems, the existence theorems, and the uniqueness theorems. In addition, use of counter examples, mathematical induction, composite statements including multiple hypothesis and multiple conclusions, and equality of numbers are covered in this chapter. The book also provides mathematical topics for practicing proof techniques. Included here are the Cartesian products, indexed families, functions, and relations. The last chapter of the book provides review exercises on various topics. Undergraduate students in engineering and physical science will find this book invaluable.

  • Logic, Methodology and Philosophy of Science VI

    • 1st Edition
    • J.J. Cohen + 3 more
    • English
    Logic, Methodology and Philosophy of Science VI presents the results of recent research into the foundations of science. The volume contains invited papers presented at the Congress, covering the areas of Logic, Mathematics, Physical Sciences, Biological Sciences and the Humanities.

  • Logic Colloquium '84

    • 1st Edition
    • J.B. Paris + 2 more
    • English
    This proceedings volume contains most of the invited talks presented at the colloquium. The main topics treated are the model theory of arithmetic and algebra, the semantics of natural languages, and applications of mathematical logic to complexity theory. The volume contains both surveys by acknowledged experts and original research papers presenting advances in these disciplines.

  • Axiomatic Set Theory

    • 1st Edition
    • Volume 51
    • R.B. Chuaqui
    • English

  • Foundations of Infinitesimal Stochastic Analysis

    • 1st Edition
    • K.D. Stroyan + 1 more
    • English
    This book gives a complete and elementary account of fundamental results on hyperfinite measures and their application to stochastic processes, including the *-finite Stieltjes sum approximation of martingale integrals. Many detailed examples, not found in the literature, are included. It begins with a brief chapter on tools from logic and infinitesimal (or non-standard) analysis so that the material is accessible to beginning graduate students.

  • Theory of Relations

    • 1st Edition
    • R. Fraïssé
    • English
    The first part of this book concerns the present state of the theory of chains (= total or linear orderings), in connection with some refinements of Ramsey's theorem, due to Galvin and Nash-Williams. This leads to the fundamental Laver's embeddability theorem for scattered chains, using Nash-Williams' better quasi-orderings, barriers and forerunning.The second part (chapters 9 to 12) extends to general relations the main notions and results from order-type theory. An important connection appears with permutation theory (Cameron, Pouzet, Livingstone and Wagner) and with logics (existence criterion of Pouzet-Vaught for saturated relations). The notion of bound of a relation (due to the author) leads to important calculus of thresholds by Frasnay, Hodges, Lachlan and Shelah. The redaction systematically goes back to set-theoretic axioms and precise definitions (such as Tarski's definition for finite sets), so that for each statement it is mentioned either that ZF axioms suffice, or what other axioms are needed (choice, continuum, dependent choice, ultrafilter axiom, etc.).

  • Fundamentals of Generalized Recursion Theory

    • 1st Edition
    • M. Fitting
    • English

  • Combinatory Logic

    • 1st Edition
    • Volume 65
    • Lev D. Beklemishev
    • English

  • Logic, Methodology and Philosophy of Science, Proceeding of the 1960 International Congress

    • 1st Edition
    • Volume 44
    • Lev D. Beklemishev
    • English

  • Logic Colloquium 76, Proceedings of a conference

    • 1st Edition
    • Volume 87
    • Lev D. Beklemishev
    • English

  • Logic Colloquium '80

    • 1st Edition
    • D. van Dalen + 2 more
    • English
    The papers appearing in this volume are part of those originally intended for presentation at the conference: Logic Colloquium '80 - European Summer Meeting of the Association for Symbolic Logic (A.S.L.) which was to takeplace in Prague, August 24·30, 1980, principally under the auspices of the Czech Academy of Sciences. There were 36 invited speakers from Western and Eastern Europe, Israel, the U.S., and the U.S.S.R. The local organizingcommittee cabled participants on July 15, 1980 to inform them that the meeting was cancelled for technical reasons; a subsequent communication stated that the cancellation was due to unforeseen circumstances lying beyond the controlof the organizing committee. The unexpected cancellation of the Prague meeting was greatly regretted, since so much care, time, and energy had been given to its advance preparation by the local organizing committee as well as by representatives of the A.S.L.and its European Committee. The late date on which cancellation took place required drastic changes of plans by speakers and participants. Last-minute efforts to reschedule the meeting elsewhere in Europe could not be realized.

  • Logic from Russell to Church

    • 1st Edition
    • Volume 5
    • Dov M. Gabbay + 1 more
    • English
    This volume is number five in the 11-volume Handbook of the History of Logic. It covers the first 50 years of the development of mathematical logic in the 20th century, and concentrates on the achievements of the great names of the period--Russell, Post, Gödel, Tarski, Church, and the like. This was the period in which mathematical logic gave mature expression to its four main parts: set theory, model theory, proof theory and recursion theory. Collectively, this work ranks as one of the greatest achievements of our intellectual history. Written by leading researchers in the field, both this volume and the Handbook as a whole are definitive reference tools for senior undergraduates, graduate students and researchers in the history of logic, the history of philosophy, and any discipline, such as mathematics, computer science, and artificial intelligence, for whom the historical background of his or her work is a salient consideration.

  • Mathematical Analysis and Proof

    • 2nd Edition
    • David S G Stirling
    • English
    This fundamental and straightforward text addresses a weakness observed among present-day students, namely a lack of familiarity with formal proof. Beginning with the idea of mathematical proof and the need for it, associated technical and logical skills are developed with care and then brought to bear on the core material of analysis in such a lucid presentation that the development reads naturally and in a straightforward progression. Retaining the core text, the second edition has additional worked examples which users have indicated a need for, in addition to more emphasis on how analysis can be used to tell the accuracy of the approximations to the quantities of interest which arise in analytical limits.

  • A Transition to Abstract Mathematics

    Learning Mathematical Thinking and Writing
    • 2nd Edition
    • Randall Maddox
    • English
    Constructing concise and correct proofs is one of the most challenging aspects of learning to work with advanced mathematics. Meeting this challenge is a defining moment for those considering a career in mathematics or related fields. A Transition to Abstract Mathematics teaches readers to construct proofs and communicate with the precision necessary for working with abstraction. It is based on two premises: composing clear and accurate mathematical arguments is critical in abstract mathematics, and that this skill requires development and support. Abstraction is the destination, not the starting point.Maddox methodically builds toward a thorough understanding of the proof process, demonstrating and encouraging mathematical thinking along the way. Skillful use of analogy clarifies abstract ideas. Clearly presented methods of mathematical precision provide an understanding of the nature of mathematics and its defining structure. After mastering the art of the proof process, the reader may pursue two independent paths. The latter parts are purposefully designed to rest on the foundation of the first, and climb quickly into analysis or algebra. Maddox addresses fundamental principles in these two areas, so that readers can apply their mathematical thinking and writing skills to these new concepts. From this exposure, readers experience the beauty of the mathematical landscape and further develop their ability to work with abstract ideas.

  • The Many Valued and Nonmonotonic Turn in Logic

    • 1st Edition
    • Volume 8
    • Dov M. Gabbay + 1 more
    • English
    The present volume of the Handbook of the History of Logic brings together two of the most important developments in 20th century non-classical logic. These are many-valuedness and non-monotonicity. On the one approach, in deference to vagueness, temporal or quantum indeterminacy or reference-failure, sentences that are classically non-bivalent are allowed as inputs and outputs to consequence relations. Many-valued, dialetheic, fuzzy and quantum logics are, among other things, principled attempts to regulate the flow-through of sentences that are neither true nor false. On the second, or non-monotonic, approach, constraints are placed on inputs (and sometimes on outputs) of a classical consequence relation, with a view to producing a notion of consequence that serves in a more realistic way the requirements of real-life inference. Many-valued logics produce an interesting problem. Non-bivalent inputs produce classically valid consequence statements, for any choice of outputs. A major task of many-valued logics of all stripes is to fashion an appropriately non-classical relation of consequence.The chief preoccupation of non-monotonic (and default) logicians is how to constrain inputs and outputs of the consequence relation. In what is called “left non-monotonicity”, it is forbidden to add new sentences to the inputs of true consequence-statemen... The restriction takes notice of the fact that new information will sometimes override an antecedently (and reasonably) derived consequence. In what is called “right non-monotonicity”, limitations are imposed on outputs of the consequence relation. Most notably, perhaps, is the requirement that the rule of or-introduction not be given free sway on outputs. Also prominent is the effort of paraconsistent logicians, both preservationist and dialetheic, to limit the outputs of inconsistent inputs, which in classical contexts are wholly unconstrained.In some instances, our two themes coincide. Dialetheic logics are a case in point. Dialetheic logics allow certain selected sentences to have, as a third truth value, the classical values of truth and falsity together. So such logics also admit classically inconsistent inputs. A central task is to construct a right non-monotonic consequence relation that allows for these many-valued, and inconsistent, inputs.The Many Valued and Non-Monotonic Turn in Logic is an indispensable research tool for anyone interested in the development of logic, including researchers, graduate and senior undergraduate students in logic, history of logic, mathematics, history of mathematics, computer science, AI, linguistics, cognitive science, argumentation theory, and the history of ideas.

  • Lectures on the Curry-Howard Isomorphism

    • 1st Edition
    • Volume 149
    • Morten Heine Sørensen + 1 more
    • English
    The Curry-Howard isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For instance,minimal propositional logic corresponds to simply typed lambda-calculus, first-order logic corresponds to dependent types, second-order logic corresponds to polymorphic types, sequent calculus is related to explicit substitution, etc.The isomorphism has many aspects, even at the syntactic level:formulas correspond to types, proofs correspond to terms, provability corresponds to inhabitation, proof normalization corresponds to term reduction, etc.But there is more to the isomorphism than this. For instance, it is an old idea---due to Brouwer, Kolmogorov, and Heyting---that a constructive proof of an implication is a procedure that transformsproofs of the antecedent into proofs of the succedent; the Curry-Howard isomorphism gives syntactic representations of such procedures. The Curry-Howard isomorphism also provides theoretical foundations for many modern proof-assistant systems (e.g. Coq).This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic.Key features- The Curry-Howard Isomorphism treated as common theme- Reader-friendly introduction to two complementary subjects: Lambda-calculus and constructive logics- Thorough study of the connection between calculi and logics- Elaborate study of classical logics and control operators- Account of dialogue games for classical and intuitionistic logic- Theoretical foundations of computer-assisted reasoning

  • Infinite Words

    Automata, Semigroups, Logic and Games
    • 1st Edition
    • Volume 141
    • Dominique Perrin + 1 more
    • English
    Infinite Words is an important theory in both Mathematics and Computer Sciences. Many new developments have been made in the field, encouraged by its application to problems in computer science. Infinite Words is the first manual devoted to this topic.Infinite Words explores all aspects of the theory, including Automata, Semigroups, Topology, Games, Logic, Bi-infinite Words, Infinite Trees and Finite Words. The book also looks at the early pioneering work of Büchi, McNaughton and Schützenberger.

  • Relation Algebras by Games

    • 1st Edition
    • Volume 147
    • Robin Hirsch + 1 more
    • English
    Relation algebras are algebras arising from the study of binary relations.They form a part of the field of algebraic logic, and have applications in proof theory, modal logic, and computer science. This research text uses combinatorial games to study the fundamental notion of representations of relation algebras. Games allow an intuitive and appealing approach to the subject, and permit substantial advances to be made. The book contains many new results and proofs not published elsewhere. It should be invaluable to graduate students and researchers interested in relation algebras and games.After an introduction describing the authors' perspective on the material, the text proper has six parts. The lengthy first part is devoted to background material, including the formal definitions of relation algebras, cylindric algebras, their basic properties, and some connections between them. Examples are given. Part 1 ends with a short survey of other work beyond the scope of the book. In part 2, games are introduced, and used to axiomatise various classes of algebras. Part 3 discusses approximations to representability, using bases, relation algebra reducts, and relativised representations. Part 4 presents some constructions of relation algebras, including Monk algebras and the 'rainbow construction', and uses them to show that various classes of representable algebras are non-finitely axiomatisable or even non-elementary. Part 5 shows that the representability problem for finite relation algebras is undecidable, and then in contrast proves some finite base property results. Part 6 contains a condensed summary of the book, and a list of problems. There are more than 400 exercises.The book is generally self-contained on relation algebras and on games, and introductory text is scattered throughout. Some familiarity with elementary aspects of first-order logic and set theory is assumed, though many of the definitions are given. Chapter 2 introduces the necessary universal algebra and model theory, and more specific model-theoretic ideas are explained as they arise.

  • Elementary Number Theory with Applications, Student Solutions Manual

    • 1st Edition
    • Thomas Koshy
    • English
    This is a student solutions manual for Elementary Number Theory with Applications 1st edition by Thomas Koshy (2002). Note that the textbook itself is not included in this purchase. From the back cover of the textbook: Modern technology has brought a new dimension to the power of number theory: constant practical use. Once considered the purest of pure mathematics, number theory has become an essential tool in the rapid development of technology in a number of areas, including art, coding theory, cryptology, and computer science. The range of fascinating applications confirms the boundlessness of human ingenuity and creativity. Elementary Number Theory captures the author's fascination for the subject: its beauty, elegance, and historical development, and the opportunities number theory provides for experimentation, exploration, and, of course, its marvelous applications.

  • The Nuts and Bolts of Proofs

    • 2nd Edition
    • Antonella Cupillari
    • English
    This book leads readers through a progressive explanation of what mathematical proofs are, why they are important, and how they work, along with a presentation of basic techniques used to construct proofs. The Second Edition presents more examples, more exercises, a more complete treatment of mathematical induction and set theory, and it incorporates suggestions from students and colleagues. Since the mathematical concepts used are relatively elementary, the book can be used as a supplement in any post-calculus course.This title has been successfully class-tested for years. There is an index for easier reference, a more extensive list of definitions and concepts, and an updated bibliography. An extensive collection of exercises with complete answers are provided, enabling students to practice on their own. Additionally, there is a set of problems without solutions to make it easier for instructors to prepare homework assignments.

  • Theory of Relations

    • 1st Edition
    • Volume 145
    • R. Fraisse
    • English
    Relation theory originates with Hausdorff (Mengenlehre 1914) and Sierpinski (Nombres transfinis, 1928) with the study of order types, specially among chains = total orders = linear orders. One of its first important problems was partially solved by Dushnik, Miller 1940 who, starting from the chain of reals, obtained an infinite strictly decreasing sequence of chains (of continuum power) with respect to embeddability. In 1948 I conjectured that every strictly decreasing sequence of denumerable chains is finite. This was affirmatively proved by Laver (1968), in the more general case of denumerable unions of scattered chains (ie: which do not embed the chain Q of rationals), by using the barrier and the better orderin gof Nash-Williams (1965 to 68).Another important problem is the extension to posets of classical properties of chains. For instance one easily sees that a chain A is scattered if the chain of inclusion of its initial intervals is itself scattered (6.1.4). Let us again define a scattered poset A by the non-embedding of Q in A. We say that A is finitely free if every antichain restriction of A is finite (antichain = set of mutually incomparable elements of the base). In 1969 Bonnet and Pouzet proved that a poset A is finitely free and scattered iff the ordering of inclusion of initial intervals of A is scattered. In 1981 Pouzet proved the equivalence with the a priori stronger condition that A is topologically scattered: (see 6.7.4; a more general result is due to Mislove 1984); ie: every non-empty set of initial intervals contains an isolated elements for the simple convergence topology.In chapter 9 we begin the general theory of relations, with the notions of local isomorphism, free interpretability and free operator (9.1 to 9.3), which is the relationist version of a free logical formula. This is generalized by the back-and-forth notions in 10.10: the (k,p)-operator is the relationist version of the elementary formula (first order formula with equality).Chapter 12 connects relation theory with permutations: theorem of the increasing number of orbits (Livingstone, Wagner in 12.4). Also in this chapter homogeneity is introduced, then more deeply studied in the Appendix written by Norbert Saucer.Chapter 13 connects relation theory with finite permutation groups; the main notions and results are due to Frasnay. Also mention the extension to relations of adjacent elements, by Hodges, Lachlan, Shelah who by this mean give an exact calculus of the reduction threshold.The book covers almost all present knowledge in Relation Theory, from origins (Hausdorff 1914, Sierpinski 1928) to classical results (Frasnay 1965, Laver 1968, Pouzet 1981) until recent important publications (Abraham, Bonnet 1999).All results are exposed in axiomatic set theory. This allows us, for each statement, to specify if it is proved only from ZF axioms of choice, the continuum hypothesis or only the ultrafilter axiom or the axiom of dependent choice, for instance.

  • From Peirce to Skolem

    A Neglected Chapter in the History of Logic
    • 1st Edition
    • Volume 4
    • Geraldine Brady
    • English
    This book is an account of the important influence on the development of mathematical logic of Charles S. Peirce and his student O.H. Mitchell, through the work of Ernst Schröder, Leopold Löwenheim, and Thoralf Skolem. As far as we know, this book is the first work delineating this line of influence on modern mathematical logic.

  • Provability, Computability and Reflection

    • 1st Edition
    • Volume 27
    • Lev D. Beklemishev
    • English

  • Formal Systems and Recursive Functions

    • 1st Edition
    • Volume 40
    • Lev D. Beklemishev
    • English

  • Studies in Logic and the Foundations of Mathematics

    • 1st Edition
    • Volume 42
    • Lev D. Beklemishev
    • English

  • Proof Theory

    • 1st Edition
    • Volume 81
    • Lev D. Beklemishev
    • English

  • Provability, Computability and Reflection

    • 1st Edition
    • Volume 12
    • Lev D. Beklemishev
    • English

  • WORD PROBLEMS II

    • 1st Edition
    • Volume 95
    • Lev D. Beklemishev
    • English

  • Non-Classical Logics, Model Theory, And Computability

    • 1st Edition
    • Volume 89
    • Lev D. Beklemishev
    • English

  • Provability, Computability and Reflection

    • 1st Edition
    • Volume 30
    • Lev D. Beklemishev
    • English

  • Intuitionism An Introduction

    • 1st Edition
    • Volume 41
    • Lev D. Beklemishev
    • English

  • Sentences Undecidable in Formalized Arithmetic

    • 1st Edition
    • Volume 10
    • Lev D. Beklemishev
    • English

  • Constructive Order Types

    • 1st Edition
    • Volume 56
    • Lev D. Beklemishev
    • English

  • Aspects of Inductive Logic

    • 1st Edition
    • Volume 43
    • Lev D. Beklemishev
    • English

  • Model Theory For Infinitary Logic

    • 1st Edition
    • Volume 62
    • Lev D. Beklemishev
    • English

  • Computer Programming and Formal Systems

    • 1st Edition
    • Volume 35
    • Lev D. Beklemishev
    • English

  • Truth, Syntax and Modality

    • 1st Edition
    • Volume 68
    • Lev D. Beklemishev
    • English

  • Mathematical Logic and Foundations of Set Theory, Proceedings of an International Colloquium Held Under the Auspices of The Israel Academy of Sciences and Humanities

    • 1st Edition
    • Volume 59
    • Lev D. Beklemishev
    • English

  • Provability, Computability and Reflection

    • 1st Edition
    • Volume 24
    • Lev D. Beklemishev
    • English

  • Provability, Computability and Reflection

    • 1st Edition
    • Volume 14
    • Lev D. Beklemishev
    • English