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 Σ⊨φ (if and) only if Σ⊢φ∸ 2-n for all n < ω. This approximated form of strong completeness asserts that if Σ⊨φ, 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 φT∘ is uniformly recursive from φ, where φT∘ 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)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
A Proof of Completeness for Continuous First-Order Logic.Itaï Ben Yaacov & Arthur Paul Pedersen - 2010 - Journal of Symbolic Logic 75 (1):168-190.
The Mathematics of Logic: A Guide to Completeness Theorems and Their Applications.Richard Kaye - 2007 - Cambridge University Press.
Pure Second-Order Logic with Second-Order Identity.Alexander Paseau - 2010 - Notre Dame Journal of Formal Logic 51 (3):351-360.
First-Order Logic, Second-Order Logic, and Completeness.Marcus Rossberg - 2004 - In Vincent Hendricks, Fabian Neuhaus, Stig Andur Pedersen, Uwe Scheffler & Heinrich Wansing (eds.), First-Order Logic Revisited. Logos. pp. 303-321.
Undecidability and Intuitionistic Incompleteness.D. C. McCarty - 1996 - Journal of Philosophical Logic 25 (5):559 - 565.
Completeness and Categoricity: Frege, Gödel and Model Theory.Stephen Read - 1997 - History and Philosophy of Logic 18 (2):79-93.
Topometric Spaces and Perturbations of Metric Structures.Ben Yaacov Itaï - 2008 - Logic and Analysis 1 (3-4):235-272.
A Note on Generalized Functional Completeness in the Realm of Elementrary Logic.Henri Galinon - 2009 - Bulletin of the Section of Logic 38 (1):1-9.
On Canonicity and Strong Completeness Conditions in Intermediate Propositional Logics.Silvio Ghilardi & Pierangelo Miglioli - 1999 - Studia Logica 63 (3):353-385.
Intuitionistic Completeness for First Order Classical Logic.Stefano Berardi - 1999 - Journal of Symbolic Logic 64 (1):304-312.
Added to index2010-09-14
Total downloads19 ( #259,992 of 2,172,708 )
Recent downloads (6 months)1 ( #325,028 of 2,172,708 )
How can I increase my downloads?