Strong completeness for iteration-free coalgebraic dynamic logics

2014-01-01

Presented at the IFIP International Conference on Theoretical Computer Science, Rome, Italy

Additional Metadata
THEME	Software (theme 1)
Publisher	Springer
Persistent URL	dx.doi.org/10.1007/978-3-662-44602-7_22
Series	Lecture Notes in Computer Science
Conference	IFIP International Conference on Theoretical Computer Science
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Hansen, H.H, Kupke, C.A, & Leal, R.A. (2014). Strong completeness for iteration-free coalgebraic dynamic logics. In Proceedings of IFIP International Conference on Theoretical Computer Science 2014 (TCS 0) (pp. 282–295). Springer. doi:10.1007/978-3-662-44602-7_22

Publication