# A proof of completeness for continuous first-order logic

Journal of Symbolic Logic 75 (1):168-190 (2010)
Abstract
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of "algebraic" structures (such as fields, group, and graphs) to various natural classes of complete metric structures (such as probability algebras, Hilbert spaces, and Banach spaces). With research in continuous first-order logic preoccupied with studying the model theory of this framework, we find a natural question calls for attention. Is there an interesting set of axioms yielding a completeness result? The primary purpose of this article is to show that a certain, interesting set of axioms does indeed yield a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely) satisfiable if (and only if) it is consistent. From this result it follows that continuous first-order logic also satisfies an approximated form of strong completeness, whereby $\Sigma \vDash \varphi$ (if and) only if $\Sigma \vdash \varphi \overset \cdot \to{-}2^{-n}$ for all n < ω. This approximated form of strong completeness asserts that if $\Sigma \vDash \varphi$ , then proofs from Σ, being finite, can provide arbitrarily better approximations of the truth of φ. Additionally, we consider a different kind of question traditionally arising in model theory—that of decidability. When is the set of all consequences of a theory (in a countable, recursive language) recursive? Say that a complete theory T is decidable if for every sentence φ, the value φ T is a recursive real, and moreover, uniformly computable from φ. If T is incomplete, we say it is decidable if for every sentence φ the real number $\varphi _{T}^{\circ}$ is uniformly recursive from φ, where $\varphi _{T}^{\circ}$ is the maximal value of φ consistent with T. As in classical first-order logic, it follows from the completeness theorem of continuous first-order logic that if a complete theory admits a recursive (or even recursively enumerable) axiomatization then it is decidable
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1264433914
Options
 Save to my reading list Follow the author(s) My bibliography Export citation Find it on Scholar Edit this record Mark as duplicate Revision history Request removal from index

 PhilPapers Archive Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,651 External links Setup an account with your affiliations in order to access resources via your University's proxy server Configure custom proxy (use this if your affiliation does not provide a proxy) Through your library Sign in / register to customize your OpenURL resolver.Configure custom resolver
References found in this work BETA
Itay Ben-Yaacov (2003). Simplicity in Compact Abstract Theories. Journal of Mathematical Logic 3 (02):163-191.
Jan Pavelka (1979). On Fuzzy Logic III. Semantical Completeness of Some Many-Valued Propositional Calculi. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (25-29):447-464.
Citations of this work BETA

No citations found.

Similar books and articles
Peter Milne (2008). Russell's Completeness Proof. History and Philosophy of Logic 29 (1):31-62.
D. C. McCarty (1996). Undecidability and Intuitionistic Incompleteness. Journal of Philosophical Logic 25 (5):559 - 565.

2010-09-12

11 ( #380,390 of 1,902,751 )