A proof of completeness for continuous first-order logic

DOI10.2178/JSL/1264433914MaRDI QIDQ5190194zbMATH OpenOpenAlexFDO

Authors Itaï Ben Yaacov, Arthur Paul Pedersen

Publication date 15 March 2010

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0903.4051

zbMATH Keywords

completenesscontinuous logic

Mathematics Subject Classification ID

Many-valued logic (03B50) Basic properties of first-order languages and structures (03C07)

Abstract: The primary purpose of this article is to show that a certain natural set of axioms yields 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 emph{approximated} form of strong completeness, whereby $SigmavDashvarphi$ (if and) only if $Sigmavdashvarphidotminus{2}^{-n}$ for all $n<omega$. This approximated form of strong completeness asserts that if $SigmavDashvarphi$, then proofs from $Sigma$, being finite, can provide arbitrary better approximations of the truth of $varphi$.

Recommendations

• Model theory for metric structures
• Completeness for linear continuous logic
• Continuous first order logic and local stability
• scientific article; zbMATH DE number 7184880
• A completeness theorem for continuous predicate modal logic

Cites work

• A mathematical introduction to logic.
• Algebraic foundations of many-valued reasoning
• Metamathematics of fuzzy logic
• Nonstandard hulls of Banach spaces
• On Fuzzy Logic III. Semantical completeness of some many‐valued propositional calculi
• POSITIVE MODEL THEORY AND COMPACT ABSTRACT THEORIES
• SIMPLICITY IN COMPACT ABSTRACT THEORIES
• Uncountable dense categoricity in cats

Cited in

(37)

• A completeness theorem for continuous predicate modal logic
• Completeness for systems including real numbers
• On theories of random variables
• A predicate extension of real valued logic
• Retracted article: ``A completeness theorem for continuous predicate modal logic
• Decision procedures for the conditions true in certain metric structures
• The Keisler order in continuous logic
• Continuous Markovian logic -- from complete axiomatization to the metric space of formulas
• Continuous first order logic and local stability
• Completeness for linear continuous logic
• A note on infinitary continuous logic
• Algebraic closure in continuous logic
• Model theory for metric structures
• Omitting types in logic of metric structures
• Continuous propositional modal logic
• scientific article; zbMATH DE number 1910376 (Why is no real title available?)
• (Dual) hoops have unique halving
• UNDECIDABILITY AND NON-AXIOMATIZABILITY OF MODAL MANY-VALUED LOGICS
• A Maximality Theorem for Continuous First Order Theories
• The \(\mathbb{R}\)eal truth
• A sound and complete axiomatization of delimited continuations
• Continuous first order logic for unbounded metric structures
• Computability and the Connes embedding problem
• Metric structures and probabilistic computation
• Effective metric model theory
• The Connes embedding problem: a guided tour
• scientific article; zbMATH DE number 7655660 (Why is no real title available?)
• Continuous theory of operator expansions of finite dimensional Hilbert spaces and decidability
• Generalized effective completeness for continuous logic
• COMPUTABLY COMPACT METRIC SPACES
• Effectiveness in RPL, with applications to continuous logic
• The universal theory of the hyperfinite \(\mathrm{II}_1\) factor is not computable
• Computable presentations of C*-algebras
• Propositional logics for the Lawvere quantale
• Undecidability and incompleteness in quantum information theory and operator algebras
• Hyperarithmetic numerals
• The universal theory of locally universal tracial von Neumann algebras is not computable

This page was built for publication: A proof of completeness for continuous first-order logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5190194)