Publisher
Springer Science and Business Media LLC
Subject
History and Philosophy of Science,Logic
Reference11 articles.
1. M. J. Fischer and R. E. Ladner, Prepositional Dynamic Logic of regular programs, J. Comput. Syst. Sci. 18:2 (1979), pp. 194?211.
2. D. Kozen, Results on the propositional ?-calculus, in: E. Schmidt (ed.), Proc. 9th Int. Colloq. Automata, Languages, and Programming 1982, Lect. Notes in Comput. Sci. 140, Springer, 1982, pp. 348?359.
3. D. Kozen and R. Parikh, A decision procedure for the propositional ?-calculus, in: E. Clarke and D. Kozen (eds.), Proc. Workshop on Logics of Programs 1983, Lect. Notes in Comput. Sci. 164, Springer, 1984, pp. 313?326.
4. R. Laver, Well-quasi-ordering s and sets of finite sequences, Proc. Camb. Phil. Soc. 79 (1976), pp. 1?10.
5. R. Laver, Better-quasi-orderings and a class of trees, in: Studies in Foundations and Combinatorics, Advances in Mathematics Supplementary Studies, v.1 (1978), pp. 31?48.
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献