Expressive power of infinitary [0,1]-logics
From MaRDI portal
Publication:5221578
Abstract: We consider model-theoretic properties related to the expressive power of three analogues of for metric structures. We give an example showing that one of these infinitary logics is strictly more expressive than the other two, but also show that all three have the same elementary equivalence relation for complete separable metric structures. We then prove that a continuous function on a complete separable metric structure is automorphism invariant if and only if it is definable in the more expressive logic. Several of our results are related to the existence of Scott sentences for complete separable metric structures.
Recommendations
Cited in
(13)- Expressive power and incompleteness of propositional logics
- Infinitary logics and 0-1 laws
- Omitting uncountable types and the strength of \([0,1]\)-valued logics
- Hyperarithmetic numerals
- Games and Scott sentences for positive distances between metric structures
- Involutive uninorm logic with the \(n\)-potency axiom
- On the complexity of the theory of a computably presented metric structure
- Pseudofinite and pseudocompact metric structures
- On the Expressive Power of Cost Logics over Infinite Words
- Two applications of topology to model theory
- scientific article; zbMATH DE number 6476595 (Why is no real title available?)
- Omitting types for infinitary \([0,1]\)-valued logic
- Deciding simple infinity axiom sets with one binary relation by means of superpostulates
This page was built for publication: Expressive power of infinitary \([0,1]\)-logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221578)