Pages that link to "Item:Q5190194"

The following pages link to A proof of completeness for continuous first-order logic (Q5190194):

Displaying 21 items.

• Metric structures and probabilistic computation (Q541224) (← links)
• Effectiveness in RPL, with applications to continuous logic (Q636319) (← links)
• A completeness theorem for continuous predicate modal logic (Q1712937) (← links)
• On theories of random variables (Q1955792) (← links)
• A predicate extension of real valued logic (Q2402962) (← links)
• Retracted article: ``A completeness theorem for continuous predicate modal logic'' (Q2408087) (← links)
• Decision procedures for the conditions true in certain metric structures (Q2415938) (← links)
• A note on infinitary continuous logic (Q3460523) (← links)
• Omitting types in logic of metric structures (Q4562435) (← links)
• Continuous propositional modal logic (Q4646652) (← links)
• (Dual) Hoops Have Unique Halving (Q4913866) (← links)
• UNDECIDABILITY AND NON-AXIOMATIZABILITY OF MODAL MANY-VALUED LOGICS (Q5052011) (← links)
• The eal truth (Q5179272) (← links)
• COMPUTABILITY AND THE CONNES EMBEDDING PROBLEM (Q5346695) (← links)
• Effective metric model theory (Q5740682) (← links)
• The Connes embedding problem: A guided tour (Q5868652) (← links)
• Continuous theory of operator expansions of finite dimensional Hilbert spaces and decidability (Q6047670) (← links)
• Generalized effective completeness for continuous logic (Q6091635) (← links)
• COMPUTABLY COMPACT METRIC SPACES (Q6170503) (← links)
• The universal theory of the hyperfinite \(\mathrm{II}_1\) factor is not computable (Q6636684) (← links)
• Computable presentations of C*-algebras (Q6642886) (← links)