Lattice varieties with non-elementary amalgamation classes

被引：1
|
作者：
Ouwehand, P [1 ]
Rose, H [1 ]
机构：
[1] Univ Cape Town, Dept Math, ZA-7700 Rondebosch, South Africa
来源：
ALGEBRA UNIVERSALIS | 1999年 / 41卷 / 04期
关键词：
D O I：
10.1007/s000120050117
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper it is shown that under certain general conditions, if the amalgamation class of a lattice variety contains a member which does not have a 2-congruence, then the amalgamation class is not closed under ultrapowers or direct products. In particular, the amalgamation class is not first order axiomatizable.
引用
收藏
页码：317 / 336
页数：20
相关论文
共 50 条
  • [31] Non-elementary lower bound for Propositional Duration Calculus
    Rabinovich, A
    INFORMATION PROCESSING LETTERS, 1998, 66 (01) : 7 - 11
  • [32] Non-elementary speed-ups in logic calculi
    Arai, Toshiyasu
    MATHEMATICAL LOGIC QUARTERLY, 2008, 54 (06) : 629 - 640
  • [33] Classifying Non-elementary Movements in Vietnamese Mo Dances
    Bourahla, Mustapha
    Telli, Abdelmoutia
    Benferhat, Salem
    Chau, Ma Thi
    DIGITAL HUMAN MODELING AND APPLICATIONS IN HEALTH, SAFETY, ERGONOMICS AND RISK MANAGEMENT. HUMAN BODY AND MOTION, DHM 2019, PT I, 2019, 11581 : 128 - 139
  • [34] Non-Elementary Routes for Multicasting in Transparent Optical Networks
    Molnar, Miklos
    2017 19TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON), 2017,
  • [35] On p-quaternionic pairings of non-elementary type
    M. Kula
    manuscripta mathematica, 2000, 101 : 39 - 47
  • [36] BICYCLIC COMMUTATOR QUOTIENTS WITH ONE NON-ELEMENTARY COMPONENT
    Mayer, Daniel C.
    MATHEMATICA BOHEMICA, 2023, 148 (02): : 149 - 180
  • [37] Non-elementary lower bound for Propositional Duration Calculus
    Department of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel
    Inf. Process. Lett., 1 (7-11):
  • [38] Non-elementary exegesis of Twardowski's theory of presentation
    Vasyukov, VL
    LVOV-WARSAW SCHOOL AND CONTEMPORARY PHILOSOPHY, 1998, 273 : 153 - 167
  • [39] Non-elementary speedups between different versions of tableaux
    Baaz, M
    Fermuller, CG
    THEOREM PROVING WITH ANALYTIC TABLEAUX AND RELATED METHODS, 1995, 918 : 217 - 230
  • [40] Non-Elementary Complexities for Branching VASS, MELL, and Extensions
    Lazic, Ranko
    Schmitz, Sylvain
    PROCEEDINGS OF THE JOINT MEETING OF THE TWENTY-THIRD EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC (CSL) AND THE TWENTY-NINTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2014,
12345