Substructural propositional dynamic logics

Authors: Igor Sedlár
Publication year: 2019
Publication type: Konferenční příspěvek (mezinárodní konf.)
Periodical: Logic, Language, Information, and Computation
Projects: Enhancing human resources for research in theoretical computer science
Bibliographic citation: SEDLÁR, Igor. Substructural propositional dynamic logics. In: IEMHOFF, R., MOORTGAT, M., DE QUEIROZ, R., eds. Logic, Language, Information, and Computation. Berlin: Springer, 2019, S. 594-609. Lecture Notes in Computer Science, 11541. ISBN 978-3-662-59532-9. ISSN 0302-9743
Dostupné z: doi:10.1007/978-3-662-59533-6_36
DOI: 10.1007/978-3-662-59533-6_36
ID: 505159

Abstract

We prove completeness and decidability of a version of Propositional Dynamic Logic where the underlying non-modal propositional logic is a substructural logic in the vicinity of the Full Distributive Non-associative Lambek Calculus. Extensions of the result to stronger substructural logics are briefly discussed.