Zobrazeno 1 - 2
of 2
pro vyhledávání: '"03F45 (primary), 03D15 (secondary)"'
We show that the decision problem for the basic system of interpretability logic IL is PSPACE-complete. For this purpose we present an algorithm which uses polynomial space with respect to the complexity of a given formula. The existence of such algo
Externí odkaz:
http://arxiv.org/abs/1710.05599
We show that the decision problem for the basic system of interpretability logic IL is PSPACE-complete. For this purpose we present an algorithm which uses polynomial space with respect to the complexity of a given formula. The existence of such algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a31f82ce74dea096b1c77eab8d9cc0f
https://www.bib.irb.hr/983020
https://www.bib.irb.hr/983020