Decidability of S1S and S2S

DOI10.1007/3-540-36387-4_12MaRDI QIDQ4412835zbMATH OpenOpenAlexFDO

Authors Mark Weyer

Publication date 16 July 2003

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

Full work available at URL https://doi.org/10.1007/3-540-36387-4_12

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Recommendations

• Automatentheorie und Logik
• Automata theory and its applications
• scientific article; zbMATH DE number 5872401
• scientific article; zbMATH DE number 626030
• scientific article; zbMATH DE number 2206111

Cited in

(9)

• scientific article; zbMATH DE number 5999552 (Why is no real title available?)
• PDL for ordered trees
• scientific article; zbMATH DE number 1189064 (Why is no real title available?)
• On the model-checking of monadic second-order formulas with edge set quantifications
• scientific article; zbMATH DE number 709536 (Why is no real title available?)
• scientific article; zbMATH DE number 1159716 (Why is no real title available?)
• The Complexity of Translating Logic to Finite Automata
• Binary extensions of S1S and the composition method
• A model-theoretic characterization of monadic second order logic on infinite words

This page was built for publication: Decidability of S1S and S2S

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