FINITE SUBSTRUCTURE LATTICES OF MODELS OF PEANO ARITHMETIC
|
|
- Dinah Ball
- 6 years ago
- Views:
Transcription
1 proceedings of the american mathematical society Volume 117, Number 3, March 1993 FINITE SUBSTRUCTURE LATTICES OF MODELS OF PEANO ARITHMETIC JAMES H. SCHMERL (Communicated by Andreas R. Blass) Abstract. Some new finite lattices (for example, A/4, M7, and the hexagon lattice) are shown to be isomorphic to the lattice of elementary substructures of a model of Peano Arithmetic. The set of elementary substructures of a model JV of Peano Arithmetic forms a lattice Lt(yf), the substructure lattice of jv. It is unknown whether there are finite lattices that are not isomorphic to any substructure lattice. Indeed, it was conjectured in [8] that for any finite lattice L there is some jv 1= PA for which L = \X(JV). It was proved in [8] that if 2 < n < co, then there is JV such that Lt(^T) = n(«). (The partition lattices U(n) are defined below.) For 3 < n < co, the lattice Mn is the unique lattice that has n + 2 elements and n atoms. Thus, the lattice A/3, which is isomorphic to n(3), is isomorphic to a substructure lattice, although it is known from [2] or [4] that if yv is a model of True Arithmetic and 3 < n < co, then Lt(yT) ^ Mn. Other examples of finite lattices that are not substructure lattices of models of True Arithmetic are given in [8]. The lattices Mn for 4 < n < co and the hexagon lattice were identified in [8] as specific finite lattices that were not known to be isomorphic to substructure lattices. It is a consequence of the theorem in this note that M, whenever n = p" + 1 for some prime p, the hexagon lattice, and the lattice Mi are isomorphic to substructure lattices. It is still unknown whether or not Mx! is isomorphic to a substructure lattice. All previously known positive results about finite substructure lattices are contained in [8]. Prior to [8], Paris [4] proved that all finite distributive lattices occur as substructure lattices. (Also see [7].) Wilkie [9] showed that the pentagon lattice is a substructure lattice, and Paris [5] proved that M3 is a sublattice of an infinite substructure lattice. More generally, intermediate structure lattices will be considered. For # -< yv ^ PA, let Lt(yT/^) = {jf0 e la(yv): J? < JTq < jv}, regarded as a sublattice of Lt(yF). Notice that if Jf is a minimal model of PA and ^f -< jt, then Lt(^) = \l(j JJ?). Given a set A, let n(^) be the set of all partitions of A. If a, b A and n fl(a), then we write a «b (mod n) if {a, b} C C for some C n. Received by the editors February 11, 1991 and, in revised form, July 2, Mathematics Subject Classification. Primary 03H15, 03C62; Secondary 06B American Mathematical Society /93 $1.00 +$.25 per page
2 834 J. H. SCHMERL There are two extreme partitions 0^ and 1A in 11(A), where a & b (mod 1^) iff a = b, a «b (mod 0A) for every a, b A. We partially order n(^) so that if nx,n2 Yl then nx < n2 iff n2 is a refinement of 7Ti. In particular, 0^ < n < \A for each n U(A). With this partial order, n(^) becomes a complete lattice (which is the dual of the lattice usually considered). Thus, if nx, n2 U(A) then nx V n2 = {C0 : C0 = Ci n C2 ^ 0 for some Cx nx and C2 n2}. Let (A, y) be an algebra (in the sense of universal algebra); that is, each / e y is a function /: Ak -* A for some k < co. We let l\(a, Sr) be the sublattice of U(A) consisting of all partitions of A that correspond to congruences of (A, y). Thus, n e l\(a, Sr) iff whenever / e y is /V-ary and oq, ax,..., ak_x, bo, bx,..., bk_x A are such that a, «ft, (mod a) for each i < k, then /(a0, a.,...,a^_i)«/(fe0, &i,..., frt-i) (mod rc). The theorem can now be stated. Theorem. Let Jf ^ PA be countable and nonstandard, and let (A, y) be a finite algebra. Then Jf has a cofinal elementary extension JV such that U{Jr-/jr) = n(a, P). We need some definitions taken from [8]. Let L = (L, A, V) be a finite lattice. We denote the minimum and maximum elements of L by 0 and 1. A representation a of L in H(A) is an injection a: L -* U(A) such that a(0) = 0^, a(\) = \A and a(x\/y) = a(x) V a(y) for each x, y L. Notice that we do not require that a representation satisfy the identity a(x Ay) = a(x) Aa(y). Let a: L 11(A) be a representation. Then a is finite if A is finite, and a is nontrivial if \a(x)\ / 2 whenever x L. The representation a: L n(^) is a congruence representation if there is an algebra (A, Sr) such that a: L -> n(,4, J?~) is a lattice isomorphism. For n > 1 let a": L > 11(^4") be the representation such that for each c, d A" and x L, c «d (mod q"(x)) «for every i<n, ct & dj (mod a(x)). If we let S^ be the set of unary polynomial functions of (A, Sr), then Yl(A, S^x) = n(^4, S^). Therefore, when considering some l\(a, S^), we can assume that y consists only of unary functions. It is known [3] that every finite lattice has a congruence representation. However, it is an open question of some apparent difficulty whether every finite lattice has a finite congruence representation. The lattice Mxl is a specific lattice that has no known finite congruence representation. We present some examples of lattices that have finite congruence representations. Let L be a finite distributive lattice. Let A = {x L: x = 1 or x is a meetirreducible}, considered as a subposet of L. Let y be the set of all functions /: A» A such that f(a) > a for each a A. Then L and U(A, y) are isomorphic lattices. In fact, let a: L 11(A) be such that for each x L, a(x) is the partition whose only equivalence class that (possibly) is not a singleton is {a A : a> x}. Then a: L > Y1(A, y) is a lattice isomorphism.
3 MODELS OF PEANO ARITHMETIC 835 Let F be a finite field of order q, and let n = q + 1. Let A = F x F, and let / y iff there are a, b, c, d F such that f(x, y) = (ax + b, cy + d). Then U(A, y) 3 Mn. An observation due to Feit [ 1 ] implies that Mj has a finite congruence representation. Finally, let A = {0, 1, 2, 3, 4, 5, 6}. Then there is y such that n(,4, y) is isomorphic to the hexagon lattice. Specifically, n(^, y) = {(L,, 1^, {{0}, {1,2}, {3,4}, {5,6}}, {{0, 1,2}, {3,4}, {5,6}}, {{0}, {1,3}, {4,6}, {2,5}}, {{0,4,6}, {1,3}, {2,5}}}. We now proceed with the proof of the theorem. Lemma 1. Suppose L is a finite lattice, a: L > 11(^4) is a representation, and 2<n<co. Then (1) a" is a nontrivial representation of L; (2) // a is a finite representation then so is a" ; (3) if a is a congruence representation then so is a". Proof. (1) Clearly, if x L then \a"(x)\ = \a(x)\"?2. (2) If A is finite then so is A". (3) Let (A, y) be a unary algebra such that a: L -> U(A, y) is a lattice isomorphism. Without loss of generality assume that y has the identity function and all constant functions as members. Let % be the set of all functions g: A" A" for which there are fo, fi,..., fn-\ S? such that g((a0,ax,..., a _.)) = (/o(a0), f (a.),..., / _i(a _i)). We introduce the following notation to be used for the rest of this proof: for any x we denote by x the n-tuple (x, x,..., x). Now let?x be the set of all functions g: A" A" where for some i < n, g((an, ai,..., a _i)) = ~a[. Let ^ = b U &\. We claim that a": L -> n(^", ^) is a lattice isomorphism. First we show that a"(x) e n(^4",,f) for x L. Suppose g %, so that g((a0,ai,...,a _i)) = (/o(tfo), f\(a\),, fn-\(an-\)) Then c w a" (mod a"(x)) => for all / < n, c,- w a", (mod a(x)) => for all i < n, f(cj) w //(a1,) (mod a(x)) => </o(co),,/«-l(c -l)) «(/o(ao), > /n-i(rfn-i)) (moda"(x)) =*> g(c) «?(#") (mod a"(x)). Next suppose g e ^i, so that g((ao, ax,..., an-\)) = a7. Then c «cf (mod a"(x)) =$ Cj «a",- (mod a(x)) => cj «a",- (mod a"(x)) =*S(c)**(<0 (moda"(x)). Therefore, for all g 6 ^\ if c» a" (mod a"(x)) then g(c) w g(a") (mod a"(x)). Hence, a"(x) 6 U(A", "). Secondly, we show that if n U(A", 8?) then n = a"(x) for some x L. Let n U(A", &), and let /> e n(^) be such that a «& (mod p) etazs b (mod 7t).
4 836 J. H. SCHMERL To show that p f\(a, Sr), consider arbitrary a» b (mod p) => a «& (mod 7r) ^W)~W) =*/(a)«/(6) / e y. Then (modn) (mod//). Thus, // l\(a, y) so that p = a(x) for some x L. We claim that q"(x) = n. To see that a"(x) < /r, notice that c & d (mod 7t) => for each j < n, cf «a",- (mod 7r) => for each i < n, c, «a", (mod a(x)) => c k d (moda"(x)). To show that 7r < a"(x), consider c, d A" for which c «d (mod a"(x)). Let g0, Si,, gn-\ % be such that for i < n, gi((a0, a,,..., a _.)) = (60, 61,..., 6 -i}, where {dj if /' < /, a, if j = i, Cj if 7 > i for_all (a0, a.,..., a _.) /I". Then c = 0(co), gi(ci) * c?/(^/) (mod rc), i?/(^i) = c?!+i(c7+t), and g _i(a' _1) = a". Therefore, c «a" (mod rc). n Definition. Let a: L > FI(/4) and /?: L n(fl) be representations of L. Then a arrows ft (in symbols: a >/?) if whenever n 11(A) there is an injection 6: B -+ A such that (1) whenever x L and a, b B, then a «b (mod /?(*)) «- 0(a) «0(6) and (2) there is x e L such that whenever a, b B, then (mod a(x)) aztb (mod 0(x))& 6(a)* 6(b) (modn). We will refer to such a function 6 as a n-demonstrator for a /?. The next lemma is a consequence of the canonical partition theorem of Promel and Voigt [6]. This lemma was explicitly stated in Example 3.3 of [8] and was used there to prove the instance (see [8, Corollary 5.5]) of the theorem when L 9 11(A). Lemma 2. Let A be a finite set and let y: 11(A) > 11(A) be the identity representation. Then for each m > 1 there is n such that y" -» ym. The next lemma is the main ingredient in the proof of the theorem. Lemma 3. Suppose a: L -* Yl(A) is a finite congruence representation. there is n>\ such that a" a. Then Proof. Let a: L > H(A) be a finite congruence representation. Let (A,&~) be a unary algebra such that a: L -+ U(A, y) is a lattice isomorphism. Without loss of generality, we assume that the identity function is in y (so y ^ 0 ) and that y is closed under composition. Let m \Sr\ > 1. Letting y: 11(A) >
5 MODELS OF PEANO ARITHMETIC 837 n(^4) be the identity function, we can get n by Lemma 2 so that y" > ym. We claim that a" > a. In order to prove that a" -> a, consider some n Y1(A"). To obtain a ft-demonstrator for a" > a, let y = {^o, f\,, fm-1} > and let F: A > Am be the function for which F(a) = (fo(a), f(a),..., fm-\(a)) for each a A. Let 0j be a zr-demonstrator for 7" > ym, and then let 6 = 6X o F. We will show that 0 is a n-demonstrator for a" > a. Conditions (1) and (2) in the definition need to be proved. Proof of (1). Suppose c, d A" and x L. Notice that ak = yk o a for 1 < k < co. Then each of the following equivalences is clear. 6(c) x 6(d) (mod an(x))&6x(f(c))& 6x(F(d)) (mod y"(a(x))) &F(c)*F(d) (mod ym(a(x))) This proves (1) in the definition. &F(c)*F(d) (modam(x))» for each i < m, f(c) «f(d) «c «d (moda(x)). (mod a(x)) Proof of (2). Suppose that n U(A"), and let p U(A) be the partition such that a «b (mod p) & 6(a) «6(b) (mod n) whenever a, b A. In order to prove (2), we need to show that p X1(A, S* ). To do this, consider some i < m and arbitrary a, b A for which a «b (mod p). Then 6(a) w 6(b) (mod n). Hence, there is px Y1(A, SF) such that F(a) «F(b) (mod ym(px)), so that for each k < m, /fc(a) «/*( ) (mod px). Since y is closed under composition, for each j < m, f(f(a)) «fj(f(b)) (mod //,). It follows that F(y)(a)) «F(f(b)) (mod yw(//i)), so that 6x(F(f(a))) «6x(F(f(b))) (mod y"(px)); consequently, 0(^(a)) «&(/ (&)) (mod n), so that yj-(a) «^(/3) (mod //). This proves p U(A, SF). The following corollary generalizes Lemma 2. Corollary 4. Suppose a: L > n(^) is a finite congruence representation. Then for each m > 1 f/zeve w n such that a" am. Proof. This follows immediately from Lemmas 1 and 3 and the observation that (a")k and ank are isomorphic representations. We can now conclude the following corollary, which involves a technical definition from [8]. The reader is referred to [8] for a precise statement of this definition. Corollary 5. // L is a finite lattice that has a finite congruence representation, then for each n < co, L has an n-cpp representation. Proof. The «-CPP representation a of L is obtained as follows. Let a be a finite congruence representation of L. Let an = a2, which by Lemma 1 is a nontrivial finite congruence representation. Recursively obtain finite congruence representations an+x so that an+x an. This is possible by Lemmas 1 and 3. The representation an is an n-cpp representation of L. The theorem follows immediately from Corollary 5, Theorem 4.1 of [8], and Remark 5.1 of [8].
6 838 j. h. schmerl References 1. W. Feit, An interval in the subgroup lattice of a finite group which is isomorphic to M-,, Algebra Universalis 17 (1983), H. Gaifman, Models and types ofpeano's arithmetic, Ann. Math. Logic 9 (1976), G. Gratzer and E. T. Schmidt, Characterizations of congruence lattices of abstract algebras. Acta. Sci. Math. (Szeged) 24 (1963), J. Paris, On models of arithmetic, Conference in Mathematical Logic, London '70, Lecture Notes in Math., vol. 225, Springer-Verlag, Heidelberg and New York, 1972, pp _, Models of arithmetic and the lattice, Fund. Math. 95 (1977), H. J. Promel and B. Voigt, Canonical partition theorems for parameter sets, J. Combin. Theory (A) 35 (1983), J. H. Schmerl, Extending models of arithmetic, Ann. Math. Logic 14 (1978), _, Substructure lattices of models of Peano Arithmetic, Logic Colloquium '84, North- Holland, Amsterdam, 1986, pp A. Wilkie, On models of arithmetic having non-modular substructure lattices, Fund. Math. 95(1977), Department of Mathematics, University of Connecticut, Storrs, Connecticut address: Schmerl@UCONNVM.UCONN.EDU
The finite lattice representation problem and intervals in subgroup lattices of finite groups
The finite lattice representation problem and intervals in subgroup lattices of finite groups William DeMeo Math 613: Group Theory 15 December 2009 Abstract A well-known result of universal algebra states:
More informationTheorem 1.3. Every finite lattice has a congruence-preserving embedding to a finite atomistic lattice.
CONGRUENCE-PRESERVING EXTENSIONS OF FINITE LATTICES TO SEMIMODULAR LATTICES G. GRÄTZER AND E.T. SCHMIDT Abstract. We prove that every finite lattice hasa congruence-preserving extension to a finite semimodular
More informationTHE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET
THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET MICHAEL PINSKER Abstract. We calculate the number of unary clones (submonoids of the full transformation monoid) containing the
More informationPURITY IN IDEAL LATTICES. Abstract.
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I.CUZA IAŞI Tomul XLV, s.i a, Matematică, 1999, f.1. PURITY IN IDEAL LATTICES BY GRIGORE CĂLUGĂREANU Abstract. In [4] T. HEAD gave a general definition of purity
More informationGeneral Lattice Theory: 1979 Problem Update
Algebra Universalis, 11 (1980) 396-402 Birkhauser Verlag, Basel General Lattice Theory: 1979 Problem Update G. GRATZER Listed below are all the solutions or partial solutions to problems in the book General
More informationProjective Lattices. with applications to isotope maps and databases. Ralph Freese CLA La Rochelle
Projective Lattices with applications to isotope maps and databases Ralph Freese CLA 2013. La Rochelle Ralph Freese () Projective Lattices Oct 2013 1 / 17 Projective Lattices A lattice L is projective
More informationCongruence lattices of finite intransitive group acts
Congruence lattices of finite intransitive group acts Steve Seif June 18, 2010 Finite group acts A finite group act is a unary algebra X = X, G, where G is closed under composition, and G consists of permutations
More informationCONGRUENCES AND IDEALS IN A DISTRIBUTIVE LATTICE WITH RESPECT TO A DERIVATION
Bulletin of the Section of Logic Volume 42:1/2 (2013), pp. 1 10 M. Sambasiva Rao CONGRUENCES AND IDEALS IN A DISTRIBUTIVE LATTICE WITH RESPECT TO A DERIVATION Abstract Two types of congruences are introduced
More informationGUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv: v1 [math.lo] 25 Mar 2019
GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv:1903.10476v1 [math.lo] 25 Mar 2019 Abstract. In this article we prove three main theorems: (1) guessing models are internally unbounded, (2)
More informationCOLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI SZEGED (HUNGARY), 1980.
COLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI 33. CONTRIBUTIONS TO LATTICE THEORY SZEGED (HUNGARY), 1980. A SURVEY OF PRODUCTS OF LATTICE VARIETIES G. GRATZER - D. KELLY Let y and Wbe varieties of lattices.
More informationA Property Equivalent to n-permutability for Infinite Groups
Journal of Algebra 221, 570 578 (1999) Article ID jabr.1999.7996, available online at http://www.idealibrary.com on A Property Equivalent to n-permutability for Infinite Groups Alireza Abdollahi* and Aliakbar
More informationCATEGORICAL SKEW LATTICES
CATEGORICAL SKEW LATTICES MICHAEL KINYON AND JONATHAN LEECH Abstract. Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most
More informationINTERVAL DISMANTLABLE LATTICES
INTERVAL DISMANTLABLE LATTICES KIRA ADARICHEVA, JENNIFER HYNDMAN, STEFFEN LEMPP, AND J. B. NATION Abstract. A finite lattice is interval dismantlable if it can be partitioned into an ideal and a filter,
More informationOrdered Semigroups in which the Left Ideals are Intra-Regular Semigroups
International Journal of Algebra, Vol. 5, 2011, no. 31, 1533-1541 Ordered Semigroups in which the Left Ideals are Intra-Regular Semigroups Niovi Kehayopulu University of Athens Department of Mathematics
More informationarxiv: v2 [math.lo] 13 Feb 2014
A LOWER BOUND FOR GENERALIZED DOMINATING NUMBERS arxiv:1401.7948v2 [math.lo] 13 Feb 2014 DAN HATHAWAY Abstract. We show that when κ and λ are infinite cardinals satisfying λ κ = λ, the cofinality of the
More informationLaurence Boxer and Ismet KARACA
THE CLASSIFICATION OF DIGITAL COVERING SPACES Laurence Boxer and Ismet KARACA Abstract. In this paper we classify digital covering spaces using the conjugacy class corresponding to a digital covering space.
More informationNon replication of options
Non replication of options Christos Kountzakis, Ioannis A Polyrakis and Foivos Xanthos June 30, 2008 Abstract In this paper we study the scarcity of replication of options in the two period model of financial
More informationCONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS. 1. Introduction. Novi Sad J. Math. Vol. 35, No. 2, 2005,
Novi Sad J. Math. Vol. 35, No. 2, 2005, 155-160 CONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS Mališa Žižović 1, Vera Lazarević 2 Abstract. To every finite lattice L, one can associate a binary blockcode,
More informationAn orderly algorithm to enumerate finite (semi)modular lattices
An orderly algorithm to enumerate finite (semi)modular lattices BLAST 23 Chapman University October 6, 23 Outline The original algorithm: Generating all finite lattices Generating modular and semimodular
More informationLaurence Boxer and Ismet KARACA
SOME PROPERTIES OF DIGITAL COVERING SPACES Laurence Boxer and Ismet KARACA Abstract. In this paper we study digital versions of some properties of covering spaces from algebraic topology. We correct and
More informationLATTICE LAWS FORCING DISTRIBUTIVITY UNDER UNIQUE COMPLEMENTATION
LATTICE LAWS FORCING DISTRIBUTIVITY UNDER UNIQUE COMPLEMENTATION R. PADMANABHAN, W. MCCUNE, AND R. VEROFF Abstract. We give several new lattice identities valid in nonmodular lattices such that a uniquely
More informationCARDINALITIES OF RESIDUE FIELDS OF NOETHERIAN INTEGRAL DOMAINS
CARDINALITIES OF RESIDUE FIELDS OF NOETHERIAN INTEGRAL DOMAINS KEITH A. KEARNES AND GREG OMAN Abstract. We determine the relationship between the cardinality of a Noetherian integral domain and the cardinality
More informationWorksheet A ALGEBRA PMT
Worksheet A 1 Find the quotient obtained in dividing a (x 3 + 2x 2 x 2) by (x + 1) b (x 3 + 2x 2 9x + 2) by (x 2) c (20 + x + 3x 2 + x 3 ) by (x + 4) d (2x 3 x 2 4x + 3) by (x 1) e (6x 3 19x 2 73x + 90)
More informationADDING A LOT OF COHEN REALS BY ADDING A FEW II. 1. Introduction
ADDING A LOT OF COHEN REALS BY ADDING A FEW II MOTI GITIK AND MOHAMMAD GOLSHANI Abstract. We study pairs (V, V 1 ), V V 1, of models of ZF C such that adding κ many Cohen reals over V 1 adds λ many Cohen
More informationFuzzy L-Quotient Ideals
International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 3, Number 3 (2013), pp. 179-187 Research India Publications http://www.ripublication.com Fuzzy L-Quotient Ideals M. Mullai
More informationCOMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS
COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS DAN HATHAWAY AND SCOTT SCHNEIDER Abstract. We discuss combinatorial conditions for the existence of various types of reductions between equivalence
More informationGenerating all nite modular lattices of a given size
Generating all nite modular lattices of a given size Peter Jipsen and Nathan Lawless Dedicated to Brian Davey on the occasion of his 65th birthday Abstract. Modular lattices, introduced by R. Dedekind,
More informationSkew lattices of matrices in rings
Algebra univers. 53 (2005) 471 479 0002-5240/05/040471 09 DOI 10.1007/s00012-005-1913-5 c Birkhäuser Verlag, Basel, 2005 Algebra Universalis Skew lattices of matrices in rings Karin Cvetko-Vah Abstract.
More informationLattice Laws Forcing Distributivity Under Unique Complementation
Lattice Laws Forcing Distributivity Under Unique Complementation R. Padmanabhan Department of Mathematics University of Manitoba Winnipeg, Manitoba R3T 2N2 Canada W. McCune Mathematics and Computer Science
More information5 Deduction in First-Order Logic
5 Deduction in First-Order Logic The system FOL C. Let C be a set of constant symbols. FOL C is a system of deduction for the language L # C. Axioms: The following are axioms of FOL C. (1) All tautologies.
More informationSy D. Friedman. August 28, 2001
0 # and Inner Models Sy D. Friedman August 28, 2001 In this paper we examine the cardinal structure of inner models that satisfy GCH but do not contain 0 #. We show, assuming that 0 # exists, that such
More informationKAPLANSKY'S PROBLEM ON VALUATION RINGS
proceedings of the american mathematical society Volume 105, Number I, January 1989 KAPLANSKY'S PROBLEM ON VALUATION RINGS LASZLO FUCHS AND SAHARON SHELAH (Communicated by Louis J. Ratliff, Jr.) Dedicated
More informationLATTICE EFFECT ALGEBRAS DENSELY EMBEDDABLE INTO COMPLETE ONES
K Y BERNETIKA VOLUM E 47 ( 2011), NUMBER 1, P AGES 100 109 LATTICE EFFECT ALGEBRAS DENSELY EMBEDDABLE INTO COMPLETE ONES Zdenka Riečanová An effect algebraic partial binary operation defined on the underlying
More informationA.Miller Model Theory M776 May 7, Spring 2009 Homework problems are due in class one week from the day assigned (which is in parentheses).
A.Miller Model Theory M776 May 7, 2009 1 Spring 2009 Homework problems are due in class one week from the day assigned (which is in parentheses). Theorem (Ehrenfeucht-Fräisse 1960 [8]). If M and N are
More informationAn Optimal Odd Unimodular Lattice in Dimension 72
An Optimal Odd Unimodular Lattice in Dimension 72 Masaaki Harada and Tsuyoshi Miezaki September 27, 2011 Abstract It is shown that if there is an extremal even unimodular lattice in dimension 72, then
More informationGödel algebras free over finite distributive lattices
TANCL, Oxford, August 4-9, 2007 1 Gödel algebras free over finite distributive lattices Stefano Aguzzoli Brunella Gerla Vincenzo Marra D.S.I. D.I.COM. D.I.C.O. University of Milano University of Insubria
More informationIntroduction Recently the importance of modelling dependent insurance and reinsurance risks has attracted the attention of actuarial practitioners and
Asymptotic dependence of reinsurance aggregate claim amounts Mata, Ana J. KPMG One Canada Square London E4 5AG Tel: +44-207-694 2933 e-mail: ana.mata@kpmg.co.uk January 26, 200 Abstract In this paper we
More informationHyperidentities in (xx)y xy Graph Algebras of Type (2,0)
Int. Journal of Math. Analysis, Vol. 8, 2014, no. 9, 415-426 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.312299 Hyperidentities in (xx)y xy Graph Algebras of Type (2,0) W. Puninagool
More informationSEMICENTRAL IDEMPOTENTS IN A RING
J. Korean Math. Soc. 51 (2014), No. 3, pp. 463 472 http://dx.doi.org/10.4134/jkms.2014.51.3.463 SEMICENTRAL IDEMPOTENTS IN A RING Juncheol Han, Yang Lee, and Sangwon Park Abstract. Let R be a ring with
More informationChapter 4 Partial Fractions
Chapter 4 8 Partial Fraction Chapter 4 Partial Fractions 4. Introduction: A fraction is a symbol indicating the division of integers. For example,, are fractions and are called Common 9 Fraction. The dividend
More informationEquivalence between Semimartingales and Itô Processes
International Journal of Mathematical Analysis Vol. 9, 215, no. 16, 787-791 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ijma.215.411358 Equivalence between Semimartingales and Itô Processes
More informationSome Remarks on Finitely Quasi-injective Modules
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 6, No. 2, 2013, 119-125 ISSN 1307-5543 www.ejpam.com Some Remarks on Finitely Quasi-injective Modules Zhu Zhanmin Department of Mathematics, Jiaxing
More informationMartingales. by D. Cox December 2, 2009
Martingales by D. Cox December 2, 2009 1 Stochastic Processes. Definition 1.1 Let T be an arbitrary index set. A stochastic process indexed by T is a family of random variables (X t : t T) defined on a
More informationFUZZY PRIME L-FILTERS
International Journal of Applied Mathematical Sciences ISSN 0973-0176 Volume 9, Number 1 (2016), pp. 37-44 Research India Publications http://www.ripublication.com FUZZY PRIME L-FILTERS M. Mullai Assistant
More informationarxiv:math/ v1 [math.lo] 15 Jan 1991
ON A CONJECTURE OF TARSKI ON PRODUCTS OF CARDINALS arxiv:math/9201247v1 [mathlo] 15 Jan 1991 Thomas Jech 1 and Saharon Shelah 2 Abstract 3 We look at an old conjecture of A Tarski on cardinal arithmetic
More informationON THE LATTICE OF ORTHOMODULAR LOGICS
Jacek Malinowski ON THE LATTICE OF ORTHOMODULAR LOGICS Abstract The upper part of the lattice of orthomodular logics is described. In [1] and [2] Bruns and Kalmbach have described the lower part of the
More informationAxiomatization of generic extensions by homogeneous partial orderings
Axiomatization of generic extensions by homogeneous partial orderings a talk at Colloquium on Mathematical Logic (Amsterdam Utrecht) May 29, 2008 (Sakaé Fuchino) Chubu Univ., (CRM Barcelona) (2008 05 29
More informationInterpolation of κ-compactness and PCF
Comment.Math.Univ.Carolin. 50,2(2009) 315 320 315 Interpolation of κ-compactness and PCF István Juhász, Zoltán Szentmiklóssy Abstract. We call a topological space κ-compact if every subset of size κ has
More informationGeneralization by Collapse
Generalization by Collapse Monroe Eskew University of California, Irvine meskew@math.uci.edu March 31, 2012 Monroe Eskew (UCI) Generalization by Collapse March 31, 2012 1 / 19 Introduction Our goal is
More information2. The ultrapower construction
2. The ultrapower construction The study of ultrapowers originates in model theory, although it has found applications both in algebra and in analysis. However, it is accurate to say that it is mainly
More informationBETA DISTRIBUTION ON ARITHMETICAL SEMIGROUPS
Annales Univ Sci Budapest Sect Comp 47 (2018) 147 154 BETA DISTRIBUTION ON ARITHMETICAL SEMIGROUPS Gintautas Bareikis and Algirdas Mačiulis (Vilnius Lithuania) Communicated by Imre Kátai (Received February
More informationThe ruin probabilities of a multidimensional perturbed risk model
MATHEMATICAL COMMUNICATIONS 231 Math. Commun. 18(2013, 231 239 The ruin probabilities of a multidimensional perturbed risk model Tatjana Slijepčević-Manger 1, 1 Faculty of Civil Engineering, University
More informationPARTITIONS OF 2 ω AND COMPLETELY ULTRAMETRIZABLE SPACES
PARTITIONS OF 2 ω AND COMPLETELY ULTRAMETRIZABLE SPACES WILLIAM R. BRIAN AND ARNOLD W. MILLER Abstract. We prove that, for every n, the topological space ω ω n (where ω n has the discrete topology) can
More informationExistentially closed models of the theory of differential fields with a cyclic automorphism
Existentially closed models of the theory of differential fields with a cyclic automorphism University of Tsukuba September 15, 2014 Motivation Let C be any field and choose an arbitrary element q C \
More informationAbstract Algebra Solution of Assignment-1
Abstract Algebra Solution of Assignment-1 P. Kalika & Kri. Munesh [ M.Sc. Tech Mathematics ] 1. Illustrate Cayley s Theorem by calculating the left regular representation for the group V 4 = {e, a, b,
More informationCTL Model Checking. Goal Method for proving M sat σ, where M is a Kripke structure and σ is a CTL formula. Approach Model checking!
CMSC 630 March 13, 2007 1 CTL Model Checking Goal Method for proving M sat σ, where M is a Kripke structure and σ is a CTL formula. Approach Model checking! Mathematically, M is a model of σ if s I = M
More informationGenerating all modular lattices of a given size
Generating all modular lattices of a given size ADAM 2013 Nathan Lawless Chapman University June 6-8, 2013 Outline Introduction to Lattice Theory: Modular Lattices The Objective: Generating and Counting
More informationCOMBINATORIAL CONVOLUTION SUMS DERIVED FROM DIVISOR FUNCTIONS AND FAULHABER SUMS
GLASNIK MATEMATIČKI Vol. 49(69(014, 351 367 COMBINATORIAL CONVOLUTION SUMS DERIVED FROM DIVISOR FUNCTIONS AND FAULHABER SUMS Bumkyu Cho, Daeyeoul Kim and Ho Park Dongguk University-Seoul, National Institute
More informationDouble Ore Extensions versus Iterated Ore Extensions
Double Ore Extensions versus Iterated Ore Extensions Paula A. A. B. Carvalho, Samuel A. Lopes and Jerzy Matczuk Departamento de Matemática Pura Faculdade de Ciências da Universidade do Porto R.Campo Alegre
More informationNo-arbitrage theorem for multi-factor uncertain stock model with floating interest rate
Fuzzy Optim Decis Making 217 16:221 234 DOI 117/s17-16-9246-8 No-arbitrage theorem for multi-factor uncertain stock model with floating interest rate Xiaoyu Ji 1 Hua Ke 2 Published online: 17 May 216 Springer
More informationLevel by Level Inequivalence, Strong Compactness, and GCH
Level by Level Inequivalence, Strong Compactness, and GCH Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth
More informationLecture 14: Basic Fixpoint Theorems (cont.)
Lecture 14: Basic Fixpoint Theorems (cont) Predicate Transformers Monotonicity and Continuity Existence of Fixpoints Computing Fixpoints Fixpoint Characterization of CTL Operators 1 2 E M Clarke and E
More informationNew tools of set-theoretic homological algebra and their applications to modules
New tools of set-theoretic homological algebra and their applications to modules Jan Trlifaj Univerzita Karlova, Praha Workshop on infinite-dimensional representations of finite dimensional algebras Manchester,
More informationThe illustrated zoo of order-preserving functions
The illustrated zoo of order-preserving functions David Wilding, February 2013 http://dpw.me/mathematics/ Posets (partially ordered sets) underlie much of mathematics, but we often don t give them a second
More information3 The Model Existence Theorem
3 The Model Existence Theorem Although we don t have compactness or a useful Completeness Theorem, Henkinstyle arguments can still be used in some contexts to build models. In this section we describe
More informationSHIMON GARTI AND SAHARON SHELAH
(κ, θ)-weak NORMALITY SHIMON GARTI AND SAHARON SHELAH Abstract. We deal with the property of weak normality (for nonprincipal ultrafilters). We characterize the situation of Q λ i/d = λ. We have an application
More informationFirst-Order Logic in Standard Notation Basics
1 VOCABULARY First-Order Logic in Standard Notation Basics http://mathvault.ca April 21, 2017 1 Vocabulary Just as a natural language is formed with letters as its building blocks, the First- Order Logic
More informationOn the Lower Arbitrage Bound of American Contingent Claims
On the Lower Arbitrage Bound of American Contingent Claims Beatrice Acciaio Gregor Svindland December 2011 Abstract We prove that in a discrete-time market model the lower arbitrage bound of an American
More informationMath-Stat-491-Fall2014-Notes-V
Math-Stat-491-Fall2014-Notes-V Hariharan Narayanan December 7, 2014 Martingales 1 Introduction Martingales were originally introduced into probability theory as a model for fair betting games. Essentially
More informationLocal monotonicities and lattice derivatives of Boolean and pseudo-boolean functions
Local monotonicities and lattice derivatives of Boolean and pseudo-boolean functions Tamás Waldhauser joint work with Miguel Couceiro and Jean-Luc Marichal University of Szeged AAA 83 Novi Sad, 16 March
More informationIntegrating rational functions (Sect. 8.4)
Integrating rational functions (Sect. 8.4) Integrating rational functions, p m(x) q n (x). Polynomial division: p m(x) The method of partial fractions. p (x) (x r )(x r 2 ) p (n )(x). (Repeated roots).
More informationDEPTH OF BOOLEAN ALGEBRAS SHIMON GARTI AND SAHARON SHELAH
DEPTH OF BOOLEAN ALGEBRAS SHIMON GARTI AND SAHARON SHELAH Abstract. Suppose D is an ultrafilter on κ and λ κ = λ. We prove that if B i is a Boolean algebra for every i < κ and λ bounds the Depth of every
More informationORDERED SEMIGROUPS HAVING THE P -PROPERTY. Niovi Kehayopulu, Michael Tsingelis
ORDERED SEMIGROUPS HAVING THE P -PROPERTY Niovi Kehayopulu, Michael Tsingelis ABSTRACT. The main results of the paper are the following: The ordered semigroups which have the P -property are decomposable
More informationFuzzy Join - Semidistributive Lattice
International Journal of Mathematics Research. ISSN 0976-5840 Volume 8, Number 2 (2016), pp. 85-92 International Research Publication House http://www.irphouse.com Fuzzy Join - Semidistributive Lattice
More informationUnary PCF is Decidable
Unary PCF is Decidable Ralph Loader Merton College, Oxford November 1995, revised October 1996 and September 1997. Abstract We show that unary PCF, a very small fragment of Plotkin s PCF [?], has a decidable
More informationOn the h-vector of a Lattice Path Matroid
On the h-vector of a Lattice Path Matroid Jay Schweig Department of Mathematics University of Kansas Lawrence, KS 66044 jschweig@math.ku.edu Submitted: Sep 16, 2009; Accepted: Dec 18, 2009; Published:
More informationRUDIN-KEISLER POSETS OF COMPLETE BOOLEAN ALGEBRAS
RUDIN-KEISLER POSETS OF COMPLETE BOOLEAN ALGEBRAS PETER JIPSEN, ALEXANDER PINUS, HENRY ROSE Abstract. The Rudin-Keisler ordering of ultrafilters is extended to complete Boolean algebras and characterised
More informationON THE QUOTIENT SHAPES OF VECTORIAL SPACES. Nikica Uglešić
RAD HAZU. MATEMATIČKE ZNANOSTI Vol. 21 = 532 (2017): 179-203 DOI: http://doi.org/10.21857/mzvkptxze9 ON THE QUOTIENT SHAPES OF VECTORIAL SPACES Nikica Uglešić To my Master teacher Sibe Mardešić - with
More informationA No-Arbitrage Theorem for Uncertain Stock Model
Fuzzy Optim Decis Making manuscript No (will be inserted by the editor) A No-Arbitrage Theorem for Uncertain Stock Model Kai Yao Received: date / Accepted: date Abstract Stock model is used to describe
More informationModular and Distributive Lattices
CHAPTER 4 Modular and Distributive Lattices Background R. P. DILWORTH Imbedding problems and the gluing construction. One of the most powerful tools in the study of modular lattices is the notion of the
More informationLARGE CARDINALS AND L-LIKE UNIVERSES
LARGE CARDINALS AND L-LIKE UNIVERSES SY D. FRIEDMAN There are many different ways to extend the axioms of ZFC. One way is to adjoin the axiom V = L, asserting that every set is constructible. This axiom
More informationGeneralising the weak compactness of ω
Generalising the weak compactness of ω Andrew Brooke-Taylor Generalised Baire Spaces Masterclass Royal Netherlands Academy of Arts and Sciences 22 August 2018 Andrew Brooke-Taylor Generalising the weak
More informationLattices with many congruences are planar
Lattices with many congruences are planar Gábor Czédli (University of Szeged) http://www.math.u-szeged.hu/~czedli/ Talk at the 56th SSAOS, Špindlerův Mlýn, September 2 7, 2018 September 4, 2018 Definitions
More informationThe Binomial Theorem and Consequences
The Binomial Theorem and Consequences Juris Steprāns York University November 17, 2011 Fermat s Theorem Pierre de Fermat claimed the following theorem in 1640, but the first published proof (by Leonhard
More informationHIGHER ORDER BINARY OPTIONS AND MULTIPLE-EXPIRY EXOTICS
Electronic Journal of Mathematical Analysis and Applications Vol. (2) July 203, pp. 247-259. ISSN: 2090-792X (online) http://ejmaa.6te.net/ HIGHER ORDER BINARY OPTIONS AND MULTIPLE-EXPIRY EXOTICS HYONG-CHOL
More informationNOTES ON (T, S)-INTUITIONISTIC FUZZY SUBHEMIRINGS OF A HEMIRING
NOTES ON (T, S)-INTUITIONISTIC FUZZY SUBHEMIRINGS OF A HEMIRING K.Umadevi 1, V.Gopalakrishnan 2 1Assistant Professor,Department of Mathematics,Noorul Islam University,Kumaracoil,Tamilnadu,India 2Research
More informationOn the generalized σ-fitting subgroup of finite groups
Rend. Sem. Mat. Univ. Padova 1xx (201x) Rendiconti del Seminario Matematico della Università di Padova c European Mathematical Society On the generalized σ-fitting subgroup of finite groups Bin Hu Jianhong
More informationarxiv: v1 [math.lo] 27 Mar 2009
arxiv:0903.4691v1 [math.lo] 27 Mar 2009 COMBINATORIAL AND MODEL-THEORETICAL PRINCIPLES RELATED TO REGULARITY OF ULTRAFILTERS AND COMPACTNESS OF TOPOLOGICAL SPACES. V. PAOLO LIPPARINI Abstract. We generalize
More informationCS792 Notes Henkin Models, Soundness and Completeness
CS792 Notes Henkin Models, Soundness and Completeness Arranged by Alexandra Stefan March 24, 2005 These notes are a summary of chapters 4.5.1-4.5.5 from [1]. 1 Review indexed family of sets: A s, where
More informationAN INFINITE CARDINAL-VALUED KRULL DIMENSION FOR RINGS
AN INFINITE CARDINAL-VALUED KRULL DIMENSION FOR RINGS K. ALAN LOPER, ZACHARY MESYAN, AND GREG OMAN Abstract. We define and study two generalizations of the Krull dimension for rings, which can assume cardinal
More informationCS 3331 Numerical Methods Lecture 2: Functions of One Variable. Cherung Lee
CS 3331 Numerical Methods Lecture 2: Functions of One Variable Cherung Lee Outline Introduction Solving nonlinear equations: find x such that f(x ) = 0. Binary search methods: (Bisection, regula falsi)
More informationPartial Fractions. A rational function is a fraction in which both the numerator and denominator are polynomials. For example, f ( x) = 4, g( x) =
Partial Fractions A rational function is a fraction in which both the numerator and denominator are polynomials. For example, f ( x) = 4, g( x) = 3 x 2 x + 5, and h( x) = x + 26 x 2 are rational functions.
More informationINFLATION OF FINITE LATTICES ALONG ALL-OR-NOTHING SETS TRISTAN HOLMES J. B. NATION
INFLATION OF FINITE LATTICES ALONG ALL-OR-NOTHING SETS TRISTAN HOLMES J. B. NATION Department of Mathematics, University of Hawaii, Honolulu, HI 96822, USA Phone:(808)956-4655 Abstract. We introduce a
More informationA lower bound on seller revenue in single buyer monopoly auctions
A lower bound on seller revenue in single buyer monopoly auctions Omer Tamuz October 7, 213 Abstract We consider a monopoly seller who optimally auctions a single object to a single potential buyer, with
More informationCONGRUENCE LATTICES OF PLANAR LATTICES
Acta Math. Hung. 60 (3-4) (1992), 251-268. CONGRUENCE LATTICES OF PLANAR LATTICES G. GRATZER and H. LAKSER (Winnipeg) 1. Introduction. Let L be a lattice. It was proved in N. Funayama and T. Nakayama [5]
More informationEquivalence Nucleolus for Partition Function Games
Equivalence Nucleolus for Partition Function Games Rajeev R Tripathi and R K Amit Department of Management Studies Indian Institute of Technology Madras, Chennai 600036 Abstract In coalitional game theory,
More informationMore On λ κ closed sets in generalized topological spaces
Journal of Algorithms and Computation journal homepage: http://jac.ut.ac.ir More On λ κ closed sets in generalized topological spaces R. Jamunarani, 1, P. Jeyanthi 2 and M. Velrajan 3 1,2 Research Center,
More informationREMARKS ON K3 SURFACES WITH NON-SYMPLECTIC AUTOMORPHISMS OF ORDER 7
REMARKS ON K3 SURFACES WTH NON-SYMPLECTC AUTOMORPHSMS OF ORDER 7 SHNGO TAK Abstract. n this note, we treat a pair of a K3 surface and a non-symplectic automorphism of order 7m (m = 1, 3 and 6) on it. We
More informationNotes on the symmetric group
Notes on the symmetric group 1 Computations in the symmetric group Recall that, given a set X, the set S X of all bijections from X to itself (or, more briefly, permutations of X) is group under function
More informationMITCHELL S THEOREM REVISITED. Contents
MITCHELL S THEOREM REVISITED THOMAS GILTON AND JOHN KRUEGER Abstract. Mitchell s theorem on the approachability ideal states that it is consistent relative to a greatly Mahlo cardinal that there is no
More information