Completeness and Decidability Results for Hybrid(ised) Logics

DOI10.1007/978-3-319-15075-8_10zbMath1335.68145MaRDI QIDQ2797868

Manuel A. Martins, Luís Soares Barbosa, Renato Neves

Publication date: 1 April 2016

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

Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/6821

zbMATH Keywords

completeness; institutions; decidability; hybrid logic

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

03B70: Logic in computer science

68Q60: Specification and verification (program logics, model checking, etc.)

03B25: Decidability of theories and sets of sentences

03B62: Combined logics