Mathematical logic Books

Book SynopsisThe starting point for this monograph is the previously unknown connection between the Continuum Hypothesis and the saturation of the non-stationary ideal on ω1; and the principle result of this monograph is the identification of a canonical model in which the Continuum Hypothesis is false. This is the first example of such a model and moreover the model can be characterized in terms of maximality principles concerning the universal-existential theory of all sets of countable ordinals. This model is arguably the long sought goal of the study of forcing axioms and iterated forcing but is obtained by completely different methods, for example no theory of iterated forcing whatsoever is required. The construction of the model reveals a powerful technique for obtaining independence results regarding the combinatorics of the continuum, yielding a number of results which have yet to be obtained by any other method. This monograph is directed to researchers and advanced graduate students in Set Theory. The second edition is updated to take into account some of the developments in the decade since the first edition appeared, this includes a revised discussion of Ω-logic and related matters.

Read more less

Book SynopsisThis is a comprehensive book on the life and works of Leon Henkin (1921–2006), an extraordinary scientist and excellent teacher whose writings became influential right from the beginning of his career with his doctoral thesis on “The completeness of formal systems” under the direction of Alonzo Church. Upon the invitation of Alfred Tarski, Henkin joined the Group in Logic and the Methodology of Science in the Department of Mathematics at the University of California Berkeley in 1953. He stayed with the group until his retirement in 1991. This edited volume includes both foundational material and a logic perspective. Algebraic logic, model theory, type theory, completeness theorems, philosophical and foundational studies are among the topics covered, as well as mathematical education. The work discusses Henkin’s intellectual development, his relation to his predecessors and contemporaries and his impact on the recent development of mathematical logic. It offers a valuable reference work for researchers and students in the fields of philosophy, mathematics and computer science.Table of ContentsPart I Biographical Studies.- Leon Henkin.- Lessons from Leon.- Tracing back “Logic in Wonderland” to my work with Leon Henkin.- Henkin and the Suit.- A Fortuitous Year with Leon Henkin.- Leon Henkin and a Life of Service.- Part II Henkin‘s Contribution to XX Century Logic.- Leon Henkin and Cylindric Algebras.- A Bit of History Related to Logic Based on Equality.- Pairing Logical and Pedagogical Foundations for the Theory of Positive Rational Numbers. Henkin‘s unfinished work.- Leon Henkin the Reviewer.- Henkin‘s Theorem in Textbooks.- Henkin on Completeness.- Part III Extensions and Perspectives in Henkin‘s Work.- The Countable Henkin Principle.- Reflections on a Theorem of Henkin.- Henkin‘s Completeness Proof and Glivenko‘s Theorem.- From Classical to Fuzzy Type Theory.- The Henkin Sentence.- April the 19th.- Henkin and Hybrid Logic.- Changing a Semantics: Oportunism or Courage?.- Appendix Curriculum Vitae: Leon Henkin.

Read more less

Book SynopsisThis volume is dedicated to Prof. Dag Prawitz and his outstanding contributions to philosophical and mathematical logic. Prawitz's eminent contributions to structural proof theory, or general proof theory, as he calls it, and inference-based meaning theories have been extremely influential in the development of modern proof theory and anti-realistic semantics. In particular, Prawitz is the main author on natural deduction in addition to Gerhard Gentzen, who defined natural deduction in his PhD thesis published in 1934. The book opens with an introductory paper that surveys Prawitz's numerous contributions to proof theory and proof-theoretic semantics and puts his work into a somewhat broader perspective, both historically and systematically. Chapters include either in-depth studies of certain aspects of Dag Prawitz's work or address open research problems that are concerned with core issues in structural proof theory and range from philosophical essays to papers of a mathematical nature. Investigations into the necessity of thought and the theory of grounds and computational justifications as well as an examination of Prawitz's conception of the validity of inferences in the light of three “dogmas of proof-theoretic semantics” are included. More formal papers deal with the constructive behaviour of fragments of classical logic and fragments of the modal logic S4 among other topics. In addition, there are chapters about inversion principles, normalization of proofs, and the notion of proof-theoretic harmony and other areas of a more mathematical persuasion. Dag Prawitz also writes a chapter in which he explains his current views on the epistemic dimension of proofs and addresses the question why some inferences succeed in conferring evidence on their conclusions when applied to premises for which one already possesses evidence.Trade Review“Swedish logician and philosopher Dag Prawitz and his distinguished contributions to philosophical and mathematical logic are the focus of this book. … This is an excellent book, celebrating not only Prawitz’s career, but also a movement in the contrary direction of W. V. O Quine’s views against the so-called (somehow prejudicially) ‘deviant’ logics, and I cannot forbear from congratulating the editor for the distinctive choice of topics and for the general tone of the book.” (Walter Carnielli, Computing Reviews, May, 2015)Table of ContentsPrawitz, proofs, and meaning; Wansing, Heinrich.- A short scientific autobiography; Prawitz, Dag.- Explaining deductive inference; Prawitz, Dag.- Necessity of Thought; Cozzo, Cesare.- On the Motives for Proof Theory; Detlefsen, Michael.- Inferential Semantics; Došen, Kosta.- Cut elimination, substitution and normalization; Dyckhoff, Roy.- Inversion principles and introduction rules; Milne, Peter.- Intuitionistic Existential Instantiation and Epsilon Symbol; Mints, Grigori.- Meaning in Use; Negri, Sara and von Plato, Jan.- Fusing Quantifiers and Connectives: Is Intuitionistic Logic Different?; Pagin, Peter.- On constructive fragments of Classical Logic; Pereira; Luiz Carlos and Haeusler, Edward Hermann.- General-Elimination Harmony and Higher-Level Rules; Read, Stephen.- Hypothesis-discharging rules in atomic bases; Sandqvist, Tor.- Harmony in proof-theoretic semantics: A reductive analysis; Schroeder-Heister, Peter.- First-order Logic without bound variables: Compositional Semantics; Tait, William W.- On Gentzen’s Structural Completeness Proof; Tennant, Neil.- A Notion of C-Justification for Empirical Statements; Usberti, Gabriele.

Read more less

Book SynopsisImplicit definability and compactness in infinitary languages.- Some remarks on the model theory of infinitary languages.- Remarks on the theory of geometrical constructions.- Note on admissible ordinals.- An algebraic proof of the barwise compactness theorem.- Formulas with linearly ordered quantifiers.- Some problems in group theory.- Choice of infinitary languages by means of definability criteria; Generalized recursion theory.- Definability, automorphisms, and infinitary languages.- The hanf number for complete sentences.- Quantified algebras.- Normal derivability in classical logic.- A determinate logic.- (?1, ?) properties of unions of models.Table of ContentsImplicit definability and compactness in infinitary languages.- Some remarks on the model theory of infinitary languages.- Remarks on the theory of geometrical constructions.- Note on admissible ordinals.- An algebraic proof of the barwise compactness theorem.- Formulas with linearly ordered quantifiers.- Some problems in group theory.- Choice of infinitary languages by means of definability criteria; Generalized recursion theory.- Definability, automorphisms, and infinitary languages.- The hanf number for complete sentences.- Quantified algebras.- Normal derivability in classical logic.- A determinate logic.- (?1, ?) properties of unions of models.

Read more less

Book SynopsisInductive definitions and subsystems of analysis.- Proof theoretic equivalences between classical and constructive theories for analysis.- Inductive definitions, constructive ordinals, and normal derivations.- The ??+1-Rule.- Ordinal analysis of ID?.- Proof-theoretical analysis of ID? by the method of local predicativity.Table of ContentsInductive definitions and subsystems of analysis.- Proof theoretic equivalences between classical and constructive theories for analysis.- Inductive definitions, constructive ordinals, and normal derivations.- The ??+1-Rule.- Ordinal analysis of ID?.- Proof-theoretical analysis of ID? by the method of local predicativity.

Read more less

Book SynopsisThis is a softcover reprint of the English translation of 1968 of N. Bourbaki's, Theorie des Ensembles (1970).Table of ContentsI. Description of Formal Mathematics.- § 1. Terms and relations.- 1. Signs and assemblies.- 2. Criteria of substitution.- 3. Formative constructions.- 4. Formative criteria.- § 2. Theorems.- 1. The axioms.- 2. Proofs.- 3. Substitutions in a theory.- 4. Comparison of theories.- § 3. Logical theories.- 1. Axioms.- 2. First consequences.- 3. Methods of proof.- 4. Conjunction.- 5. Equivalence.- § 4. Quantified theories.- 1. Definition of quantifiers.- 2. Axioms of quantified theories.- 3. Properties of quantifiers.- 4. Typical quantifiers.- § 5. Equalitarian theories.- 1. The axioms.- 2. Properties of equality.- 3. Functional relations.- Appendix. Characterization of terms and relations.- 1. Signs and words.- 2. Significant words.- 3. Characterization of significant words.- 4. Application to assemblies in a mathematical theory.- Exercises for § 1.- Exercises for § 2.- Exercises for § 3.- Exercises for § 4.- Exercises for § 5.- Exercises for the Appendix.- II. Theory of Sets.- § 1. Collectivizing relations.- 1. The theory of sets.- 2. Inclusion.- 3. The axiom of extent.- 4. Collectivizing relations.- 5. The axiom of the set of two elements.- 6. The scheme of selection and union.- 7. Complement of a set. The empty set.- § 2. Ordered pairs.- 1. The axiom of the ordered pair.- 2. Product of two sets.- § 3. Correspondences.- 1. Graphs and correspondences.- 2. Inverse of a correspondence.- 3. Composition of two correspondences.- 4. Functions.- 5. Restrictions and extensions of functions.- 6. Definition of a function by means of a term.- 7. Composition of two functions. Inverse function.- 8. Retractions and sections.- 9. Functions of two arguments.- § 4. Union and intersection of a family of sets.- 1. Definition of the union and the intersection of a family of sets.- 2. Properties of union and intersection.- 3. Images of a union and an intersection.- 4. Complements of unions and intersections.- 5. Union and intersection of two sets.- 6. Coverings.- 7. Partitions.- 8. Sum of a family of sets.- § 5. Product of a family of sets.- 1. The axiom of the set of subsets.- 2. Set of mappings of one set into another.- 3. Definitions of the product of a family of sets.- 4. Partial products.- 5. Associativity of products of sets.- 6. Distributivity formulae.- 7. Extension of mappings to products.- § 6. Equivalence relations.- 1. Definition of an equivalence relation.- 2. Equivalence classes; quotient set.- 3. Relations compatible with an equivalence relation.- 4. Saturated subsets.- 5. Mappings compatible with equivalence relations.- 6. Inverse image of an equivalence relation; induced equivalence relation.- 7. Quotients of equivalence relations.- 8. Product of two equivalence relations.- 9. Classes of equivalent objects.- Exercises for § 1.- Exercises for § 2.- Exercises for § 3.- Exercises for § 4.- Exercises for § 5.- Exercises for § 6.- III. Ordered Sets, Cardinals, Integers.- § 1. Order relations. Ordered sets.- 1. Definition of an order relation.- 2. Preorder relations.- 3. Notation and terminology.- 4. Ordered subsets. Product of ordered sets.- 5. Increasing mappings.- 6. Maximal and minimal elements.- 7. Greatest element and least element.- 8. Upper and lower bounds.- 9. Least upper bound and greatest lower bound.- 10. Directed sets.- 11. Lattices.- 12. Totally ordered sets.- 13. Intervals.- § 2. Well-ordered sets.- 1. Segments of a well-ordered set.- 2. The principle of transfinite induction.- 3. Zermelo’s theorem.- 4. Inductive sets.- 5. Isomorphisms of well-ordered sets.- 6. Lexicographic products.- § 3. Equipotent sets. Cardinals.- 1. The cardinal of a set.- 2. Order relation between cardinals.- 3. Operations on cardinals.- 4. Properties of the cardinals 0 and 1.- 5. Exponentiation of cardinals.- 6. Order relation and operations on cardinals.- § 4. Natural integers. Finite sets.- 1. Definition of integers.- 2. Inequalities between integers.- 3. The principle of induction.- 4. Finite subsets of ordered sets.- 5. Properties of finite character.- § 5. Properties of integers.- 1. Operations on integers and finite sets.- 2. Strict inequalities between integers.- 3. Intervals in sets of integers.- 4. Finite sequences.- 5. Characteristic functions of sets.- 6. Euclidean division.- 7. Expansion to base b.- 8. Combinatorial analysis.- § 6. Infinite sets.- 1. The set of natural integers.- 2. Definition of mappings by induction.- 3. Properties of infinite cardinals.- 4. Countable sets.- 5. Stationary sequences.- § 7. Inverse limits and direct limits.- 1. Inverse limits.- 2. Inverse systems of mappings.- 3. Double inverse limit.- 4. Conditions for an inverse limit to be non-empty.- 5. Direct limits.- 6. Direct systems of mappings.- 7. Double direct limit. Product of direct limits.- Exercises for § 1.- Exercises for § 2.- Exercises for § 3.- Exercises for § 4.- Exercises for § 5.- Exercises for § 6.- Exercises for § 7.- Historical Note on § 5.- IV. Structures.- § 1. Structures and isomorphisms.- 1. Echelons.- 2. Canonical extensions of mappings.- 3. Transportable relations.- 4. Species of structures.- 5. Isomorphisms and transport of structures.- 6. Deduction of structures.- 7. Equivalent species of structures.- § 2. Morphisms and derived structures.- 1. Morphisms.- 2. Finer structures.- 3. Initial structures.- 4. Examples of initial structures.- 5. Final structures.- 6. Examples of final structures.- § 3. Universal mappings.- 1. Universal sets and mappings.- 2. Existence of universal mappings.- 3. Examples of universal mappings.- Exercises for § 1.- Exercises for § 2.- Exercises for § 3.- Historical Note on Chapters I-IV.- Summary of Results.- § 1. Elements and subsets of a set.- § 2. Functions.- § 3. Products of sets.- § 4. Union, intersection, product of a family of sets.- § 5. Equivalence relations and quotient sets.- § 6. Ordered sets.- § 7. Powers. Countable sets.- § 8. Scales of sets. Structures.- Index of notation.- Index of terminology.- Axioms and schemes of the theory of sets.

Read more less

Book SynopsisThis is a thoroughly revised and enlarged second edition that presents the main results of descriptive complexity theory, that is, the connections between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds. The logics that are important in this context include fixed-point logics, transitive closure logics, and also certain infinitary languages; their model theory is studied in full detail. The book is written in such a way that the respective parts on model theory and descriptive complexity theory may be read independently.Table of ContentsPreliminaries.- The Ehrenfeucht-Fraïssé Method.- More on Games.- 0-1 Laws.- Satisfiability in the Finite.- Finite Automata and Logic: A Microcosm of Finite Model Theory.- Descriptive Complexity Theory.- Logics with Fixed-Point Operators.- Logic Programs.- Optimization Problems.- Logics for PTIME.- Quantifiers and Logical Reductions.

Read more less

Book SynopsisOver the years, this book has become a standard reference and guide in the set theory community. It provides a comprehensive account of the theory of large cardinals from its beginnings and some of the direct outgrowths leading to the frontiers of contemporary research, with open questions and speculations throughout.Table of ContentsPreliminaries.- Beginnings.- Partition Properties.- Forcing and Sets of Reals.- Aspects of Measurability.- Strong Hypotheses.- Determinacy.

Read more less

Book SynopsisThe algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro­ posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a fact summarized in Church's thesis, which says that the resulting definitions form an adequate formalization of the intuitive notion of computability. This had and continues to have an enormous effect. First of all, with these notions it has been possible to prove that various problems are algorithmically unsolvable. Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem. Secondly, concepts like Turing machines and WHILE-programs had a strong influence on the development of the first computers and programming languages. In the era of digital computers, the question of finding efficient solutions to algorithmically solvable problems has become increasingly important. In addition, the fact that some problems can be solved very efficiently, while others seem to defy all attempts to find an efficient solution, has called for a deeper under­ standing of the intrinsic computational difficulty of problems.Trade ReviewP. Bürgisser, M. Clausen, M.A. Shokrollahi, and T. Lickteig Algebraic Complexity Theory "The book contains interesting exercises and useful bibliographical notes. In short, this is a nice book."—MATHEMATICAL REVIEWS From the reviews: "This book is certainly the most complete reference on algebraic complexity theory that is available hitherto. … superb bibliographical and historical notes are given at the end of each chapter. … this book would most certainly make a great textbook for a graduate course on algebraic complexity theory. … In conclusion, any researchers already working in the area should own a copy of this book. … beginners at the graduate level who have been exposed to undergraduate pure mathematics would find this book accessible." (Anthony Widjaja, SIGACT News, Vol. 37 (2), 2006)Table of Contents1. Introduction.- I. Fundamental Algorithms.- 2. Efficient Polynomial Arithmetic.- 3. Efficient Algorithms with Branching.- II. Elementary Lower Bounds.- 4. Models of Computation.- 5. Preconditioning and Transcendence Degree.- 6. The Substitution Method.- 7. Differential Methods.- III. High Degree.- 8. The Degree Bound.- 9. Specific Polynomials which Are Hard to Compute.- 10. Branching and Degree.- 11. Branching and Connectivity.- 12. Additive Complexity.- IV. Low Degree.- 13. Linear Complexity.- 14. Multiplicative and Bilinear Complexity.- 15. Asymptotic Complexity of Matrix Multiplication.- 16. Problems Related to Matrix Multiplication.- 17. Lower Bounds for the Complexity of Algebras.- 18. Rank over Finite Fields and Codes.- 19. Rank of 2-Slice and 3-Slice Tensors.- 20. Typical Tensorial Rank.- V. Complete Problems.- 21. P Versus NP: A Nonuniform Algebraic Analogue.- List of Notation.

Read more less

Book SynopsisThe purpose of this Handbook is to highlight both theory and applications of weighted automata. Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, e. g. , the cost involved when executing a transition, the amount of resources or time needed for this,or the probability or reliability of its successful execution. The behavior of weighted finite automata can then be considered as the function (suitably defined) associating with each word the weight of its execution. Clearly, weights can also be added to classical automata with infinite state sets like pushdown automata; this extension constitutes the general concept of weighted automata. To illustrate the diversity of weighted automata, let us consider the following scenarios. Assume that a quantitative system is modeled by a classical automaton in which the transitions carry as weights the amount of resources needed for their execution. Then the amount of resources needed for a path in this weighted automaton is obtained simply as the sum of the weights of its transitions. Given a word, we might be interested in the minimal amount of resources needed for its execution, i. e. , for the successful paths realizing the given word. In this example, we could also replace the “resources” by “profit” and then be interested in the maximal profit realized, correspondingly, by a given word.Trade ReviewFrom the reviews:"This book is an excellent reference for researchers in the field, as well as students interested in this research area. The presentation of applications makes it interesting to researchers from other fields to study weighted automata. ... One of the main arguments in favor of this handbook is the completeness of its index table — usually a faulty section in such volumes. The chapters are globally well-written and self-contained, thus pleasant to read, and the efforts put to maintain consistency in vocabulary thorough the book are very appreciable." (Michaël Cadilhac, The Book Review Column 43-3, 2012)“The book presents a broad survey, theory and applications, of weighted automata, classical nondeterministic automata in which transitions carry weights. … The individual articles are written by well-known researchers in the field: they include extensive lists of references and many open problems. The book is valuable for both computer scientists and mathematicians (being interested in discrete structures).” (Cristian S. Calude, Zentralblatt MATH, Vol. 1200, 2011)Table of ContentsFoundations.- Semirings and Formal Power Series.- Fixed Point Theory.- Concepts of Weighted Recognizability.- Finite Automata.- Rational and Recognisable Power Series.- Weighted Automata and Weighted Logics.- Weighted Automata Algorithms.- Weighted Discrete Structures.- Algebraic Systems and Pushdown Automata.- Lindenmayer Systems.- Weighted Tree Automata and Tree Transducers.- Traces, Series-Parallel Posets, and Pictures: A Weighted Study.- Applications.- Digital Image Compression.- Fuzzy Languages.- Model Checking Linear-Time Properties of Probabilistic Systems.- Applications of Weighted Automata in Natural Language Processing.

Read more less

Book SynopsisStochastic analysis is not only a thriving area of pure mathematics with intriguing connections to partial differential equations and differential geometry. It also has numerous applications in the natural and social sciences (for instance in financial mathematics or theoretical quantum mechanics) and therefore appears in physics and economics curricula as well. However, existing approaches to stochastic analysis either presuppose various concepts from measure theory and functional analysis or lack full mathematical rigour. This short book proposes to solve the dilemma: By adopting E. Nelson's "radically elementary" theory of continuous-time stochastic processes, it is based on a demonstrably consistent use of infinitesimals and thus permits a radically simplified, yet perfectly rigorous approach to stochastic calculus and its fascinating applications, some of which (notably the Black-Scholes theory of option pricing and the Feynman path integral) are also discussed in the book.Table of Contents1 Infinitesimal calculus, consistently and accessibly.- 2 Radically elementary probability theory.- 3 Radically elementary stochastic integrals.- 4 The radically elementary Girsanov theorem and the diffusion invariance principle.- 5 Excursion to nancial economics: A radically elementary approach to the fundamental theorems of asset pricing.- 6 Excursion to financial engineering: Volatility invariance in the Black-Scholes model.- 7 A radically elementary theory of Itô diffusions and associated partial differential equations.- 8 Excursion to mathematical physics: A radically elementary definition of Feynman path integrals.- 9 A radically elementary theory of Lévy processes.- 10 Final remarks.

Read more less

Book SynopsisMathematics is often considered as a body of knowledge that is essen­ tially independent of linguistic formulations, in the sense that, once the content of this knowledge has been grasped, there remains only the problem of professional ability, that of clearly formulating and correctly proving it. However, the question is not so simple, and P. Weingartner's paper (Language and Coding-Dependency of Results in Logic and Mathe­ matics) deals with some results in logic and mathematics which reveal that certain notions are in general not invariant with respect to different choices of language and of coding processes. Five example are given: 1) The validity of axioms and rules of classical propositional logic depend on the interpretation of sentential variables; 2) The language­ dependency of verisimilitude; 3) The proof of the weak and strong anti­ inductivist theorems in Popper's theory of inductive support is not invariant with respect to limitative criteria put on classical logic; 4) The language-dependency of the concept of provability; 5) The language­ dependency of the existence of ungrounded and paradoxical sentences (in the sense of Kripke). The requirements of logical rigour and consistency are not the only criteria for the acceptance and appreciation of mathematical proposi­ tions and theories.Table of ContentsGeneral Philosophical Perspectives.- Logic, Mathematics, Ontology.- From Certainty to Fallibility in Mathematics?.- Moderate Mathematical Fictionism.- Language and Coding-Dependency of Results in Logic and Mathematics.- What is a Profound Result in Mathematics?.- The Hylemorphic Schema in Mathematics.- Foundational Approaches.- Categorical Foundations of the Protean Character of Mathematics.- Category Theory and Structuralism in Mathematics: Syntactical Considerations.- Reflection in Set Theory. The Bernays-Levy Axiom System.- Structuralism and the Concept of Set.- Aspects of Mathematical Experience.- Logicism Revisited in the Propositional Fragment of Le?niewski’s Ontology.- The Applicability of Mathematics.- The Relation of Mathematics to the Other Sciences.- Mathematics and Physics.- The Mathematical Overdetermination of Physics.- Gödel’s Incompleteness Theorem and Quantum Thermodynamic Limits.- Mathematical Models in Biology.- The Natural Numbers as a Universal Library.- Mathematical Symmetry Principles in the Scientific World View.- Historical Considerations.- Mathematics and Logics. Hungarian Traditions and the Philosophy of Non-Classical Logic.- Umfangslogik, Inhaltslogik, Theorematic Reasoning.

Read more less

Book SynopsisMathematical Logic: An Introduction is a textbook that uses mathematical tools to investigate mathematics itself. In particular, the concepts of proof and truth are examined. The book presents the fundamental topics in mathematical logic and presents clear and complete proofs throughout the text. Such proofs are used to develop the language of propositional logic and the language of first-order logic, including the notion of a formal deduction. The text also covers Tarski’s definition of truth and the computability concept. It also provides coherent proofs of Godel’s completeness and incompleteness theorems. Moreover, the text was written with the student in mind and thus, it provides an accessible introduction to mathematical logic. In particular, the text explicitly shows the reader how to prove the basic theorems and presents detailed proofs throughout the book. Most undergraduate books on mathematical logic are written for a reader who is well-versed in logical notation and mathematical proof. This textbook is written to attract a wider audience, including students who are not yet experts in the art of mathematical proof.

Read more less

Book SynopsisThis book is the first modern introduction to the logic of infinitary languages in forty years, and is aimed at graduate students and researchers in all areas of mathematical logic. Connections between infinitary model theory and other branches of mathematical logic, and applications to algebra and algebraic geometry are both comprehensively explored.Table of ContentsIntroduction; Part I. Classical Results in Infinitary Model Theory: 1. Infinitary languages; 2. Back and forth; 3. The space of countable models; 4. The model existence theorem; 5. Hanf numbers and indiscernibles; Part II. Building Uncountable Models: 6. Elementary chains; 7. Vaught counterexamples; 8. Quasinimal excellence; Part III. Effective Considerations: 9. Effective descriptive set theory; 10. Hyperarithmetic sets; 11. Effective aspects of Lω1,ω; 12. Spectra of Vaught counterexamples; Appendix A. N1-free abelian groups; Appendix B. Admissibility; References; Index.

Read more less