On the Finitizability Problem in Algebraic Logic; Recent Results

Total Page:16

File Type:pdf, Size:1020Kb

On the Finitizability Problem in Algebraic Logic; Recent Results The Finitizability Problem in Algebraic Logic, recent results and developments: From neat embeddings to Erdos’ graphs Tarek Sayed Ahmed Department of Mathematics, Faculty of Science, Cairo University, Giza, Egypt. October 8, 2018 Abstract . This is an article on the so-called Finitizability Problem in Algebraic Logic. We take a magical tour from the early works of Tarski on relation algebras in the forties all the way to neat embeddings and recent resuts in algebraic logic using Erdos probabilistic graphs. Several deep theorems proved for cylindric algebras are surveyed refined and slightly generalized to other algebraisations of first order logic, like polyadic algebras and diagonal free cylindric algebras. A hitherto unpublished presentation of this problem in a categorial setting is presented. Techniques from stability theory are applied to representation problems in algebraic logic. Philosoph- ical implications are extensively discussed. 1 Algebraic logic starts from certain special logical considerations, abstracts from them, places them in a general algebraic context and via this generaliza- arXiv:1302.1368v1 [math.LO] 6 Feb 2013 tion makes contact with other branches of mathematics (like set theory and topology). It cannot be overemphasized that algebraic logic is more algebra than logic, nor more logic than algebra; in this paper we argue that algebraic logic, particularly the theory of cylindric algebras, has become sufficiently in- teresting and deep to acquire a distinguished status among other subdisciplines of mathematical logic. The principal ideas of the theory of cylindric algebras which is the algebraic setting of first order logic were elaborated by Tarski in cooperation with his students L. H. Chin and F. B. Thompson during the period 1948 - 1952. This was a natural outcome of Tarski’s formalization of the notion of truth in set theory, for indeed the prime examples of cylindric algebras are those algebras whose elements are sets of sequences (i.e., relations) satisfying first 1 2000 Mathematics Subject Classification. Primary 03G15. Key words: algebraic logic, polyadic algebras, amalgamation 1 order formulas. Tarski envisaged that cylindric algebras to first order logic, will be like Boolean algebras to sentential logic. The idea of solving problems in logic by first translating them to algebra, then using the powerful methodology of algebra for solving them, and then translating the solution back to logic, goes back to Leibnitz and Pascal. Pa- pers on the history of Logic (e.g., Anellis - Houser [2], Maddux [78]) allert us to the fact that this method was fruitfully applied in the 19th century with the work of Boole, De Morgan, Peirce, Schr¨oder, etc., on classical logic, see [2]. Employing the similarity between logical equivalence and equality, those pioneers developed logical systems in which metalogical investigations take on a plainly algebraic character. Boole’s work evolved into the modern theory of Boolean algebras, and that of De Morgan, Peirce and Schr¨oder led to but did not end with the theory of relation algebras. From the beginning of the con- temporary era of logic there were two approaches to the subject, one centered on the notion of logical equivalence and the other, reinforced by Hilbert’s work on metamathematics, centered on the notions of assertion and inference. It was not until much later that logicians started to think about connections between these two ways of looking at logic. Tarski [178] gave the precise connection be- tween Boolean algebra and the classical propositional calculus. His approach builds on Lindenbaum’s idea of viewing the set of formulas as an algebra with operations induced by the logical connectives. Logical equivalence is a congru- ence relation on the formula algebra. This is the so-called Lindenbaum-Tarski method. When Tarski applied the this method to the predicate calculus, it led him naturally to the concept of cylindric algebras. Also, we can see that traditionally algebraic logic has focused on the al- gebraic investigation of particular classes of algebras of logic, whether or not they could be connected to some known assertional system by means of the Lindenbaum- Tarski method. However, when such a connection could be es- tablished, there was interest in investigating the relationship between various metalogical properties of the logistic system and the algebraic properties of the associated class of algebras (obtaining what are sometimes called ”bridge theorems”). For example, it was discovered that there is a natural relation between the interpolation theorems of classical, intuitionistic, intermediate propositional calculi, and the amalgamation properties of varieties of Heyting algebras. Similar connections were investigated between interpolation theo- rems in the predicate calculus and amalgamation results in varieties of cylindric and polyadic algebras. Henkin began working with Tarski on the subject of cylindric algebras in the fifties, and a report of their joint research appeared in 1961. By then Monk had also made substantial contributions to the theory. The three planned to write a comprehensive two-volume treatise on the theory of cylindric algebras. The first volume treated cylindric algebras from a general algebraic point of 2 view, while the second volume contained other topics, such as the representa- tion theory, to which Andr´eka and N´emeti contributed a lot, and connections between cylindric algebras and logic. We can find that the theory of cylindric algebras is explicated primarily in three substantial monographs : Henkin, Monk and Tarski [36], [37], and Henkin, Monk, Tarski, Andreka and Nemeti [38]. This covers the development of the subject till the mid eightees of the last century. This paper surveys and refines later developments of the subject. Highlighting the connections with graph theory, model theory, set theory, fi- nite combinatorics, the paper presents topics of broad interest in a way that is accessible to a large audience. The paper is not only purely expository, for it contains, in addition, new ideas and results and also new approaches to old ones. We hope that this paper also provides rapid dissemination of the latest research in the field. A cylindric algebra consists of a Boolean algebra endowed with an addi- tional structure consisting of distinguished elements and operations, satisfying a certain system of equational axioms. The introduction and study of these algebras has its motivation in two parts of mathematics: the deductive systems of first-order logic, and a portion of elementary set theory dealing with spaces of various dimensions, better known as cylindric set algebras. Cylindric set algebras are algebras whose elements are relations of a cer tain pre-assigned arity, endowed with set-theoretic operations that utilize the form of elements of the algebra as sets of sequences. Our notation is in con- formity with the monograph [36], [37]. B(X) denotes the boolean set algebra (℘(X), ∪, ∩, ∼, ∅,X). Let U be a set and α an ordinal. α will be the dimen- α sion of the algebra. For s, t ∈ U write s ≡i t if s(j) = t(j) for all j =6 i. For X ⊆ αU and i, j < α, let α CiX = {s ∈ U : ∃t ∈ X(t ≡i s)} and α Dij = {s ∈ U : si = sj}. α (B( U), Ci, Dij)i,j<α is called the full cylindric set algebra of dimension α with unit (or greatest element) αU. Examples of subalgebras of such set algebras arise naturally from models of first order theories. Indeed if M is a first order structure in a first order language L with α many variables, then one manufactures a cylindric set algebra based on M as follows. Let φM = {s ∈ αM : M |= φ[s]}, (here M |= φ[s] means that s satisfies φ in M), then the set {φM : φ ∈ F mL} is a cylindric set algebra of dimension α. Indeed φM ∩ ψM =(φ ∧ ψ)M, 3 and αM ∼ φM =(¬φ)M, M M Ci(φ )= ∃viφ , and finally M Dij =(xi = xj) . Csα denotes the class of all subalgebras of full set algebras of dimension α. CAα stands for the class of cylindric algebras of dimension α. This is obtained from cylindric set algebras by a process of abstraction and is defned bya finite schema of equations that hold of course in the more concrete set algebra. Definition 0.1. By a cylindric algebra of dimension α, briefly a CAα, we mean an algebra A =(A, +, ·, −, 0, 1, ci, dij)κ,λ<α where (A, +, ·, −, 0, 1) is a boolean algebra such that 0, 1, and dij are distin- guished elements of A (for all j,i < α), − and ci are unary operations on A (for all i<α), + and . are binary operations on A, and such that the following postulates are satisfies for any x, y ∈ A and any i,j,µ <α: (C1) ci0 = 0, (C2) x ≤ cix (i.e., x + cix = cix), (C3) ci(x · ciy)= cix · ciy, (C4) cicjx = cjcix, (C5) dii = 1, (C6) if i =6 j, µ, then djµ = ci(dji · diµ), (C7) if i =6 j, then ci(dij · x) · ci(dij · −x) = 0. A ∈ CAω is locally finite, if the dimension set of every element x ∈ A is finite. The dimension set of x, or ∆x for short, is the set {i ∈ ω : cix =6 x}. Tarski proved that every locally finite ω-dimensional cylindric algebra is rep- resentable, i.e. isomorphic to a subdirect product of set algebra each of di- mension ω. Let Lf ω denote the class of locally finite cylindric algebras. Let RCAω stand for the class of isomorphic copies of subdirect products of set al- gebras each of dimension ω, or briefly, the class of ω dimensional representable cylindric algebras. Then Tarski’s theorem reads Lf ω ⊆ RCAω. This repre- sentation theorem is non-trivial; in fact it is equivalent to G¨odel’s celebrated Completeness Theorem [37, §4.3].
Recommended publications
  • EM-Training for Weighted Aligned Hypergraph Bimorphisms
    EM-Training for Weighted Aligned Hypergraph Bimorphisms Frank Drewes Kilian Gebhardt and Heiko Vogler Department of Computing Science Department of Computer Science Umea˚ University Technische Universitat¨ Dresden S-901 87 Umea,˚ Sweden D-01062 Dresden, Germany [email protected] [email protected] [email protected] Abstract malized by the new concept of hybrid grammar. Much as in the mentioned synchronous grammars, We develop the concept of weighted a hybrid grammar synchronizes the derivations aligned hypergraph bimorphism where the of nonterminals of a string grammar, e.g., a lin- weights may, in particular, represent proba- ear context-free rewriting system (LCFRS) (Vijay- bilities. Such a bimorphism consists of an Shanker et al., 1987), and of nonterminals of a R 0-weighted regular tree grammar, two ≥ tree grammar, e.g., regular tree grammar (Brainerd, hypergraph algebras that interpret the gen- 1969) or simple definite-clause programs (sDCP) erated trees, and a family of alignments (Deransart and Małuszynski, 1985). Additionally it between the two interpretations. Seman- synchronizes terminal symbols, thereby establish- tically, this yields a set of bihypergraphs ing an explicit alignment between the positions of each consisting of two hypergraphs and the string and the nodes of the tree. We note that an explicit alignment between them; e.g., LCFRS/sDCP hybrid grammars can also generate discontinuous phrase structures and non- non-projective dependency structures. projective dependency structures are bihy- In this paper we focus on the task of training an pergraphs. We present an EM-training al- LCFRS/sDCP hybrid grammar, that is, assigning gorithm which takes a corpus of bihyper- probabilities to its rules given a corpus of discon- graphs and an aligned hypergraph bimor- tinuous phrase structures or non-projective depen- phism as input and generates a sequence dency structures.
    [Show full text]
  • Sketch Notes — Rings and Fields
    Sketch Notes — Rings and Fields Neil Donaldson Fall 2018 Text • An Introduction to Abstract Algebra, John Fraleigh, 7th Ed 2003, Adison–Wesley (optional). Brief reminder of groups You should be familiar with the majority of what follows though there is a lot of time to remind yourself of the harder material! Try to complete the proofs of any results yourself. Definition. A binary structure (G, ·) is a set G together with a function · : G × G ! G. We say that G is closed under · and typically write · as juxtaposition.1 A semigroup is an associative binary structure: 8x, y, z 2 G, x(yz) = (xy)z A monoid is a semigroup with an identity element: 9e 2 G such that 8x 2 G, ex = xe = x A group is a monoid in which every element has an inverse: 8x 2 G, 9x−1 2 G such that xx−1 = x−1x = e A binary structure is commutative if 8x, y 2 G, xy = yx. A group with a commutative structure is termed abelian. A subgroup2 is a non-empty subset H ⊆ G which remains a group under the same binary operation. We write H ≤ G. Lemma. H is a subgroup of G if and only if it is a non-empty subset of G closed under multiplication and inverses in G. Standard examples of groups: sets of numbers under addition (Z, Q, R, nZ, etc.), matrix groups. Standard families: cyclic, symmetric, alternating, dihedral. 1You should be comfortable with both multiplicative and additive notation. 2More generally any substructure. 1 Cosets and Factor Groups Definition.
    [Show full text]
  • A Formalization of Logic in Diagonal-Free Cylindric Algebras Andrew John Ylvisaker Iowa State University
    Iowa State University Capstones, Theses and Graduate Theses and Dissertations Dissertations 2012 A formalization of logic in diagonal-free cylindric algebras Andrew John Ylvisaker Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/etd Part of the Mathematics Commons Recommended Citation Ylvisaker, Andrew John, "A formalization of logic in diagonal-free cylindric algebras" (2012). Graduate Theses and Dissertations. 12536. https://lib.dr.iastate.edu/etd/12536 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Graduate Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. A formalization of logic in diagonal-free cylindric algebras by Andrew John Ylvisaker A dissertation submitted to the graduate faculty in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Major: Mathematics Program of Study Committee: Roger D. Maddux, Major Professor Maria Axenovich Cliff Bergman Bill Robinson Paul Sacks Iowa State University Ames, Iowa 2012 Copyright c Andrew John Ylvisaker, 2012. All rights reserved. ii TABLE OF CONTENTS LIST OF TABLES . iii LIST OF FIGURES . iv CHAPTER 1. BACKGROUND MATERIAL . 1 1.1 Introduction . .1 1.2 First-order logic . .4 1.3 General algebra and Boolean algebras with operators . .6 1.4 Relation algebras . 11 1.5 Cylindric algebras . 17 CHAPTER 2. RELATION ALGEBRAIC REDUCTS . 21 2.1 Definitions . 21 2.2 Preliminary lemmas . 27 + 2.3 Q RA reducts in Df3 .....................................
    [Show full text]
  • Domain Theory and the Logic of Observable Properties
    Domain Theory and the Logic of Observable Properties Samson Abramsky Submitted for the degree of Doctor of Philosophy Queen Mary College University of London October 31st 1987 Abstract The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and systems behaviour developed by Milner, Hennessy et al. based on operational semantics. • Logics of programs. Stone duality provides a junction between semantics (spaces of points = denotations of computational processes) and logics (lattices of properties of processes). Moreover, the underlying logic is geometric, which can be com- putationally interpreted as the logic of observable properties—i.e. properties which can be determined to hold of a process on the basis of a finite amount of information about its execution. These ideas lead to the following programme: 1. A metalanguage is introduced, comprising • types = universes of discourse for various computational situa- tions. • terms = programs = syntactic intensions for models or points. 2. A standard denotational interpretation of the metalanguage is given, assigning domains to types and domain elements to terms. 3. The metalanguage is also given a logical interpretation, in which types are interpreted as propositional theories and terms are interpreted via a program logic, which axiomatizes the properties they satisfy. 2 4. The two interpretations are related by showing that they are Stone duals of each other. Hence, semantics and logic are guaranteed to be in harmony with each other, and in fact each determines the other up to isomorphism.
    [Show full text]
  • Weak Representation Theory in the Calculus of Relations Jeremy F
    Iowa State University Capstones, Theses and Retrospective Theses and Dissertations Dissertations 2006 Weak representation theory in the calculus of relations Jeremy F. Alm Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/rtd Part of the Mathematics Commons Recommended Citation Alm, Jeremy F., "Weak representation theory in the calculus of relations " (2006). Retrospective Theses and Dissertations. 1795. https://lib.dr.iastate.edu/rtd/1795 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Retrospective Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. Weak representation theory in the calculus of relations by Jeremy F. Aim A dissertation submitted to the graduate faculty in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Major: Mathematics Program of Study Committee: Roger Maddux, Major Professor Maria Axenovich Paul Sacks Jonathan Smith William Robinson Iowa State University Ames, Iowa 2006 Copyright © Jeremy F. Aim, 2006. All rights reserved. UMI Number: 3217250 INFORMATION TO USERS The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleed-through, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion.
    [Show full text]
  • Algebraic Implementation of Abstract Data Types*
    Theoretical Computer Science 20 (1982) 209-263 209 North-Holland Publishing Company ALGEBRAIC IMPLEMENTATION OF ABSTRACT DATA TYPES* H. EHRIG, H.-J. KREOWSKI, B. MAHR and P. PADAWITZ Fachbereich Informatik, TV Berlin, 1000 Berlin 10, Fed. Rep. Germany Communicated by M. Nivat Received October 1981 Abstract. Starting with a review of the theory of algebraic specifications in the sense of the ADJ-group a new theory for algebraic implementations of abstract data types is presented. While main concepts of this new theory were given already at several conferences this paper provides the full theory of algebraic implementations developed in Berlin except of complexity considerations which are given in a separate paper. The new concept of algebraic implementations includes implementations for algorithms in specific programming languages and on the other hand it meets also the requirements for stepwise refinement of structured programs and software systems as introduced by Dijkstra and Wirth. On the syntactical level an algebraic implementation corresponds to a system of recursive programs while the semantical level is defined by algebraic constructions, called SYNTHESIS, RESTRICTION and IDENTIFICATION. Moreover the concept allows composition of implementations and a rigorous study of correctness. The main results of the paper are different kinds of correctness criteria which are applied to a number of illustrating examples including the implementation of sets by hash-tables. Algebraic implementations of larger systems like a histogram or a parts system are given in separate case studies which, however, are not included in this paper. 1. Introduction The concept of abstract data types was developed since about ten years starting with the debacles of large software systems in the late 60's.
    [Show full text]
  • What Is Abstract Algebraic Logic?
    What is Abstract Algebraic Logic? Umberto Rivieccio University of Genoa Department of Philosophy Via Balbi 4 - Genoa, Italy email [email protected] Abstract Our aim is to answer the question of the title, explaining which kind of problems form the nucleus of the branch of algebraic logic that has come to be known as Abstract Algebraic Logic. We give a concise account of the birth and evolution of the field, that led from the discovery of the connections between certain logical systems and certain algebraic structures to a general theory of algebraization of logics. We consider first the so-called algebraizable logics, which may be regarded as a paradigmatic case in Abstract Algebraic Logic; then we shift our attention to some wider classes of logics and to the more general framework in which they are studied. Finally, we review some other topics in Abstract Algebraic Logic that, though equally interesting and promising for future research, could not be treated here in detail. 1 Introduction Algebraic logic can be described in very general terms as the study of the relations between algebra and logic. One of the main reasons that motivate such a study is the possibility to treat logical problems with algebraic methods. This means that, in order to solve a logical problem, we may try to translate it into algebraic terms, find the solution using algebraic techniques, and then translate back the result into logic. This strategy proved to be fruitful, since algebra is an old and well{established field of mathematics, that offers powerful tools to treat problems that would possibly be much harder to solve using the logical machinery alone.
    [Show full text]
  • Categories of Coalgebras with Monadic Homomorphisms Wolfram Kahl
    Categories of Coalgebras with Monadic Homomorphisms Wolfram Kahl To cite this version: Wolfram Kahl. Categories of Coalgebras with Monadic Homomorphisms. 12th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2014, Grenoble, France. pp.151-167, 10.1007/978-3-662-44124-4_9. hal-01408758 HAL Id: hal-01408758 https://hal.inria.fr/hal-01408758 Submitted on 5 Dec 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Distributed under a Creative Commons Attribution| 4.0 International License Categories of Coalgebras with Monadic Homomorphisms Wolfram Kahl McMaster University, Hamilton, Ontario, Canada, [email protected] Abstract. Abstract graph transformation approaches traditionally con- sider graph structures as algebras over signatures where all function sym- bols are unary. Attributed graphs, with attributes taken from (term) algebras over ar- bitrary signatures do not fit directly into this kind of transformation ap- proach, since algebras containing function symbols taking two or more arguments do not allow component-wise construction of pushouts. We show how shifting from the algebraic view to a coalgebraic view of graph structures opens up additional flexibility, and enables treat- ing term algebras over arbitrary signatures in essentially the same way as unstructured label sets.
    [Show full text]
  • Problems from Ring Theory
    Home Page Problems From Ring Theory In the problems below, Z, Q, R, and C denote respectively the rings of integers, JJ II rational numbers, real numbers, and complex numbers. R generally denotes a ring, and I and J usually denote ideals. R[x],R[x, y],... denote rings of polynomials. rad R is defined to be {r ∈ R : rn = 0 for some positive integer n} , where R is a ring; rad R is called the nil radical or just the radical of R . J I Problem 0. Let b be a nilpotent element of the ring R . Prove that 1 + b is an invertible element Page 1 of 14 of R . Problem 1. Let R be a ring with more than one element such that aR = R for every nonzero Go Back element a ∈ R. Prove that R is a division ring. Problem 2. If (m, n) = 1 , show that the ring Z/(mn) contains at least two idempotents other than Full Screen the zero and the unit. Problem 3. If a and b are elements of a commutative ring with identity such that a is invertible Print and b is nilpotent, then a + b is invertible. Problem 4. Let R be a ring which has no nonzero nilpotent elements. Prove that every idempotent Close element of R commutes with every element of R. Quit Home Page Problem 5. Let A be a division ring, B be a proper subring of A such that a−1Ba ⊆ B for all a 6= 0 . Prove that B is contained in the center of A .
    [Show full text]
  • On Semilattice Structure of Mizar Types
    FORMALIZED MATHEMATICS Volume 11, Number 4, 2003 University of Białystok On Semilattice Structure of Mizar Types Grzegorz Bancerek Białystok Technical University Summary. The aim of this paper is to develop a formal theory of Mizar types. The presented theory is an approach to the structure of Mizar types as a sup-semilattice with widening (subtyping) relation as the order. It is an abstrac- tion from the existing implementation of the Mizar verifier and formalization of the ideas from [9]. MML Identifier: ABCMIZ 0. The articles [20], [14], [24], [26], [23], [25], [3], [21], [1], [11], [12], [16], [10], [13], [18], [15], [4], [2], [19], [22], [5], [6], [7], [8], and [17] provide the terminology and notation for this paper. 1. Semilattice of Widening Let us mention that every non empty relational structure which is trivial and reflexive is also complete. Let T be a relational structure. A type of T is an element of T . Let T be a relational structure. We say that T is Noetherian if and only if: (Def. 1) The internal relation of T is reversely well founded. Let us observe that every non empty relational structure which is trivial is also Noetherian. Let T be a non empty relational structure. Let us observe that T is Noethe- rian if and only if the condition (Def. 2) is satisfied. (Def. 2) Let A be a non empty subset of T . Then there exists an element a of T such that a ∈ A and for every element b of T such that b ∈ A holds a 6< b.
    [Show full text]
  • Math 250A: Groups, Rings, and Fields. H. W. Lenstra Jr. 1. Prerequisites
    Math 250A: Groups, rings, and fields. H. W. Lenstra jr. 1. Prerequisites This section consists of an enumeration of terms from elementary set theory and algebra. You are supposed to be familiar with their definitions and basic properties. Set theory. Sets, subsets, the empty set , operations on sets (union, intersection, ; product), maps, composition of maps, injective maps, surjective maps, bijective maps, the identity map 1X of a set X, inverses of maps. Relations, equivalence relations, equivalence classes, partial and total orderings, the cardinality #X of a set X. The principle of math- ematical induction. Zorn's lemma will be assumed in a number of exercises. Later in the course the terminology and a few basic results from point set topology may come in useful. Group theory. Groups, multiplicative and additive notation, the unit element 1 (or the zero element 0), abelian groups, cyclic groups, the order of a group or of an element, Fermat's little theorem, products of groups, subgroups, generators for subgroups, left cosets aH, right cosets, the coset spaces G=H and H G, the index (G : H), the theorem of n Lagrange, group homomorphisms, isomorphisms, automorphisms, normal subgroups, the factor group G=N and the canonical map G G=N, homomorphism theorems, the Jordan- ! H¨older theorem (see Exercise 1.4), the commutator subgroup [G; G], the center Z(G) (see Exercise 1.12), the group Aut G of automorphisms of G, inner automorphisms. Examples of groups: the group Sym X of permutations of a set X, the symmetric group S = Sym 1; 2; : : : ; n , cycles of permutations, even and odd permutations, the alternating n f g group A , the dihedral group D = (1 2 : : : n); (1 n 1)(2 n 2) : : : , the Klein four group n n h − − i V , the quaternion group Q = 1; i; j; ij (with ii = jj = 1, ji = ij) of order 4 8 { g − − 8, additive groups of rings, the group Gl(n; R) of invertible n n-matrices over a ring R.
    [Show full text]
  • Explanations
    © Copyright, Princeton University Press. No part of this book may be distributed, posted, or reproduced in any form by digital or mechanical means without prior written permission of the publisher. CHAPTER 1 Explanations 1.1 SALLIES Language is an instrument of Logic, but not an indispensable instrument. Boole 1847a, 118 We know that mathematicians care no more for logic than logicians for mathematics. The two eyes of exact science are mathematics and logic; the mathematical sect puts out the logical eye, the logical sect puts out the mathematical eye; each believing that it sees better with one eye than with two. De Morgan 1868a,71 That which is provable, ought not to be believed in science without proof. Dedekind 1888a, preface If I compare arithmetic with a tree that unfolds upwards in a multitude of techniques and theorems whilst the root drives into the depthswx . Frege 1893a, xiii Arithmetic must be discovered in just the same sense in which Columbus discovered the West Indies, and we no more create numbers than he created the Indians. Russell 1903a, 451 1.2 SCOPE AND LIMITS OF THE BOOK 1.2.1 An outline history. The story told here from §3 onwards is re- garded as well known. It begins with the emergence of set theory in the 1870s under the inspiration of Georg Cantor, and the contemporary development of mathematical logic by Gottlob Frege andŽ. especially Giuseppe Peano. A cumulation of these and some related movements was achieved in the 1900s with the philosophy of mathematics proposed by Alfred North Whitehead and Bertrand Russell.
    [Show full text]