Block products for algebras over countable words and applications to logic

We propose a seamless integration of the block product operation to the recently developed algebraic framework for regular languages of countable words. A simple but subtle accompanying block product principle has been established. Building on this, we generalize the well-known algebraic characterizations of first-order logic (resp. first-order logic with two variables) in terms of strongly (resp. weakly) iterated block products. We use this to arrive at a complete analogue of Schiitzenberger-McNaughton-Papert theorem for countable words. We also explicate the role of block products for linear temporal logic by formulating a novel algebraic characterization of a natural fragment.

[1]  Amaldev Manuel,et al.  Two-Variable Logic over Countable Linear Orderings , 2016, MFCS.

[2]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[3]  Countably Complementable,et al.  LINEAR ORDERINGS , 2006 .

[4]  Robert McNaughton,et al.  Counter-Free Automata (M.I.T. research monograph no. 65) , 1971 .

[5]  Howard Straubing,et al.  Weakly Iterated Block Products of Finite Monoids , 2002, LATIN.

[6]  Thomas Wilke,et al.  Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy , 2001, SIAM J. Comput..

[7]  Neil Immerman,et al.  Structure Theorem and Strict Alternation Hierarchy for FO2 on Words , 2006, Circuits, Logic, and Games.

[8]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[9]  Thomas Wilke,et al.  Nesting Until and Since in Linear Temporal Logic , 2002, Theory of Computing Systems.

[10]  Thomas Wilke,et al.  An Algebraic Theory for Regular Languages of Finite and Infinite Words , 1993, Int. J. Algebra Comput..

[11]  Nivat G. Päun,et al.  Handbook of Formal Languages , 2013, Springer Berlin Heidelberg.

[12]  Olivier Carton,et al.  Algebraic Characterization of FO for Scattered Linear Orderings , 2011, CSL.

[13]  Olivier Carton,et al.  Wreath product and infinite words , 2000 .

[14]  Véronique Bruyère,et al.  Automata on linear orderings , 2007, J. Comput. Syst. Sci..

[15]  Olivier Carton,et al.  Complementation of rational sets on countable scattered linear orderings , 2005, Int. J. Found. Comput. Sci..

[16]  Thomas Colcombet,et al.  AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS , 2017, The Journal of Symbolic Logic.

[17]  D. Peled,et al.  Temporal Logic: Mathematical Foundations and Computational Aspects, Volume 1 , 1995 .

[18]  Olivier Carton,et al.  Logic and Rational Languages of Words Indexed by Linear Orderings , 2008, CSR.

[19]  Marcel Paul Schützenberger,et al.  On Finite Monoids Having Only Trivial Subgroups , 1965, Inf. Control..

[20]  Thomas Colcombet,et al.  Limited Set quantifiers over Countable Linear Orderings , 2015, ICALP.

[21]  Paul Gastin,et al.  A Survey on Small Fragments of First-Order Logic over Finite Words , 2008, Int. J. Found. Comput. Sci..

[22]  Denis Thérien,et al.  Logic Meets Algebra: the Case of Regular Languages , 2007, Log. Methods Comput. Sci..

[23]  Colin Stirling,et al.  Modal and temporal logics , 1993, LICS 1993.