A finite model theorem for the propositional ?-calculus
- 1 September 1988
- journal article
- Published by Springer Nature in Studia Logica
- Vol. 47 (3) , 233-241
- https://doi.org/10.1007/bf00370554
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The propositional mu-calculus is elementaryPublished by Springer Nature ,1984
- A decision procedure for the propositional μ-calculusPublished by Springer Nature ,1984
- Results on the propositional μ-calculusPublished by Springer Nature ,1982
- A decidable mu-calculus: Preliminary reportPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Propositional Dynamic Logic of looping and conversePublished by Association for Computing Machinery (ACM) ,1981
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979
- Well-quasi-orderings and sets of finite sequencesMathematical Proceedings of the Cambridge Philosophical Society, 1976
- On better-quasi-ordering transfinite sequencesMathematical Proceedings of the Cambridge Philosophical Society, 1968
- On well-quasi-ordering infinite treesMathematical Proceedings of the Cambridge Philosophical Society, 1965