DOCSLIB.ORG

The Logic of Comparative Cardinality

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Logic of Comparative Cardinality The Logic of Comparative Cardinality Yifeng Ding (voidprove.com) Joint work with Matthew Harrison-Trainer and Wesley Holliday Aug. 7, 2018 @ BLAST 2018 UC Berkeley Group of Logic and the Methodology of Science Introduction • The equational theory of Boolean algebras is also the equational theory of fields of sets, if we only care about Boolean operations. • But more information can be extracted from a field of sets. • We compare their sizes. A field of sets Definition A field of sets (X ; F) is a pair where 1. X is a set and F ⊆ }(X ); 2. F is closed under intersection and complementation. 1 • But more information can be extracted from a field of sets. • We compare their sizes. A field of sets Definition A field of sets (X ; F) is a pair where 1. X is a set and F ⊆ }(X ); 2. F is closed under intersection and complementation. • The equational theory of Boolean algebras is also the equational theory of fields of sets, if we only care about Boolean operations. 1 • We compare their sizes. A field of sets Definition A field of sets (X ; F) is a pair where 1. X is a set and F ⊆ }(X ); 2. F is closed under intersection and complementation. • The equational theory of Boolean algebras is also the equational theory of fields of sets, if we only care about Boolean operations. • But more information can be extracted from a field of sets. 1 A field of sets Definition A field of sets (X ; F) is a pair where 1. X is a set and F ⊆ }(X ); 2. F is closed under intersection and complementation. • The equational theory of Boolean algebras is also the equational theory of fields of sets, if we only care about Boolean operations. • But more information can be extracted from a field of sets. • We compare their sizes. 1 • A field of sets model is hX ; F; V i where V :Φ !F. • Terms are evaluated by Vb on F in the obvious way. •j sj ≥ jtj: set s is at least as large as set t: there is an injection from Vb(t) to Vb(s). Comparing the sizes Definition Given a countably infinite set Φ of set labels, the language L is generated by the following grammar: t ::= a j tc j (t \ t) ' ::= jtj ≥ jtj j :' j (' ^ '); 2 • Terms are evaluated by Vb on F in the obvious way. •j sj ≥ jtj: set s is at least as large as set t: there is an injection from Vb(t) to Vb(s). Comparing the sizes Definition Given a countably infinite set Φ of set labels, the language L is generated by the following grammar: t ::= a j tc j (t \ t) ' ::= jtj ≥ jtj j :' j (' ^ '); • A field of sets model is hX ; F; V i where V :Φ !F. 2 •j sj ≥ jtj: set s is at least as large as set t: there is an injection from Vb(t) to Vb(s). Comparing the sizes Definition Given a countably infinite set Φ of set labels, the language L is generated by the following grammar: t ::= a j tc j (t \ t) ' ::= jtj ≥ jtj j :' j (' ^ '); • A field of sets model is hX ; F; V i where V :Φ !F. • Terms are evaluated by Vb on F in the obvious way. 2 Comparing the sizes Definition Given a countably infinite set Φ of set labels, the language L is generated by the following grammar: t ::= a j tc j (t \ t) ' ::= jtj ≥ jtj j :' j (' ^ '); • A field of sets model is hX ; F; V i where V :Φ !F. • Terms are evaluated by Vb on F in the obvious way. •j sj ≥ jtj: set s is at least as large as set t: there is an injection from Vb(t) to Vb(s). 2 s t • • For finite sets s; t, jsj ≥ jtj $ js \ tc j ≥ jt \ sc j. • For infinite sets s; t; u •j sj ≥ jtj ! js \ tc j ≥ jt \ sc j is not valid; • (jsj ≥ jtj ^ jsj ≥ juj) ! jsj ≥ jt [ uj is valid. Finite sets and infinite sets • Finite sets and infinite sets obey very different laws. 3 Finite sets and infinite sets • Finite sets and infinite sets obey very different laws. s t • • For finite sets s; t, jsj ≥ jtj $ js \ tc j ≥ jt \ sc j. • For infinite sets s; t; u •j sj ≥ jtj ! js \ tc j ≥ jt \ sc j is not valid; • (jsj ≥ jtj ^ jsj ≥ juj) ! jsj ≥ jt [ uj is valid. 3 • The sentences in L valid on infinite sets have been axiomatized, with size interpreted as likelihood or possibilities. • We want to combine them: with no extra constraint on (X ; F), what is the logic? More background • The sentences in L valid on finite sets have been axiomatized, with size interpreted as probability, credence, etc.. 4 • We want to combine them: with no extra constraint on (X ; F), what is the logic? More background • The sentences in L valid on finite sets have been axiomatized, with size interpreted as probability, credence, etc.. • The sentences in L valid on infinite sets have been axiomatized, with size interpreted as likelihood or possibilities. 4 More background • The sentences in L valid on finite sets have been axiomatized, with size interpreted as probability, credence, etc.. • The sentences in L valid on infinite sets have been axiomatized, with size interpreted as likelihood or possibilities. • We want to combine them: with no extra constraint on (X ; F), what is the logic? 4 Outline Introduction Laws common to finite and infinite sets A representation theorem Logic with predicates for finite and infinite sets Eliminating extra predicates Further questions 5 Laws common to finite and infinite sets • if t = 0 is provable in the equational theory of Boolean algebras, then j?j ≥ jtj is a theorem. •j sj ≥ jtj _ jtj ≥ jsj;(jsj ≥ jtj ^ jtj ≥ juj) ! jsj ≥ juj; c •j ?j ≥ js \ t j ! jtj ≥ jsj; c •:j ?j ≥ j? j; • (j?j ≥ jsj ^ j?j ≥ jtj) ! j?j ≥ js [ tj; BasicCompLogic Definition (BasicCompLogic) Boolean reasoning on the sentence level. Boolean Reasoning on the set level. ≥ is a total preorder extending ⊇. ≥ works well with ?. 6 • if t = 0 is provable in the equational theory of Boolean algebras, then j?j ≥ jtj is a theorem. •j sj ≥ jtj _ jtj ≥ jsj;(jsj ≥ jtj ^ jtj ≥ juj) ! jsj ≥ juj; c •j ?j ≥ js \ t j ! jtj ≥ jsj; c •:j ?j ≥ j? j; • (j?j ≥ jsj ^ j?j ≥ jtj) ! j?j ≥ js [ tj; BasicCompLogic Definition (BasicCompLogic) Boolean reasoning on the sentence level. Boolean Reasoning on the set level. ≥ is a total preorder extending ⊇. ≥ works well with ?. 6 •j sj ≥ jtj _ jtj ≥ jsj;(jsj ≥ jtj ^ jtj ≥ juj) ! jsj ≥ juj; c •j ?j ≥ js \ t j ! jtj ≥ jsj; c •:j ?j ≥ j? j; • (j?j ≥ jsj ^ j?j ≥ jtj) ! j?j ≥ js [ tj; BasicCompLogic Definition (BasicCompLogic) Boolean reasoning on the sentence level. Boolean Reasoning on the set level. • if t = 0 is provable in the equational theory of Boolean algebras, then j?j ≥ jtj is a theorem. ≥ is a total preorder extending ⊇. ≥ works well with ?. 6 c •:j ?j ≥ j? j; • (j?j ≥ jsj ^ j?j ≥ jtj) ! j?j ≥ js [ tj; BasicCompLogic Definition (BasicCompLogic) Boolean reasoning on the sentence level. Boolean Reasoning on the set level. • if t = 0 is provable in the equational theory of Boolean algebras, then j?j ≥ jtj is a theorem. ≥ is a total preorder extending ⊇. •j sj ≥ jtj _ jtj ≥ jsj;(jsj ≥ jtj ^ jtj ≥ juj) ! jsj ≥ juj; c •j ?j ≥ js \ t j ! jtj ≥ jsj; ≥ works well with ?. 6 BasicCompLogic Definition (BasicCompLogic) Boolean reasoning on the sentence level. Boolean Reasoning on the set level. • if t = 0 is provable in the equational theory of Boolean algebras, then j?j ≥ jtj is a theorem. ≥ is a total preorder extending ⊇. •j sj ≥ jtj _ jtj ≥ jsj;(jsj ≥ jtj ^ jtj ≥ juj) ! jsj ≥ juj; c •j ?j ≥ js \ t j ! jtj ≥ jsj; ≥ works well with ?. c •:j ?j ≥ j? j; • (j?j ≥ jsj ^ j?j ≥ jtj) ! j?j ≥ js [ tj; 6 Any formula ' consistent with BasicCompLogic is satisfiable in a finite comparison algebra, with interpreting j · j ≥ j · j. ' ) Σ ) hB; ; V i ) h V (T (var('))) ; ; V i | {z } relevant terms, a finite set 6) hX ; F; V i From logic to algebra Definition A comparison algebra is a pair hB; i where B is a Boolean algebra and is a total preorder on B such that • for all a; b 2 B, a ≥B b implies a b, •? B 6 b for all b 2 B n f?B g. 7 6) hX ; F; V i From logic to algebra Definition A comparison algebra is a pair hB; i where B is a Boolean algebra and is a total preorder on B such that • for all a; b 2 B, a ≥B b implies a b, •? B 6 b for all b 2 B n f?B g. Any formula ' consistent with BasicCompLogic is satisfiable in a finite comparison algebra, with interpreting j · j ≥ j · j. ' ) Σ ) hB; ; V i ) h V (T (var('))) ; ; V i | {z } relevant terms, a finite set 7 From logic to algebra Definition A comparison algebra is a pair hB; i where B is a Boolean algebra and is a total preorder on B such that • for all a; b 2 B, a ≥B b implies a b, •? B 6 b for all b 2 B n f?B g. Any formula ' consistent with BasicCompLogic is satisfiable in a finite comparison algebra, with interpreting j · j ≥ j · j. ' ) Σ ) hB; ; V i ) h V (T (var('))) ; ; V i | {z } relevant terms, a finite set 6) hX ; F; V i 7 • (010) and (100) should be finite.
Load more

Recommended publications
  • Dynamic Algebras: Examples, Constructions, Applications
    Dynamic Algebras: Examples, Constructions, Applications Vaughan Pratt∗ Dept. of Computer Science, Stanford, CA 94305 Abstract Dynamic algebras combine the classes of Boolean (B ∨ 0 0) and regu- lar (R ∪ ; ∗) algebras into a single finitely axiomatized variety (BR 3) resembling an R-module with “scalar” multiplication 3. The basic result is that ∗ is reflexive transitive closure, contrary to the intuition that this concept should require quantifiers for its definition. Using this result we give several examples of dynamic algebras arising naturally in connection with additive functions, binary relations, state trajectories, languages, and flowcharts. The main result is that free dynamic algebras are residu- ally finite (i.e. factor as a subdirect product of finite dynamic algebras), important because finite separable dynamic algebras are isomorphic to Kripke structures. Applications include a new completeness proof for the Segerberg axiomatization of propositional dynamic logic, and yet another notion of regular algebra. Key words: Dynamic algebra, logic, program verification, regular algebra. This paper originally appeared as Technical Memo #138, Laboratory for Computer Science, MIT, July 1979, and was subsequently revised, shortened, retitled, and published as [Pra80b]. After more than a decade of armtwisting I. N´emeti and H. Andr´eka finally persuaded the author to publish TM#138 itself on the ground that it contained a substantial body of interesting material that for the sake of brevity had been deleted from the STOC-80 version. The principal changes here to TM#138 are the addition of footnotes and the sections at the end on retrospective citations and reflections. ∗This research was supported by the National Science Foundation under NSF grant no.
    [Show full text]
  • On Families of Mutually Exclusive Sets
    ANNALS OF MATHEMATICS Vol. 44, No . 2, April, 1943 ON FAMILIES OF MUTUALLY EXCLUSIVE SETS BY P . ERDÖS AND A. TARSKI (Received August 11, 1942) In this paper we shall be concerned with a certain particular problem from the general theory of sets, namely with the problem of the existence of families of mutually exclusive sets with a maximal power . It will turn out-in a rather unexpected way that the solution of these problems essentially involves the notion of the so-called "inaccessible numbers ." In this connection we shall make some general remarks regarding inaccessible numbers in the last section of our paper . §1. FORMULATION OF THE PROBLEM . TERMINOLOGY' The problem in which we are interested can be stated as follows : Is it true that every field F of sets contains a family of mutually exclusive sets with a maximal power, i .e . a family O whose cardinal number is not smaller than the cardinal number of any other family of mutually exclusive sets contained in F . By a field of sets we understand here as usual a family F of sets which to- gether with every two sets X and Y contains also their union X U Y and their difference X - Y (i.e. the set of those elements of X which do not belong to Y) among its elements . A family O is called a family of mutually exclusive sets if no set X of X of O is empty and if any two different sets of O have an empty inter- section. A similar problem can be formulated for other families e .g .
    [Show full text]
  • The Structure and Ontology of Logical Space June 1983
    WORLDS AND PROPOSITIONS: The Structure and Ontology of Logical Space Phillip Bricker A DISSERTATION PRESENTED TO THE FACULTY OF PRINCETON UNIVERSITY IN CANDIDACY FOR THE DEGREE OF DOCTOR OF PH I LOSOPHY RECOMMENDED FOR ACCEPTANCE BY THE DEPARTMENT OF PHILOSOPHY June 1983 © 1983 Phillip Bricker ALL RIGHTS RESERVED ACKNOWLEDGMENTS I acknowledge with pleasure an enormous intellectual debt to my thesis adviser, David Lewis, both for his extensive and invaluable comments on various drafts of this work, and, more generally, for teaching me so much of what I know about matters philosophical. CONTENTS Introduction. 3 Section 1: Propositions and Boolean Algebra. 10 First Thesis. 10 First Reformulation: The Laws of Propositional Logic. 15 Second Reformulation: The Lindenbaum-Tarski Algebra. 21 Objections to the First Thesis. 28 Second Thesis. 33 Objections to the Second Thesis. 3& section 2: Logical Space. 38 Logical Space as a Field of Sets. 38 Alternative Conceptions of Logical Space. 44 section 3: Maximal Consistent Sets of Propositions. 48 Third Thesis. 48 Atomic Propositions. 52 Finite Consistency. 55 Objections to the Third Thesis. 59 section 4: Separating Worlds by Propositions. 68 Fourth Thesis. 68 Indiscernibility Principles. 71 Objections to the Fourth Thesis. 74 Section 5: Consistency and Realizability. 78 Fifth Thesis. 78 The Compact Theory. 82 The Mathematical Objection. 91 The Modal Objection. 105 Section 6: Proposition-Based Theories. 117 Tripartite Correspondence. 117 Weak and Feeble Proposition-Based Theories. 123 Adams's World-Story Theory. 131 Section 7: The World-Based Theory. 138 Isomorphic Algebras. 138 Stalnaker on Adams. 148 Section 8: Reducing possible Worlds to Language. 156 Introduction.
    [Show full text]
  • Distributivity in Boolean Algebras
    Pacific Journal of Mathematics DISTRIBUTIVITY IN BOOLEAN ALGEBRAS RICHARD SCOTT PIERCE Vol. 7, No. 1 January 1957 DISTRIBUTIVITY IN BOOLEAN ALGEBRAS R. S. PIERCE 1. Introduction. Let a be an infinite cardinal number; suppose i? is an α-complete Boolean algebra, that is, every subset of B which con- tains no more than a elements has a least upper bound in B. 1 DEFINITION 1.1. B is a-distributive if the following identity holds in B whenever S and T are index sets of cardinality <: a : Λ σe*( VreiΌ - V,6,(Λσ€A,(σ)) , WhβΓβ F= T This paper studies ^-distributive Boolean algebras, their Boolean spaces and the continuous functions on these Boolean spaces. A survey of the main results can be obtained by reading Theorems 6.5, 7.1, 8.1 and 8.2. 2* Notation. Throughout the paper, a denotes a fixed infinite cardinal number. The term α-B.A. is used to abbreviate α-complete Boolean algebra. Only α-complete algebras are considered, although some of the definitions apply to arbitrary Boolean algebras. We speak of Λ-subalgebras, αsideals, α-homomorphisms, α-fields, etc., meaning that the relevant operations enjoy closure up to the power a. For example, an α-field is a field of sets, closed under α-unions, that is, unions of a or fewer element. The lattice operations of join, meet and complement are designated by \/f /\ and (') respectively. The symbols 0 and u stand for the zero and unit elements of a Boolean algebra. Set operations are represented by rounded symbols: \J, Γ\ and gj respectively denote union, inter- section and inclusion.
    [Show full text]
  • Topics in Discrete Mathematics
    TOPICS IN DISCRETE MATHEMATICS A.F. Pixley Harvey Mudd College July 21, 2010 ii Contents Preface v 1 Combinatorics 1 1.1 Introduction . 1 1.2 The Pigeonhole Principle . 2 1.3 Ramsey's Theorem . 7 1.4 Counting Strategies . 15 1.5 Permutations and combinations . 19 1.6 Permutations and combinations with repetitions . 28 1.7 The binomial coefficients . 38 1.8 The principle of inclusion and exclusion . 45 2 The Integers 53 2.1 Divisibility and Primes . 53 2.2 GCD and LCM . 58 2.3 The Division Algorithm and the Euclidean Algorithm . 62 2.4 Modules . 67 2.5 Counting; Euler's φ-function . 69 2.6 Congruences . 73 2.7 Classical theorems about congruences . 79 2.8 The complexity of arithmetical computation . 85 3 The Discrete Calculus 93 3.1 The calculus of finite differences . 93 3.2 The summation calculus . 102 3.3 Difference Equations . 108 3.4 Application: the complexity of the Euclidean algorithm . 114 4 Order and Algebra 117 4.1 Ordered sets and lattices . 117 4.2 Isomorphism and duality . 119 4.3 Lattices as algebras . 122 4.4 Modular and distributive lattices . 125 iii iv CONTENTS 4.5 Boolean algebras . 132 4.6 The representation of Boolean algebras . 137 5 Finite State Machines 145 5.1 Machines-introduction . 145 5.2 Semigroups and monoids . 146 5.3 Machines - formal theory . 148 5.4 The theorems of Myhill and Nerode . 152 6 Appendix: Induction 161 v Preface This text is intended as an introduction to a selection of topics in discrete mathemat- ics.
    [Show full text]
  • Measures in Boolean Algebras
    MEASURES IN BOOLEAN ALGEBRAS BY ALFRED HORN AND ALFRED TARSKI Introduction. By a measure on a Boolean algebra we understand as usual a function defined over all elements of the algebra, assuming finite non-nega- tive real numbers as values (but not identically vanishing), and satisfying the condition of finite additivity: the function value at a sum of two disjoint elements equals the sum of the function values at these elements. By includ- ing in this definition some additional conditions we arrive at special kinds of measures: two-valued measures, strictly positive measures, and countably addi- tive measures. In §1 we concern ourselves with the general notion of measure; we show how a measure—and in particular a two-valued measure—defined on a sub- algebra of a given Boolean algebra, or even on an arbitrary subset of the algebra, can be extended to the whole algebra. In §§2 and 3 we consider spe- cial kinds of measures, in fact, strictly positive and countably additive meas- ures, and we establish several partial criteria (necessary or sufficient condi- tions) for their existence. Some of the results stated in this paper can be ob- tained in a roundabout way from what is to be found in the literature, but they will be provided here with rather simple and direct proofs, without applying notions not involved in the formulation of the results. Terminology and symbolism^). Given any two sets A and B, we denote their union (or sum) by A\JB, their intersection (or product) by AC\B, their difference by A —B.
    [Show full text]
  • Notes on Hindman's Theorem, Ultrafilters, and Reverse Mathematics
    Notes on Hindman’s Theorem, Ultralters, and Reverse Mathematics Jery L. Hirst Appalachian State University January 2002 Abstract These notes give additional details for results presented at a talk in Baltimore on January 18, 2003. 1 Terminology A countable eld of sets is a countable collection of subsets of N which is closed under intersection, union, and relative complementation. We use Xc to denote {x ∈ N | x/∈ X}, the complement of X relative to N. Given a set X N and an integer n ∈ N, we use X n to denote the set {x n | x ∈ X ∧ x n}, the translation of X by n.Adownward translation algebra is countable eld of sets which is closed under translation. Given a set G N, RCA0 suces to prove the existence of the set hGi of all nite unions of nite intersections of translations of G and complements of translations of G. RCA0 can also prove that hGi is a downward translation algebra. Note that in RCA0, we encode hGi as a countable sequence of countable sets, and that each set in hGi may be repeated many times in the sequence. An ultralter on a countable eld of sets F is a subset U F satisfying the following four properties. 1. ∅ ∈/ U. 2. if X1,X2 ∈ U then X1 ∩ X2 ∈ U. 1 3. ∀X ∈ U ∀Y ∈ F (X Y → Y ∈ U). 4. ∀X ∈ F (X ∈ U ∨ Xc ∈ U). An ultralter U is an almost downward translation invariant ultralter if ∀X ∈ U ∃x ∈ X (x =06 ∧ X x ∈ U). Comment: Note that the restriction to elds of sets other than the full power set of N aects the formulation of the last denition.
    [Show full text]
  • Completeness of S4 for the Lebesgue Measure Algebra in That Measure-Theoretic Notions Take Center-Stage
    J Philos Logic DOI 10.1007/s10992-010-9161-3 Completeness of S4 with Respect to the Lebesgue Measure Algebra Based on the Unit Interval Tamar Lando Received: 6 February 2010 / Accepted: 5 October 2010 © Springer Science+Business Media B.V. 2010 Abstract We prove completeness of the propositional modal logic S4 for the measure algebra based on the Lebesgue-measurable subsets of the unit interval, [0, 1]. In recent talks, Dana Scott introduced a new measure-based semantics for the standard propositional modal language with Boolean connec- tives and necessity and possibility operators, and ♦. Propositional modal for- mulae are assigned to Lebesgue-measurable subsets of the real interval [0, 1], modulo sets of measure zero. Equivalence classes of Lebesgue-measurable subsets form a measure algebra, M, and we add to this a non-trivial interior operator constructed from the frame of ‘open’ elements—elements in M with an open representative. We prove completeness of the modal logic S4 for the algebra M. A corollary to the main result is that non-theorems of S4 can be falsified at each point in a subset of the real interval [0, 1] of measure arbitrarily close to 1. A second corollary is that Intuitionistic propositional logic (IPC) is complete for the frame of open elements in M. Keywords Measure algebra · Topological modal logic · Topological semantics · S4 · Completeness · Modal logic · Probabilistic semantics 1 Introduction In 1944, Tarski and McKinsey proved that the propositional modal logic S4 is complete for any dense-in-itself metric space.1An important special case that 1See [5]. T.
    [Show full text]
  • Sigma-Algebra from Wikipedia, the Free Encyclopedia Chapter 1
    Sigma-algebra From Wikipedia, the free encyclopedia Chapter 1 Algebra of sets The algebra of sets defines the properties and laws of sets, the set-theoretic operations of union, intersection, and complementation and the relations of set equality and set inclusion. It also provides systematic procedures for evalu- ating expressions, and performing calculations, involving these operations and relations. Any set of sets closed under the set-theoretic operations forms a Boolean algebra with the join operator being union, the meet operator being intersection, and the complement operator being set complement. 1.1 Fundamentals The algebra of sets is the set-theoretic analogue of the algebra of numbers. Just as arithmetic addition and multiplication are associative and commutative, so are set union and intersection; just as the arithmetic relation “less than or equal” is reflexive, antisymmetric and transitive, so is the set relation of “subset”. It is the algebra of the set-theoretic operations of union, intersection and complementation, and the relations of equality and inclusion. For a basic introduction to sets see the article on sets, for a fuller account see naive set theory, and for a full rigorous axiomatic treatment see axiomatic set theory. 1.2 The fundamental laws of set algebra The binary operations of set union ( [ ) and intersection ( \ ) satisfy many identities. Several of these identities or “laws” have well established names. Commutative laws: • A [ B = B [ A • A \ B = B \ A Associative laws: • (A [ B) [ C = A [ (B [ C) • (A \ B) \ C = A \ (B \ C) Distributive laws: • A [ (B \ C) = (A [ B) \ (A [ C) • A \ (B [ C) = (A \ B) [ (A \ C) The analogy between unions and intersections of sets, and addition and multiplication of numbers, is quite striking.
    [Show full text]
  • Arxiv:1908.00864V1 [Math.RA] 2 Aug 2019 Mn H Ig Fqoinsof Quotients of Rings the Among Erfrt Sthe As to Refer We Anr Ring a Manner
    SELF-INJECTIVITY OF M(X, A) VERSUS M(X, A) MODULO ITS SOCLE A. R. OLFATI Abstract. Let A be a field of subsets of a set X and M(X, A) be the ring of all real valued A-measurable functions on X. It is shown that M(X, A) is self-injective if and only if A is a complete and c+- additive field of sets. This answers a question raised in [H. Azadi, M. Henriksen and E. Momtahan, Some properties of algebras of real valued measurable functions, Acta Math. Hungar, 124, (2009), 15–23]. Also, it is observed that if A is a σ-field, M(X, A) modulo its socle is self-injective if and only if A is a complete and c+- additive field of sets with a finite number of atoms. 1. Introduction 1.1. Ring theoretic concepts. Throughout this discussion, by ring, we mean a commutative ring with identity. A ring R is called regular (in the sense of von Neumann) if for every r ∈ R there exists t ∈ R with r = r2t. We say R is a semi- prime ring if it has no nilpotent elements other than zero. If K is a subset of a ring R, then we define the annihilator of K to be Ann(K)= {r ∈ R : rK = {0}}. If R is a subring of a semi-prime ring S, we say that S is a ring of quotients of R (in the sense of Lambek [18]) if for each s ∈ S \{0}, there is r ∈ R such that 0 6= rs ∈ R.
    [Show full text]
  • A Course in Universal Algebra
    The Millennium Edition Stanley Burris H. P. Sankappanavar A Course in Universal Algebra With 36 Illustrations c S. Burris and H.P. Sankappanavar All Rights Reserved This Edition may be copied for personal use This book is dedicated to our children Kurosh Phillip Burris Veena and Geeta and Sanjay Sankappanavar Preface to the Millennium Edition The original 1981 edition of A Course in Universal Algebra has now been LaTeXed so the authors could make the out-of-print Springer-Verlag Gradu- ate Texts in Mathematics edition available once again, with corrections. The subject of Universal Algebra has flourished mightily since 1981, and we still believe that A Course in Universal Algebra offers an excellent introduction to the subject. Special thanks go to Lis D’Alessio for the superb job of LaTeXing this edition, and to NSERC for their support which has made this work possible. v Acknowledgments First we would like to express gratitude to our colleagues who have added so much vital- ity to the subject of Universal Algebra during the past twenty years. One of the original reasons for writing this book was to make readily available the beautiful work on sheaves and discriminator varieties which we had learned from, and later developed with H. Werner. Recent work of, and with, R. McKenzie on structure and decidability theory has added to our excitement, and conviction, concerning the directions emphasized in this book. In the late stages of polishing the manuscript we received valuable suggestions from M. Valeriote, W. Taylor, and the reviewer for Springer-Verlag. For help in proof-reading we also thank A.
    [Show full text]
  • KIDDIE TALK: ULTRAPRODUCTS and SZEMÉREDI's THEOREM Outline and References As Promised, This Talk Will Not Assume Any Knowledg
    KIDDIE TALK: ULTRAPRODUCTS AND SZEMEREDI’S´ THEOREM EVAN WARNER Outline and references As promised, this talk will not assume any knowledge of ultrafilters, ultraproducts, or any model theory. The plan is as follows: (1) Ultrafilters (2) Ultraproducts (3) Joke (4) What are ultraproducts good for? (5) Szem´eredi’stheorem via ultraproducts References: Mostly Terence Tao’s various blog notes on ultraproducts. For model theory, see David Marker’s Model Theory: An Introduction for a very readable exposition. 1. Ultrafilters on N Without giving any particular context, suppose I want a gadget that tells me whether subsets of the natural numbers N are “big” or “small.” Obviously, if we had some measure on N this would be one way of providing such a gadget, but a measure is more discerning and also less strict than what we want here. Specifically, we want a set ω of subsets of N. We’ll call a set A N “big” if it lies in ω, and “small” otherwise. We want ω to satisfy the following axioms: ⊂ (1) A ω if and only if N A ω. That is, the complement of a “big” set is “small” and vice-versa.∈ \ ∈ (2) If A ω and A B, then B ω. That is, any superset of a “big” set is “big.” Equivalently, from∈ the first axiom,⊂ any subset∈ of a “small” set is “small.” (3) (The weird one) If A, B ω, then A B ω. That is, the intersection of two (hence, finitely many) “big” sets is “big.”∈ Bigness is∩ somewhat∈ robust. Such an ω is called an ultrafilter (over N).
    [Show full text]