Name
Abstract | ||
|---|---|---|
The completeness of the infinitary language Lω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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1093/logcom/exq012 | J. Log. Comput. |
Keywords | Field | DocType |
infinitary version,infinitary language,powerful method,logical system,infinitary first-order logic,computer science,carol karp,completeness theorem | Discrete mathematics,Abstraction,Gödel's completeness theorem,First order,Forcing (mathematics),Completeness (statistics),Calculus,Mathematics | Journal |
Volume | Issue | ISSN |
20 | 6 | 0955-792X |
Citations | PageRank | References |
3 | 0.37 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Găină | 1 | 42 | 5.30 |
| Marius Petria | 2 | 18 | 2.04 |