Strong completeness for iteration-free coalgebraic dynamic logics

H. Hansen, C Kupke, R Andres Leal

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientific

6 Citations (Scopus)
Original languageEnglish
Title of host publicationTheoretical Computer Science : 8th IFIP TC 1/WG 2.2 International Conference, TCS
EditorsJ Diaz, I Lanese, D Sangiorgi
Place of PublicationBerlin
PublisherSpringer
Pages281-295
Number of pages15
ISBN (Print)978-3-662-44601-0
DOIs
Publication statusPublished - 2014
EventTheoretical Computer Science (IFIP-TCS 2014), Rome, Italy - Berlin
Duration: 1 Sep 20143 Sep 2014

Publication series

Name
PublisherSpringer
NameLecture Notes in Computer Science
Volume8705
ISSN (Print)0302-9743

Conference

ConferenceTheoretical Computer Science (IFIP-TCS 2014), Rome, Italy
Period1/09/143/09/14

Cite this

Hansen, H., Kupke, C., & Andres Leal, R. (2014). Strong completeness for iteration-free coalgebraic dynamic logics. In J. Diaz, I. Lanese, & D. Sangiorgi (Eds.), Theoretical Computer Science : 8th IFIP TC 1/WG 2.2 International Conference, TCS (pp. 281-295). (Lecture Notes in Computer Science; Vol. 8705). Springer. https://doi.org/10.1007/978-3-662-44602-7_22