The Completeness Theorem

Lorenz Halbeisen and Regula Krapf
Additional contact information
Lorenz Halbeisen: ETH Zürich, Departement Mathematik
Regula Krapf: Universität Koblenz-Landau, Institut für Mathematik

Chapter Chapter 5 in Gödel's Theorems and Zermelo's Axioms, 2020, pp 53-64 from Springer

Abstract: Abstract As in the previous chapter, we require that all formulae are written in Polish notation and that the variables are among v0, v1, v2, . . . Furthermore, let L be a countable signature, let T be a consistent L -theory, and let σ0 be an L -sentence which is not provable from T.

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-52279-7_5

Ordering information: This item can be ordered from
http://www.springer.com/9783030522797

DOI: 10.1007/978-3-030-52279-7_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().