New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures-Reference-Cited by-同舟云学术

New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures

Published:2010 Issue: Volume: Page:366-380
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Ganzow Tobias,Kaiser Łukasz

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15205-4_29.pdf

Reference14 articles.

1. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: International Congress on Logic, Methodology and Philosophy of Science, pp. 1–11. Stanford University Press, Standford (1962)

2. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society 141, 1–35 (1969)

3. Courcelle, B.: The monadic second order logic of graphs, II: Infinite graphs of bounded width. Mathematical System Theory 21, 187–222 (1989)

4. Lecture Notes in Computer Science;D.A. Basin,1995

5. Jensen, J.L., Jørgensen, M.E., Klarlund, N., Schwartzbach, M.I.: Automatic verification of pointer programs using monadic second-order logic. In: Proceedings of PLDI 1997, pp. 226–236 (1997)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Automata Terms in a Lazy WSkS Decision Procedure;Journal of Automated Reasoning;2021-08-03

2. RECURSION SCHEMES, THE MSO LOGIC, AND THE U QUANTIFIER;LOG METH COMPUT SCI;2020

3. Automata Terms in a Lazy WSkS Decision Procedure;Lecture Notes in Computer Science;2019

4. Nested antichains for WS1S;Acta Informatica;2019-01-01

5. Recursion Schemes and the WMSO plus U Logic;LEIBNIZ INT PR INFOR;2018