Strong completeness for iteration-free coalgebraic dynamic logics

2014

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

Additional Metadata
THEME	Software (theme 1)
Publisher	Springer
Persistent URL	doi.org/10.1007/978-3-662-44602-7_22
Series	Lecture Notes in Computer Science
Conference	IFIP International Conference on Theoretical Computer Science
Organisation	Computer Security
Citation APA APA Style APA-ALL Style AAA 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., Kupke, C.& Leal, R. A. (2014). Strong completeness for iteration-free coalgebraic dynamic logics. Proceedings of IFIP International Conference on Theoretical Computer Science 2014 (TCS 0), 282–295.https://doi.org/10.1007/978-3-662-44602-7_22

Publication