Effective metric model theory
-
Published:2014-11-24
Issue:8
Volume:25
Page:1779-1798
-
ISSN:0960-1295
-
Container-title:Mathematical Structures in Computer Science
-
language:en
-
Short-container-title:Math. Struct. Comp. Sci.
Author:
POURMAHDIAN MASOUD,TAVANA NAZANIN R.,DIDEHVAR FARZAD
Abstract
This paper is a further investigation of a project carried out in Didehvar and Ghasemloo (2009) to study effective aspects of the metric logic. We prove an effective version of the omitting types theorem. We also present some concrete computable constructions showing that both the separable atomless probability algebra and the rational Urysohn space are computable metric structures.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference12 articles.
1. A proof of completeness for continuous first-order logic
2. Computable Analysis
3. Model theory for metric structures, model theory with applications to algebra and analysis;Ben Yaacov;London Mathematical Society lecture Note Series 350,2008
4. Model Theory