In the monograph [1] of Chang and Keisler, a considerable extent of model theory of the first order continuous logic (that is, roughly speaking, many-valued logic with truth values from a topological space) is ingeniously developed without using any notion of provability.In this paper we shall define the notion of provability in continuous logic as well as the notion of matrix, which is a natural extension of one in finite-valued logic in [2], and develop the syntax and semantics of it mostly along the line in the preceding paper [2]. Fundamental theorems of model theory in continuous logic, which have been proved with purely model-theoretic proofs (i.e. those proofs which do not use any proof-theoretic notions) in [1], will be proved with proofs which are natural extensions of those in two-valued logic.
Learning nonlinear loop invariants with gated continuous logic networks
