Bounded Model Construction for Monadic Second-Order Logics

This publication has 15 references indexed in Scilit:

• A Theory of Restrictions for Logics and Automata
  Published by Springer Nature ,1999
• Mosel: A sound and efficient tool for M2L(Str)
  Lecture Notes in Computer Science, 1997
• SATO: An efficient propositional prover
  Lecture Notes in Computer Science, 1997
• Resolution for Quantified Boolean Formulas
  Information and Computation, 1995
• STeP: The Stanford Temporal Prover
  Lecture Notes in Computer Science, 1995
• Automata on Infinite Objects
  Published by Elsevier ,1990
• Weak monadic second order theory of succesor is not elementary-recursive
  Lecture Notes in Mathematics, 1975
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• Decision problems of finite automata design and related arithmetics
  Transactions of the American Mathematical Society, 1961
• Weak Second‐Order Arithmetic and Finite Automata
  Mathematical Logic Quarterly, 1960