On the subsemilattices of first-order definable and openly first-order definable congruences of the congruence lattice of a universal algebra

被引：0
|
作者：
A. G. Pinus
机构：
[1] Novosibirsk State Technical University,
来源：
Siberian Mathematical Journal | 2006年 / 47卷
关键词：
congruence lattices of universal algebras; first-order definable congruences; openly first-order definable congruences;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We prove some representation theorems for lattices and their lower subsemilattices as the lattices of congruences and subsemilattices of first-order definable congruences of universal algebras.
引用
收藏
页码：714 / 719
页数：5
相关论文
共 50 条
  • [1] On the subsemilattices of first-order definable and openly first-order definable congruences of the congruence lattice of a universal algebra
    Pinus, A. G.
    SIBERIAN MATHEMATICAL JOURNAL, 2006, 47 (04) : 714 - 719
  • [2] First-Order Definable Counting-Only Queries
    Hellings, Jelle
    Gyssens, Marc
    Van Gucht, Dirk
    Wu, Yuqing
    FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS, FOIKS 2018, 2018, 10833 : 225 - 243
  • [3] First-order definable counting-only queries
    Hellings, Jelle
    Gyssens, Marc
    Van Gucht, Dirk
    Wu, Yuqing
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2019, 87 (1-2) : 109 - 136
  • [4] On existentially first-order definable languages and their relation to NP
    Borchert, B
    Kuske, D
    Stephan, F
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1999, 33 (03): : 259 - 269
  • [5] First-order definable counting-only queries
    Jelle Hellings
    Marc Gyssens
    Dirk Van Gucht
    Yuqing Wu
    Annals of Mathematics and Artificial Intelligence, 2019, 87 : 109 - 136
  • [6] Learning Concepts Definable in First-Order Logic with Counting
    van Bergerem, Steffen
    2019 34TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2019,
  • [7] The Modal Formula (†) □◊p ⊃ □◊□◊p Is Not First-Order Definable
    Karatay, Ali
    LOGIC, LANGUAGE, AND COMPUTATION, 2009, 5422 : 221 - 228
  • [8] On Computing the Measures of First-Order Definable Sets of Trees
    Przybylko, Marcin
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2018, (277): : 206 - 219
  • [9] Approximation schemes for first-order definable optimisation problems
    Dawar, Anuj
    Grohe, Martin
    Kreutzer, Stephan
    Schweikardt, Nicole
    21ST ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2006, : 411 - +
  • [10] Quantifier hierarchies over the first-Order definable tree languages
    沈云付
    Science China Technological Sciences, 1996, (03) : 322 - 336
12345