Effectiveness in RPL, with applications to continuous logic

Abstract In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of Łukasiewicz logic) and continuous logic, and prove effective versions of some related theorems in model theory. We show how to reduce continuous logic to rational Pavelka logic. We also define notions of computability and decidability of a model for logics with computable, but uncountable, set of truth values; we show that provability degree of a formula with respect to a linear theory is computable, and use this to carry out an effective Henkin construction. Therefore, for any effectively given consistent linear theory in continuous logic, we effectively produce its decidable model. This is the best possible, since we show that the computable model theory of continuous logic is an extension of computable model theory of classical logic. We conclude with noting that the unique separable model of a separably categorical and computably axiomatizable theory (such as that of a probability space or an L p Banach lattice) is decidable.

[1]  A. S. Troelstra,et al.  Constructivism in Mathematics, Volume 2 , 1991 .

[2]  C. Ward Henson,et al.  Model Theory with Applications to Algebra and Analysis: Model theory for metric structures , 2008 .

[3]  Abbas Edalat,et al.  Domains for Computation in Mathematics, Physics and Exact Real Arithmetic , 1997, Bulletin of Symbolic Logic.

[4]  Petr Hájek,et al.  Metamathematics of Fuzzy Logic , 1998, Trends in Logic.

[5]  Ker-I Ko,et al.  Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.

[6]  Edward R. Griffor.  Handbook of Computability Theory , 1999, Handbook of Computability Theory.

[7]  Abbas Edalat,et al.  A Domain-Theoretic Approach to Computability on the Real Line , 1999, Theor. Comput. Sci..

[8]  Jens Blanck.  Domain representations of topological spaces , 2000, Theor. Comput. Sci..

[9]  C. Ward Henson,et al.  Model-theoretic independence in the banach lattices Lp(µ) , 2009, 0907.5273.

[10]  Felipe Cucker,et al.  COMPLEXITY AND REAL COMPUTATION: A MANIFESTO , 1996 .

[11]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[12]  Marian Boykan Pour-El,et al.  Chapter 13 - The Structure of Computability in Analysis and Physical Theory: An Extension of Church's Thesis , 1999 .

[13]  J. V. Tucker,et al.  Computability on Topological Spaces via Domain Representations , 2008 .

[14]  V. Harizanov.  Pure computable model theory , 1998 .

[15]  Jens Blanck,et al.  Domain representations of topological spaces , 2000, COMPROX.

[16]  Alexander Usvyatsov,et al.  CONTINUOUS FIRST ORDER LOGIC AND LOCAL STABILITY , 2008, 0801.4303.

[17]  Anil Nerode,et al.  Effective completeness theorems for modal logic , 2004, Ann. Pure Appl. Log..

[18]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[19]  Marian Boykan Pour-El,et al.  Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.

[20]  Abbas Edalat,et al.  Computable Banach Spaces via Domain Theory , 1999, Theor. Comput. Sci..

[21]  Jens Blanck,et al.  Domain Representability of Metric Spaces , 1997, Ann. Pure Appl. Log..

[22]  Itay Ben-Yaacov,et al.  A proof of completeness for continuous first-order logic , 2009, The Journal of Symbolic Logic.

[23]  José Iovino,et al.  Model theoretic forcing in analysis , 2009, Ann. Pure Appl. Log..

[24]  A. Troelstra.  Constructivism in mathematics , 1988 .

[25]  M. Beeson.  Foundations of Constructive Mathematics , 1985 .

[26]  H. Jerome Keisler,et al.  Continuous Model Theory , 1966 .

[27]  Lawrence Welch,et al.  Recursive and Nonextendible Functions over the Reals; Filter Foundation for Recursive Analysis, II , 1999, Ann. Pure Appl. Log..

[28]  Terrence Millar.  Pure Recursive Model Theory , 1999, Handbook of Computability Theory.

[29]  Abbas Edalat,et al.  A Computational Model for Metric Spaces , 1998, Theor. Comput. Sci..

[30]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[31]  Lawrence Welch,et al.  Point-Free Topological Spaces, Functions and Recursive Points: Filter Foundation for Recursive Analysis I , 1998, Ann. Pure Appl. Log..

[32]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[33]  R. O. Gandy,et al.  COMPUTABILITY IN ANALYSIS AND PHYSICS (Perspectives in Mathematical Logic) , 1991 .

[34]  Andrea Sorbi,et al.  New Computational Paradigms: Changing Conceptions of What is Computable , 2007 .

[35]  Angus Macintyre,et al.  Trends in Logic , 2001 .

[36]  A. Grzegorczyk.  On the definitions of computable real continuous functions , 1957 .

[37]  Anil Nerode,et al.  Handbook of Recursive Mathematics , 1998 .