A proof of completeness for continuous first-order logic
From MaRDI portal
Publication:5190194
DOI10.2178/jsl/1264433914zbMath1194.03028arXiv0903.4051OpenAlexW3101258384MaRDI QIDQ5190194
Arthur Paul Pedersen, Itaï Ben Yaacov
Publication date: 15 March 2010
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.4051
Related Items
UNDECIDABILITY AND NON-AXIOMATIZABILITY OF MODAL MANY-VALUED LOGICS ⋮ A note on infinitary continuous logic ⋮ Omitting types in logic of metric structures ⋮ 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 ⋮ COMPUTABILITY AND THE CONNES EMBEDDING PROBLEM ⋮ 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 ⋮ On theories of random variables ⋮ A completeness theorem for continuous predicate modal logic ⋮ Continuous propositional modal logic ⋮ (Dual) Hoops Have Unique Halving ⋮ Metric structures and probabilistic computation ⋮ Effective metric model theory ⋮ The eal truth ⋮ The Connes embedding problem: A guided tour
Cites Work
- Unnamed Item
- Nonstandard hulls of Banach spaces
- Metamathematics of fuzzy logic
- Algebraic foundations of many-valued reasoning
- 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
This page was built for publication: A proof of completeness for continuous first-order logic