Complexity of the interpretability logic IL

DOI10.1093/jigpal/jzy015zbMath1494.03092arXiv1710.05599OpenAlexW2963441991WikidataQ129808570 ScholiaQ129808570MaRDI QIDQ5241913

Mladen Vuković, Luka Mikec, Fedor N. Pakhomov

Publication date: 4 November 2019

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.05599

zbMATH Keywords

complexitydecidabilityinterpretability logicVeltman semanticsPSPACE

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

This page was built for publication: Complexity of the interpretability logic IL