A model theoretic proof of completeness of an axiomatization of monadic second-order logic on infinite words

DOI10.1007/978-3-642-33475-7_22MaRDI QIDQ2915178zbMATH OpenOpenAlexFDO

Authors Colin Riba

Publication date 21 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33475-7_22

zbMATH Keywords

Ehrenfeucht-Fraïssé methodFeferman-Vaught fusionHenkin models of MSOLmonadic second-order logic (MSOL)Siefkes' completeness theorem

Mathematics Subject Classification ID

Recommendations

• A complete axiomatization of MSO on infinite trees
• A model-theoretic characterization of monadic second order logic on infinite words
• Complete axiomatizations of fragments of monadic second-order logic on finite trees
• Forcing MSO on infinite words in weak MSO
• Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees

Cited in

(7)

• A complete axiomatization of MSO on infinite trees
• scientific article; zbMATH DE number 7204449 (Why is no real title available?)
• A functional (monadic) second-order theory of infinite trees
• scientific article; zbMATH DE number 7147442 (Why is no real title available?)
• Forcing MSO on infinite words in weak MSO
• A model-theoretic characterization of monadic second order logic on infinite words
• On the completeness and the decidability of strictly monadic second‐order logic

This page was built for publication: A model theoretic proof of completeness of an axiomatization of monadic second-order logic on infinite words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915178)