A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic.

DOI10.4230/LIPIcs.MFCS.2018.76OpenAlexW2889373466MaRDI QIDQ5005180

Erik Paul, Manfred Droste

Publication date: 4 August 2021

Full work available at URL: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2018.html#DrosteP18

zbMATH Keywords

quantitative logictransductiontranslation schemefeferman-vaught theoremquantitative model theory

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Feferman-vaught decompositions for prefix classes of first order logic

Cites Work

• Unnamed Item
• Algorithmic uses of the Feferman-Vaught theorem
• Existential MSO over two successors is strictly weaker than over linear orders
• Weighted automata and weighted logics with discounting
• The monadic theory of order
• Metamathematics of fuzzy logic
• Monadic second-order definable graph transductions: a survey
• Monadic second-order definable text languages
• Weighted automata and weighted logics
• The first order properties of products of algebraic systems
• An application of games to the completeness problem for formalized theories
• On the definition of a family of automata
• A lattice of chapters of mathematics (interpretations between theorems [theories)]
• Weighted Logics for Nested Words and Algebraic Formal Power Series
• Modest theory of short chains. I
• Weighted Specifications over Nested Words
• Effective optimization with weighted automata on decomposable trees
• Definable Transductions and Weighted Logics for Texts
• On the elementary theory of linear order
• On direct products of theories

This page was built for publication: A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic.