Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words

DOI10.1016/j.jcss.2023.04.002OpenAlexW4365143811MaRDI QIDQ6098157

Bharat Adsul, A. V. Sreejith, Saptarshi Sarkar

Publication date: 12 June 2023

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2023.04.002

zbMATH Keywords

first-order logicalgebraic structureslinear orderingsformal language theorycountable wordsKrohn-Rhodes theoremblock product

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete algebraic methods. Arithmetic, cryptography, automata and groups
• The monadic theory of order
• Varieties
• First-order logic and its infinitary quantifier extensions over countable words
• Algebraic Characterization of FO for Scattered Linear Orderings
• Limited Set quantifiers over Countable Linear Orderings
• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
• Two-Variable Logic over Countable Linear Orderings
• AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS
• Logic Meets Algebra: the Case of Regular Languages
• On finite monoids having only trivial subgroups
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words