Completeness by forcing

DOI10.1093/LOGCOM/EXQ012MaRDI QIDQ3069725zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

first-order completenessforcinginstitutional model theoryproof theory

Mathematics Subject Classification ID

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

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

Cited in

(14)

• Infinitary first-order categorical logic
• Birkhoff style calculi for hybrid logics
• Omitting types theorem in hybrid dynamic first-order logic with rigid symbols
• Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally
• Foundations of logic programming in hybrid logics with user-defined sharing
• scientific article; zbMATH DE number 3855082 (Why is no real title available?)
• scientific article; zbMATH DE number 3891338 (Why is no real title available?)
• Logical dual concepts based on mathematical morphology in stratified institutions: applications to spatial reasoning
• Abstract categorical logic
• Forcing, transition algebras, and calculi
• Non-deterministic algebraic rewriting as adjunction
• Title not available (Why is no real title available?)
• Using forcing to prove completeness of resolution and paramodulation
• Saturated models in institutions

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)