An Institutional Version of Gödel’s Completeness Theorem

DOI10.1007/978-3-540-73859-6_28zbMath1214.03058OpenAlexW2027681638MaRDI QIDQ3612504

Marius Petria

Publication date: 10 March 2009

Published in: Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73859-6_28

Mathematics Subject Classification ID

Categorical logic, topoi (03G30)

Related Items (6)

Soundness and completeness proofs by coinductive methods ⋮ Birkhoff style calculi for hybrid logics ⋮ Abstract categorical logic ⋮ Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally ⋮ Logical dual concepts based on mathematical morphology in stratified institutions: applications to spatial reasoning ⋮ Omitting types theorem in hybrid dynamic first-order logic with rigid symbols

This page was built for publication: An Institutional Version of Gödel’s Completeness Theorem