Bases for Structures and Theories I

In Part I of this paper (Ketland in Logica Universalis 14:357–381, 2020), I assumed we begin with a (relational) signature $$P = \{P_i\}$$ and the corresponding language $$L_P$$ , and introduced the following notions: a definition system $$d_{\Phi }$$ for a set of new predicate symbols $$Q_i$$ , given by a set $$\Phi = \{\phi _i\}$$ of defining $$L_P$$ -formulas (these definitions have the form: $$\forall \overline{x}(Q_i(x) \leftrightarrow \phi _i)$$ ); a corresponding translation function $$\tau _{\Phi }: L_Q \rightarrow L_P$$ ; the corresponding definitional image operator $$D_{\Phi }$$ , applicable to $$L_P$$ -structures and $$L_P$$ -theories; and the notion of definitional equivalence itself: for structures $$A + d_{\Phi } \equiv B + d_{\Theta }$$ ; for theories, $$T_1 + d_{\Phi } \equiv T_2 + d_{\Theta }$$ . Some results relating these notions were given, ending with two characterizations for definitional equivalence. In this second part, we explain the notion of a representation basis. Suppose a set $$\Phi = \{\phi _i\}$$ of $$L_P$$ -formulas is given, and $$\Theta = \{\theta _i\}$$ is a set of $$L_Q$$ -formulas. Then the original set $$\Phi $$ is called a representation basis for an $$L_P$$ -structure A with inverse $$\Theta $$ iff an inverse explicit definition $$\forall \overline{x}(P_i(\overline{x}) \leftrightarrow \theta _i)$$ is true in $$A + d_{\Phi }$$ , for each $$P_i$$ . Similarly, the set $$\Phi $$ is called a representation basis for a $$L_P$$ -theory T with inverse $$\Theta $$ iff each explicit definition $$\forall \overline{x}(P_i(\overline{x}) \leftrightarrow \theta _i)$$ is provable in $$T + d_{\Phi }$$ . Some results about representation bases, the mappings they induce and their relationship with the notion of definitional equivalence are given. In particular, we show that $$T_1$$ (in $$L_P$$ ) is definitionally equivalent to $$T_2$$ (in $$L_Q$$ ), with respect to $$\Phi $$ and $$\Theta $$ , if and only if $$\Phi $$ is a representation basis for $$T_1$$ with inverse $$\Theta $$ and $$T_2 \equiv D_{\Phi }T_1$$ .

[1]  W. V. Quine,et al.  Concatenation as a basis for arithmetic , 1946, Journal of Symbolic Logic.

[2]  George Boolos,et al.  Computability and logic , 1974 .

[3]  David W. Miller POPPER'S QUALITATIVE THEORY OF VERISIMILITUDE , 1974, The British Journal for the Philosophy of Science.

[4]  Richard Kaye,et al.  On Interpretations of Arithmetic and Set Theory , 2007, Notre Dame J. Formal Log..

[5]  T. Schindler,et al.  Arithmetic with Fusions , 2016 .

[6]  Albert Visser,et al.  When Bi-Interpretability Implies Synonymy , 2014 .

[7]  Vítezslav Svejdar On Interpretability in the Theory of Concatenation , 2009, Notre Dame J. Formal Log..

[8]  K. L. De Bouvère Logical Synonymity**Paper prepared at the University of Amsterdam under Euratom Contract No. 034–64–1 CET N. The author is grateful to Professors Stig Kanger, Richard Montague and Dana Scott for valuable discussions and suggestions. , 1965 .

[9]  Albert Visser Growing Commas. A Study of Sequentiality and Concatenation , 2009, Notre Dame J. Formal Log..

[10]  Mihai Ganea,et al.  Arithmetic on semigroups , 2009, The Journal of Symbolic Logic.

[11]  A. Grzegorczyk,et al.  Undecidability and Concatenation , 2007 .

[12]  Albert Visser,et al.  The Interpretability of Inconsistency: Feferman's Theorem and Related Results , 2014 .

[13]  Wilfrid Hodges,et al.  A Shorter Model Theory , 1997 .

[14]  Andrzej Grzegorczyk Undecidability without Arithmetization , 2005, Stud Logica.

[15]  David W. Miller,et al.  The accuracy of predictions , 1975, Synthese.

[16]  Albert Visser Extension and Interpretability , 2015 .

[17]  I. Németi,et al.  Mutual definability does not imply definitional equivalence, a simple example , 2005, Math. Log. Q..

[18]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[19]  George Boolos,et al.  Computability and logic: 3rd ed. , 1989 .

[20]  N. Goodman Fact, Fiction, and Forecast , 1955 .

[21]  David W. Miller The distance between constituents , 1978, Synthese.