Completeness by Forcing

DOI10.1093/logcom/exq012zbMath1233.03063OpenAlexW1984536496MaRDI QIDQ3069725

Daniel Găină, Marius Petria

Publication date: 19 January 2011

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exq012

zbMATH Keywords

forcingproof theoryfirst-order completenessinstitutional model theory

Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Other infinitary logic (03C75) Abstract model theory (03C95)

Related Items

Foundations of logic programming in hybrid logics with user-defined sharing, Birkhoff style calculi for hybrid logics, Abstract categorical logic, Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally, Saturated models in institutions, 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