Generalized effective completeness for continuous logic
From MaRDI portal
Publication:6091635
Abstract: In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows that any decidable theory is satisfied by a computably presentable structure. This modifies and extends previous partial effective completeness theorems for continuous logic given by Calvert and Didehvar, Ghasemloo, and Pourmahdian.
Cites work
- A proof of completeness for continuous first-order logic
- Computably Isometric Spaces
- Continuous first order logic and local stability
- Degrees of and lowness for isometric isomorphism
- Effectiveness in RPL, with applications to continuous logic
- Foundations of recursive model theory
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- Metric structures and probabilistic computation
- Model theory for metric structures
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
Cited in
(2)
This page was built for publication: Generalized effective completeness for continuous logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091635)