On the maximality of logics with approximations

Journal of Symbolic Logic 66 (4):1909-1918 (2001)
  Copy   BIBTEX

Abstract

In this paper we analyze some aspects of the question of using methods from model theory to study structures of functional analysis.By a well known result of P. Lindström, one cannot extend the expressive power of first order logic and yet preserve its most outstanding model theoretic characteristics (e.g., compactness and the Löwenheim-Skolem theorem). However, one may consider extending the scope of first order in a different sense, specifically, by expanding the class of structures that are regarded as models (e.g., including Banach algebras or other structures of functional analysis), and ask whether the resulting extensions of first order model theory preserve some of its desirable characteristics.A formal framework for the study of structures based on Banach spaces from the perspective of model theory was first introduced by C. W. Henson in [8] and [6]. Notions of syntax and semantics for these structures were defined, and it was shown that using them one obtains a model theoretic apparatus that satisfies many of the fundamental properties of first order model theory. For instance, one has compactness, Löwenheim-Skolem, and omitting types theorems. Further aspects of the theory, namely, the fundamentals of stability and forking, were first introduced in [10] and [9].The classes of mathematical structures formally encompassed by this framework are normed linear spaces, possibly expanded with additional structure,e.g., operations, real-valued relations, and constants. This notion subsumes wide classes of structures from functional analysis. However, the restriction that the universe of a structure be a normed space is not necessary. (This restriction has a historical, rather than technical origin; specifically, the development of the theory was originally motivated by questions in Banach space geometry.) Analogous techniques can be applied if the universe is a metric space. Now, when the underlying metric topology is discrete, the resulting model theory coincides with first order model theory, so this logic extends first order in the sense described above. Furthermore, without any cost in the mathematical complexity, one can also work in multi-sorted contexts, so, for instance, one sort could be an operator algebra while another is. say, a metric space.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Approximations and truth spaces.Jean-Pierre Marquis - 1991 - Journal of Philosophical Logic 20 (4):375 - 401.
Maximality and consciousness.Trenton Merricks - 2003 - Philosophy and Phenomenological Research 66 (1):150-158.
A refutation theory.Tomasz Skura - 2009 - Logica Universalis 3 (2):293-302.
A simple maximality principle.Joel David Hamkins - 2003 - Journal of Symbolic Logic 68 (2):527-550.
Equivalential logics (II).Janusz Czelakowski - 1981 - Studia Logica 40 (4):355 - 372.

Analytics

Added to PP
2009-01-28

Downloads
26 (#595,031)

6 months
8 (#342,364)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Omitting uncountable types and the strength of [0,1]-valued logics.Xavier Caicedo & José N. Iovino - 2014 - Annals of Pure and Applied Logic 165 (6):1169-1200.
Categoricity in homogeneous complete metric spaces.Åsa Hirvonen & Tapani Hyttinen - 2009 - Archive for Mathematical Logic 48 (3-4):269-322.
Maximality of linear continuous logic.Mahya Malekghasemi & Seyed-Mohammad Bagheri - 2018 - Mathematical Logic Quarterly 64 (3):185-191.

Add more citations

References found in this work

From discrete to continuous time.H. Jerome Keisler - 1991 - Annals of Pure and Applied Logic 52 (1-2):99-141.

Add more references