Computer Science Logic

DOI10.1007/b13224zbMath1116.03328OpenAlexW2623947920MaRDI QIDQ5292653

Andrei Voronkov, Larisa L. Maksimova

Publication date: 21 June 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13224

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) Other algebras related to logic (03G25) Interpolation, preservation, definability (03C40) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (5)

LC and Its Pretabular Relatives ⋮ Unification in pretabular extensions of S4 ⋮ A note on the complexity of S4.2 ⋮ The tabularity problem over the minimal logic ⋮ Definability and interpolation in non-classical logics

This page was built for publication: Computer Science Logic