Continuous Relaxations of First-Order Logic

• Continuous relaxations of first-order logic is a framework that replaces binary truth values with a continuum, allowing analysis of metric-valued structures in a precise, scalable manner.
• It employs continuous connectives and sup/inf quantifiers to extend classical logic, facilitating the study of metric spaces, Banach spaces, and structures with real-valued phenomena.
• Frameworks such as Continuous First-Order Logic, Rational Gödel Logic, and Ultrametric Logic demonstrate robust model-theoretic properties like compactness, saturation, and approximate quantifier elimination.

Continuous relaxations of first-order logic are mathematical frameworks in which the classical dichotomous semantics $\{0,1\}$ of first-order logic are replaced by a metric or continuum of truth values (such as $[0,1]$ or more refined structures), and the logical connectives, quantifiers, syntax, and semantics are correspondingly extended and “softened” to operate continuously. These approaches enable the rigorous treatment of structures and properties ill-suited to classical logic, such as metric spaces, Banach spaces, or structures with inherently real-valued phenomena. The theory encompasses developments such as Continuous First-Order Logic (CFO), Rational Gödel Logic and Ultrametric Logic, two-sorted classical frameworks for continuous semantics, and their associated categorical and model-theoretic infrastructures (Hirvonen et al., 2024, Albert et al., 2016, Khatami et al., 2013, Agostini et al., 2024).

1. Foundational Formulations: Syntax, Semantics, and Metric Structures

The syntax of continuous first-order logics generalizes the classical logic via the introduction of a metric signature $\sigma$ consisting of function symbols $f$ (each equipped with a continuity modulus $\Delta_f$) and predicate symbols $P$ (with codomain bounds in $[0,1]$ and continuity moduli $\Delta_P$) (Hirvonen et al., 2024). A $\sigma$-structure $M$ is a complete metric space $(M,d)$ of diameter at most 1, with interpretations of $f^M : M^n \to M$ and $P^M : M^n \to [0,1]$ preserving the prescribed continuity moduli. Variables, terms, and atomic formulae (such as $d(t,t')$, $P(t_1,\ldots, t_n)$) are defined analogously to the classical case, but connectives are now arbitrary continuous functions $u : [0,1]^k \to [0,1]$—for example, $\max(x, y)$, $\min(x, y)$, and $1-x$.

Quantification is also relaxed: universal quantification $\forall x\, \varphi$ is interpreted as $\sup_x \varphi$, existential quantification $\exists x\, \varphi$ as $\inf_x \varphi$. Formulae are evaluated pointwise to values in $[0,1]$ and logical equivalence is replaced by uniform approximation: two structures are said to be $\epsilon$-close on a formula $\varphi$ if $|\varphi^M - \varphi^N| \leq \epsilon$ pointwise (Hirvonen et al., 2024). The definition of quantifier rank extends, with $qr(\varphi)$ inductively defined so that $qr(\mathrm{atomic}) = 0$, $qr(u(\psi_1,\ldots,\psi_k)) = \max_i qr(\psi_i)$, and $qr(\inf_x \psi) = qr(\psi) + 1$.

2. Categorical and Algebraic Perspectives

The categorical formalism for continuous logic introduces metric logical categories $(\mathscr{C}, d)$—categories $\mathscr{C}$ endowed with a contravariant functor $\mathscr{L} : \mathscr{C} \to \mathbf{CLA}$ (continuous logical algebras), ensuring a structure compatible with continuous connectives and quantifiers (Albert et al., 2016). For each object $A$, a pseudo-metric $d_A \in \mathscr{L}(A \times A)$ is specified, with morphisms and predicates being uniformly continuous with respect to the associated metrics. A metric logical functor $(F, i)$ between such categories preserves the algebraic and metric structures.

A metric theory $(L, T)$ is associated to a category of definable sets $Def(L, T)$, where objects are definable predicates and morphisms are induced by definable predicates corresponding to graphs of uniformly continuous functions. Quantification in $Def(L, T)$ agrees with sup/inf semantics in metric spaces, and the resulting category is a metric logical category.

The completion process analogous to the classical pre-topos yields a metric pre-topos: the category $Def(L^{eq}, T^{eq})$ after passing to the imaginary expansion $(L^{eq}, T^{eq})$—adding sorts for countable products, zero-sets, canonical parameters, and finitely many definable unions, together with appropriate conservativeness conditions (Albert et al., 2016).

3. Principal Frameworks: CFO, Rational Gödel Logic, Ultrametric Logic, and Two-Sorted Models

Several key frameworks for continuous relaxations of first-order logic have been developed:

• Continuous First-Order Logic (CFO): Directly employs $[0,1]$-valued semantics, continuous connectives, and sup/inf quantification on metric structures (Hirvonen et al., 2024).
• Rational Gödel Logic (RGL*): Generalizes Gödel logic by enriching propositional connectives with countably many nullary rational-valued symbols and adopting a lexicographically ordered truth-value space $\mathbb{I} = [0,1]^2 \setminus \{ (0, r): r > 0 \}$ (Khatami et al., 2013). Logical connectives, especially implication, are defined “fuzzily” with residual properties; quantification again employs sup/inf.
• Ultrametric Logic (UML): Extends RGL* by adding a distance predicate $d$ satisfying ultrametric axioms, ensuring that predicates and functions become uniformly continuous with respect to $d$. Equality is replaced by equivalence under $d(a, b) = \hat 0$ (Khatami et al., 2013).
• Two-Sorted Classical Continuous Setting: Uses a two-sorted language $(M, X)$ where $X$ is a fixed compact Hausdorff space (e.g., $[0,1]$), enabling all classical two-valued formulas to emulate $[0,1]$-valued connectives and quantifiers “internally” via definable set-theoretic constructions (Agostini et al., 2024). This setting allows the expression of continuous logic within classical model theory and unifies positive-bounded and full continuous logic via choice of formula fragments ($\mathbf{F}$, $\mathbf{H}$).

4. Model-Theoretic and Game-Theoretic Tools

The relaxation of semantics in continuous logic necessitates new model-theoretic and game-theoretic instruments:

• Continuous Ehrenfeucht–Fraïssé Games: For metric structures, a version of the Ehrenfeucht-Fraïssé (EF) game is defined such that the Duplicator wins the $n$-round game if, for all atomic formulas, the induced partial map is an $\epsilon$-isomorphism. The main theorem establishes that, for relational signatures and for $n < \omega$, such a winning strategy corresponds exactly to agreement on all CFO-sentences of quantifier rank $\leq n$ (Hirvonen et al., 2024). The correspondence is quantified via moduli functions and finite $\epsilon$-nets.
• Infinitary Continuous Logic and EF Games: Infinitary analogs $\mathrm{EF}_\omega^\Omega$ allow games of length $\omega$ parameterized by weak moduli of continuity, with pseudometric characterizations mirroring the satisfaction of all infinitary sentences (Hirvonen et al., 2024).
• Approximate Entailment and Compactness: In RGL* and UML, approximate entailment-compactness replaces strict compactness: $T \models \varphi$ iff for any $n$ there exists a finite $T_n \subseteq T$ such that $T_n \models \overline{n^{-1} \to \varphi}$, permitting approximate satisfaction (Khatami et al., 2013).
• Elementarity, Saturation, and Quantifier Elimination: In two-sorted settings, notions of $\mathbf{F}$-elementary maps, $\mathbf{F}$-saturation, and approximate quantifier-elimination up to arbitrary precision are introduced, and compactness arguments yield existence of saturated models (Agostini et al., 2024).

5. Applications, Examples, and Expressive Limitations

Continuous relaxations admit the treatment of structures with metric or real-valued features, but impose expressive limitations distinct from those of classical logic:

• In CFO, cardinality is not axiomatizable: discrete spaces of differing cardinality can be ε-approximated in finite EF games but are separated by certain infinitary sentences (e.g., involving $\inf \max d(x_i, x_j)$ expressions) (Hirvonen et al., 2024).
• The “metric chain” example shows that distinguishability may only emerge at infinitary quantifier rank, highlighting the necessity of infinitary games for full expressiveness in the metric context.
• In categorical continuous logic, interpretations of uniform continuity, metric completeness, and definable sets are directly accessible via the algebraic/categorical formalism (Albert et al., 2016).
• The two-sorted framework demonstrates unification of positive bounded and full continuous logic, with expressiveness equivariant to Banach space model theory and general compact-valued structures (Agostini et al., 2024).

6. Theoretical Properties: Completeness, Amalgamation, and Conservative Extensions

• Completeness Theorems: RGL* and UML maintain completeness properties analogous to the classical case—every strongly consistent theory has a model; compactness and approximate entailment-compactness hold in the appropriate settings (Khatami et al., 2013).
• Amalgamation and Robinson Consistency: UML supports amalgamation of weakly elementary extensions and the Robinson joint consistency theorem, mirroring pivotal aspects of classical model theory in the continuous context.
• Conservative Extensions and Maximal Expansions: The categorical approach establishes that the imaginary expansion $(L^{eq}, T^{eq})$ yields the maximal conservative extension; every further conservative expansion factors through this via metric logical functors (Albert et al., 2016).

7. Comparison of Frameworks and Connections to Classical Logic

The various frameworks for continuous relaxation differ in technical approach but converge on the central idea of extending the expressive and semantic reach of first-order logic to metric-valued domains. CFO, RGL*, UML, and two-sorted languages exhibit the following correspondences:

Framework	Truth Value Space	Connectives & Quantifiers	Metricity
CFO	$[0,1]$	Continuous $u:[0,1]^k \to [0,1]$, sup/inf	Complete metric
RGL*, UML	$\mathbb{I}$	Rational-valued nullaries, sup/inf, Gödel implication	Ultrametric, uniform continuity
Two-sorted	Classical, $X$	All in $[0,1]$ via space-sort, sup/inf	Compact Hausdorff sort $X$

Each framework allows definition of real-valued connectives and sup/inf quantifiers, but the manner of embedding into classical logic and the expressiveness regarding metric constraints and completeness differ (Hirvonen et al., 2024, Khatami et al., 2013, Agostini et al., 2024).

A plausible implication is that the development of continuous relaxations provides a robust and flexible toolkit for the model theory of metric, Banach, and valued structures, permitting the use of classical model-theoretic results (compactness, saturation, quantifier elimination) in a real-valued and continuous context. The categorical and game-theoretic interpretations further extend the reach of these methods, supporting applications in logic, analysis, and beyond.