Completeness by forcing

Daniel Gǎiň, Marius Petria

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)


The completeness of the infinitary language ℒ ω1,ω was proved by Carol Karp in 1964.We express and prove the completeness of infinitary first-order logics in the institution-independent setting by using forcing, a powerful method for constructing models. As a consequence of this abstraction, the completeness theorem becomes available for the infinitary versions of many 'first order' logical systems that appear in the area of logic or computer science.

Original languageEnglish
Pages (from-to)1165-1186
Number of pages22
JournalJournal of Logic and Computation
Issue number6
Publication statusPublished - Dec 2010
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Arts and Humanities (miscellaneous)
  • Hardware and Architecture
  • Logic


Dive into the research topics of 'Completeness by forcing'. Together they form a unique fingerprint.

Cite this