Substructural propositional dynamic logics
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F19%3A00505159" target="_blank" >RIV/67985807:_____/19:00505159 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-662-59533-6_36" target="_blank" >http://dx.doi.org/10.1007/978-3-662-59533-6_36</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-662-59533-6_36" target="_blank" >10.1007/978-3-662-59533-6_36</a>
Alternative languages
Result language
angličtina
Original language name
Substructural propositional dynamic logics
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/EF17_050%2F0008361" target="_blank" >EF17_050/0008361: Enhancing human resources for research in theoretical computer science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Logic, Language, Information, and Computation
ISBN
978-3-662-59532-9
ISSN
0302-9743
e-ISSN
—
Number of pages
16
Pages from-to
594-609
Publisher name
Springer
Place of publication
Berlin
Event location
Utrecht
Event date
Jul 2, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—