An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic

被引：2
|
作者：
Krebs, Andreas [1 ]
Straubing, Howard [2 ]
机构：
[1] Univ Tubingen, Wilhelm Schickard Inst, Sand 13, D-72076 Tubingen, Germany
[2] Boston Coll, Comp Sci Dept, Chestnut Hill, MA 02467 USA
来源：
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC | 2017年 / 18卷 / 04期
关键词：
FO2; Quantifier Alternation; J; Pseudovarities; Identities; CATEGORIES;
D O I：
10.1145/3149822
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We give an algebraic characterization, based on the bilateral semidirect product of finite monoids, of the quantifier alternation hierarchy in two-variable first-order logic on finite words. As a consequence, we obtain a new proof that this hierarchy is strict. Moreover, by application of the theory of finite categories, we are able to make our characterization effective: that is, there is an algorithm for determining the exact quantifier alternation depth for a given language definable in two-variable logic.
引用
收藏
页数：22
相关论文
共 50 条
  • [21] Two-Variable Separation Logic and Its Inner Circle
    Demri, Stephane
    Deters, Morgan
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2015, 16 (02)
  • [22] Two-Variable Logic on Data Trees and XML Reasoning
    Bojanczyk, Mikoaj
    Muscholl, Anca
    Schwentick, Thomas
    Segoufin, Luc
    JOURNAL OF THE ACM, 2009, 56 (03)
  • [23] Order-Invariance of Two-Variable Logic is Decidable
    Zeume, Thomas
    Harwath, Frederik
    PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016), 2016, : 807 - 816
  • [24] Towards a more efficient approach for the satisfiability of two-variable logic
    Lin, Ting-Wei
    Lu, Chia-Hsuan
    Tan, Tony
    2021 36TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2021,
  • [25] Register Automata with Extrema Constraints, and an Application to Two-Variable Logic
    Torunczyk, Szymon
    Zeume, Thomas
    PROCEEDINGS OF THE 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020), 2020, : 873 - 885
  • [26] TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY
    Andreka, Hajnal
    Nemeti, Istvan
    JOURNAL OF SYMBOLIC LOGIC, 2021, 86 (02) : 785 - 800
  • [27] On the boundedness problem for two-variable first-order logic
    Kolaitis, PG
    Otto, M
    THIRTEENTH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1998, : 513 - 524
  • [28] Linear circuits, two-variable logic and weakly blocked monoids
    Behle, Christoph
    Krebs, Andreas
    Mercer, Mark
    THEORETICAL COMPUTER SCIENCE, 2013, 501 : 20 - 33
  • [29] Communicating Finite-State Machines and Two-Variable Logic
    Bollig, Benedikt
    Fortin, Marie
    Gastin, Paul
    35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
  • [30] Linear circuits, two-variable logic and weakly blocked monoids
    Behle, Christoph
    Krebs, Andreas
    Mercer, Mark
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS, 2007, 4708 : 147 - +
12345