Completeness by forcing

DOI10.1093/LOGCOM/EXQ012zbMATH Open1233.03063OpenAlexW1984536496MaRDI QIDQ3069725FDOQ3069725

Authors: 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

Recommendations

• Infinitary first-order categorical logic
• scientific article; zbMATH DE number 3855082
• Using forcing to prove completeness of resolution and paramodulation
• The Gödel completeness theorem for uncountable languages
• An Institutional Version of Gödel’s Completeness Theorem

zbMATH Keywords

proof theoryforcingfirst-order completenessinstitutional model theory

Mathematics Subject Classification ID

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

Cited In (10)

• Omitting types theorem in hybrid dynamic first-order logic with rigid symbols
• Infinitary first-order categorical logic
• Logical dual concepts based on mathematical morphology in stratified institutions: applications to spatial reasoning
• Birkhoff style calculi for hybrid logics
• Title not available (Why is that?)
• Saturated models in institutions
• Title not available (Why is that?)
• Foundations of logic programming in hybrid logics with user-defined sharing
• Abstract categorical logic
• Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally

This page was built for publication: Completeness by forcing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069725)