Gaps, gluts, and theoretical equivalence

When are two formal theories of broadly logical concepts, such as truth, equivalent? The paper investigates a case study, involving two well-known variants of Kripke–Feferman truth. The first, KF+CONS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathtt {KF}+\mathtt {CONS}$$\end{document}, features a consistent but partial truth predicate. The second, KF+COMP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathtt {KF}+\mathtt {COMP}$$\end{document}, an inconsistent but complete truth predicate. It is known that the two truth predicates are dual to each other. We show that this duality reveals a much stricter correspondence between the two theories: they are intertraslatable. Intertranslatability, under natural assumptions, coincides with definitional equivalence, and is arguably the strictest notion of theoretical equivalence different from logical equivalence. The case of KF+CONS\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathtt {KF}+\mathtt {CONS}$$\end{document} and KF+COMP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathtt {KF}+\mathtt {COMP}$$\end{document} raises a puzzle: the two theories can be proved to be strictly related, yet they appear to embody remarkably different conceptions of truth. We discuss the significance of the result for the broader debate on formal criteria of conceptual reducibility for theories of truth.


Introduction
When are two formal theories of broadly logical concepts, such as truth, equivalent? From the work of logicians and philosophers of science, we know that there are several notions of mutual reduction between formal theories to choose from (Halvorson, 2019;Visser, 2006). Glymour (1970) proposed the (demanding) criterion of theoretical equivalence known as definitional equivalence or intertranslatability. The criterion roughly states that two theories are equivalent if each theory can define the primitive concepts of the other in a sufficiently natural way. "Natural" here has a definite sense: each theory should recognize that the other theory's definitions of its own primitives are the inverse of its own definitions (see Sect. 3 for a precise definition).
The ever-increasing popularity of truth-theoretic deflationism (Cieśliński, 2017), together with a revived attention to the Liar paradox prompted by new technical tools (Field, 2008;Halbach, 2014;Horsten, 2012), led to a multiplication of formal systems extending some standard syntax theory with a primitive truth predicate governed by suitable axioms. These systems may have multiple aims: they may embody some conception of truth, including a solution to the Liar and related paradoxes; they may characterize the truth predicate as a logical tool whose formal properties witness the role that the notion of truth can play in (sustained) reasoning-e.g., in applied mathematics and in the formal sciences. The existence of several such systems raises the question of how to compare them, both in their formal and philosophical aspects.
In this paper we contribute to the question whether the formal notions of theoretical equivalence devised by logicians and philosophers of science can support an adequate comparison between formal theories of primitive truth. This question has already been investigated in other works (Fujimoto, 2010;Halbach, 2000;Nicolai, 2017); this paper considers a new case study. We focus in particular on one of the most influential cluster of theories of truth, the Kripke-Feferman cluster. Kripke-Feferman truth traces back to the work of Feferman on the foundations of predicativism (Feferman, 1991), and it is often presented as an axiomatization in classical logic of the class of fixed-point models proposed by Kripke (1975). Kripke-Feferman truth is not a single theory, but a recipe to generate theories featuring truth predicates with different properties. We will focus on two theories from the Kripke-Feferman cluster. The first is the theory KF+CONS, whose truth predicate is consistent but partial (not every sentence is true or false). The second is the theory KF+COMP, whose truth predicate is inconsistent (some sentences are both true and false) and complete (every sentence is either true or false). In the light of these differences, it would seem implausible to consider KF + CONS and KF + COMP as theoretically equivalent theories of truth.
Yet, in Sect. 4, we will show that KF + CONS and KF + COMP are intertranslatable, and therefore strong candidates for being indeed theoretically equivalent theories of truth. In Sect. 2, we will introduce Kripke-Feferman truth and some of the key properties of the truth predicates of KF + CONS and KF + COMP. In Sect. 3, we introduce the notions of theoretical reducibility and equivalence that will be employed in the paper. Section 4 contains the main technical observations: the well-known phenomenon of the duality between KF + CONS and KF + COMP will be recalled, and we will show that it can be lifted to the intertranslatability of the two theories. Finally, in Sect. 5, we provide a philosophical assessment of the formal result: we discuss what it means for a formal theory to capture a conception of truth, and isolate different conceptions of truth compatible with the Kripke-Feferman theories that support diverging verdicts on the intertranslatability of KF + CONS and KF + COMP.

Kripke-Feferman truth
The system KF is formulated in the language L Tr,F obtained by extending the language L N of arithmetic with unary predicates Tr and F for truth and falsity. It is convenient to formulate L N in a relational signature: we assume only a finite number of primitive recursive relations. An axiomatization of first-order arithmetic with these features can be found in (Hájek and Pudlák 2017, Sect. I(e)). To formulate the truth axioms, we will make use of the expressionẋ standing for the code of a constant symbol c x associated with any x. This is justified by the existence of PA-definable primitive recursive injective functions sending each number x to a representative (the code of a constant symbol) c x . In practice, although PA is formulated in a purely relational language L Tr,F , the truth axioms are formulated for a "coded" language L + Tr,F that contains constantsẋ for each number x. We will not distinguish between L Tr,F and L + Tr,F in what follows. KF extends classical logic with equality with the basic axioms of a relational version of PA, the induction schema IND(L Tr,F ) for formulae of the entire language L Tr,F , and the following truth-theoretic axioms: In KF5-KF9, the quantification ∀ϕ... abbreviates ∀x(Sent L Tr,F (x) → ...). Other conventions follow Halbach (2014), including the under-dotting convention for syntactic functions. Notice that the formulation of KF9 with unrestricted quantification (not over sentences only) is inconsistent with KF0.
The theory KFI is obtained by replacing the L Tr,F -induction schema of KF with the axiom of internal induction: The theory KF L N is like KF but features only the axiom schema of induction restricted to formulae of L N .
In this paper we will focus on two extensions of KF obtained by adding to it, respectively, the axioms The Liar paradox entails that KF + CONS and KF + COMP are mutually inconsistent. KF can be seen as an axiomatization of Kripke's fixed point semantics Kripke (1975). Let : P(ω) 2 −→ P(ω) 2 be the arithmetical operator associated with the Kripke truth and falsity sets (Cantini 1989, Def. 5 a complete fixed point is such that X + ∪ X − = ω. Standard models of KF + CONS are precisely the consistent fixed points, and standard models of KF + COMP are the complete ones:

Gaps and gluts
The truth and falsity predicates of KF + CONS and KF + COMP diverge in some significant respects. 3 For future reference, we recall some simple facts separating the two truth predicates. They disagree on almost any key principle available in the theories, such as paradoxical sentences, axioms, and rules of inference.
The truth predicate of KF + CONS is partial and does not declare any sentence to be both true and false. This entails that there are sentences that are consequences of KF + CONS and yet they are declared not true by the theory. For our purposes, let us define the Liar sentence λ as the sentence Fl, for which the identity l = Fl is provable in PA. If λ, i.e., Fl, then also Trl by KF4. This would contradict CONS, therefore ¬λ. Similarly, if Tr¬ . l, then Fl by KF9, contradicting CONS again by KF4: therefore ¬Tr¬ . l.
We have then proved ¬λ ∧ ¬Tr ¬λ in KF + CONS. This phenomenon extends to instances of some axioms of KF + CONS, such as the instance Fl → ¬Trl of CONS. They are declared not true by the theory: assuming Tr( ¬Fl ∨ ¬Trl ) in KF + CONS, by distributing the truth predicate over the disjunction and applying KF9 one gets FFl ∨ FTrl: however, each disjunct contradicts CONS by the previous reasoning. A noticeable feature of KF + CONS is that it derives a universally quantified version of the modal axiom K: The proof of (K) in KF + CONS employs CONS and the compositional axioms: if Trϕ and Tr(¬ϕ ∨ ψ), then Trϕ holds together with Tr¬ϕ or with Trψ by compositionality. Finally, under the specific choice of the logical calculus considered above, KF + COMP may be seen to regard its rule of inference to fail to preserve truth. Since KF + COMP proves Trl, it also proves Tr ¬Fl and therefore Tr ¬λ ∨ 0 = 0 . However, KF2 entails that ¬Tr 0 = 0 . This is the negation of the instance Tr λ ∧ Tr λ → 0 = 0 → Tr 0 = 0 of (K).

Theoretical equivalence
A rich variety of formal notions of inter-theoretic reduction have been studied in logic and the philosophy of science: a comprehensive overview of such notions can be found for instance in Halvorson (2019) and Visser (2006). In what follows we will apply some of these notions to KF + CONS and KF + COMP. This section contains the necessary background. Given first-order theories T and W , a relative translation τ of L T in L Wformulated in a relational signature-can be described as a pair (δ, F) where δ is a L W -formula with one free variable-the domain of the translation-and F is a (finite) mapping that takes n-ary relation symbols of L T and returns formulas of L W with n free variables. The description of the translation τ is completed, modulo suitable renaming of bound variables, by the following inductive clauses: • (R(x 1 , ..., x n )) τ :↔ F(R)(x 1 , ..., x n ); • τ commutes with propositional connectives; Definition 1 An interpretation K is specified by a triple (T , τ, W ), where τ is a translation of L T in L W , such that for all formulas ϕ(x 1 , .., x n ) of L T with the free variables displayed, we have: For readability, we will often write δ K for the domain of the interpretation K and ϕ K for the translation of ϕ according to K . We will also write K : T → W for 'K is an interpretation of T in W '. Model-theoretically, a K : T → W provides a method for constructing, in any model M W , an internal model M K T .
T and W are said to be mutually interpretable if there are interpretations K : T → W and L : W → T .
Given τ 0 : L T → L W and τ 1 : Two interpretations K 0 , K 1 : T → W are equal if W , the target theory, proves this. In particular, one requires, for any relation symbol R of L T Mutual interpretability is arguably a good measure of consistency strength, but it does not capture finer grained relations between theories. As it is well-known, it does not even differentiate between sound and unsound theories (e.g., PA and PA + ¬Con(PA) are mutually interpretable).
The notion of intertranslatability is a much stricter notion of theoretical equivalence. As shown in Visser (2006), it preserves many formal properties of theories such as κ-categoricity and finite axiomatizability. We will occasionally speak of intertranslatability and bi-interpretability for pairs of models as well.
In the philosophy of science the notion of definitional equivalence, a notion akin to intertranslatability, has played a prominent role (starting at least with Glymour (1970)). Two theories U and V -again for simplicity, we assume a finite relational signature-are definitionally equivalent if they have a common definitional extension. A definitional extension of a theory U is simply a theory in a new language featuring, alongside the axioms of U , explicit definitions of the new relation symbols not in L U . 4 Definitional equivalence is more rigid than intertranslatability in the following sense: whereas for U and V featuring disjoint signatures, the two notions coincide, 5 this is not so for theories sharing some part or all of their signature. An example is before our very eyes.
Observation 1 KF + COMP and KF + CONS are not definitionally equivalent.
In general, since a definitional extension of U and V includes both U and V , if U and V are mutually inconsistent, then they cannot have a common definitional extension. Intertranslatability is compatible with mutually inconsistent theories. We will in fact show that KF + CONS and KF + COMP are intertranslatable.

Theoretical equivalence for Kripke-Feferman truth
That a relation of duality exists between KF + CONS and KF + COMP has been already noticed by Cantini (1989), which is the first systematic study of variations of the basic theory KF from Feferman (1991). 6 Informally, this duality consists in the fact that the truth predicate of KF+COMP (resp. KF+CONS) can be understood within KF+CONS (KF+COMP) as the predicate 'it's not false', and that the falsity predicate of KF+CONS (resp. KF + COMP) becomes in KF + COMP (KF + CONS) the predicate 'it's not true'. But even more is the case: if one replaces 'false' in 'it's not false' with 'not true', one obtains 'it's not not true', which leads us back to 'it's true'-and symmetrically with falsity.
The situation can be visualized in Figs. 1 and 2. In the former we are living in the minimal fixed-point model of KF + CONS (i.e., the minimal fixed point of the operator considered in Sect. 2). The light red triangle represents the (consistent) extension of the truth predicate, i.e., the sentences that are determinately true. The white triangle represents the sentences that are determinately false (including the non-sentences). In the light blue space one finds all other sentences of L Tr,F , including "ungrounded" sentences such as the Liar sentence λ. The model interprets Tr and F as T and F, respectively. We can define a mapping K-corresponding to a syntactic interpretation to be defined shortly-that behaves like the identity mapping on the denotations of primitives of L N , and such that  The "predicates" T K and F K satisfy the axioms of KF + COMP. However, one can interpret back the newly obtained predicates T K and F K via the mapping L, which behave exactly as K: 7 The situation with KF+COMP is symmetric and is represented in Fig. 2. We are now working in what is often referred to as the maximal fixed point of over N-which can be defined as the model obtained by starting with the extensions of truth and falsity given by the pair (Sent L Tr,F , ω) over the standard model N and iterating the operator while taking intersections at limit stages. The extensions T of the truth predicate corresponds now to the light red and blue spaces: everything but the determinately false sentences. The extension F of F coincides with the light red and gray spaces. The set T L now gives us the set of determinately true sentences (the complement of F), but by applying K to Tr L we obtain the original extension T, and symmetrically for F.
These informal considerations essentially amount to the following.
Observation 2 Let I be the minimal fixed point of and I * its dual. Then, the models (N, I ) and (N, I * ) are bi-interpretable, and in fact intertranslatable.
The fact that standard models of theories are bi-interpretable, or even intertranslatable, does not suffice for establishing the bi-interpretability or intertranslatability of the corresponding theories. For instance, V ω and N are indeed bi-interpretable, but ZF \ Inf + ¬Inf-where Inf is the axiom of infinity-and PA are not bi-interpretable (Enayat et al. 2011, Thm. 5.1). However, KF + CONS and KF + COMP are indeed intertranslatable. Cantini (1989) shows that KF + CONS and KF + COMP are mutually interpretable. The interpretations involved in the claim, however, do not relativize quantifiers, and leave all vocabulary other than the truth predicate unchanged. These interpretations belong to a specific kind that has been dubbed relative truth-definitions by Fujimoto (2010). Relative truth-definitions preserve the arithmetical theorems. As such, a mutual truth-definition between two theories entails the identity of their theorems in L N . Historically, identity of L N -theorems has played a central role in the study of inter-theoretic reduction between truth systems, especially in connection with Feferman's predicativist programme discussed below. Such a measure is less relevant when a system of truth is studied in relation to a specific solution to the semantic paradoxes, or to a specific conception of truth. Relative truth-definability goes beyond mere proof-theoretic equivalence in that it compares fine-grained properties of truth predicates by keeping the underlying syntax theory fixed, and it is certainly more suited for conceptual reductions of truth predicates. We can restate Cantini's claim in terms of truth-definitions.
Proof Let τ : L Tr,F → L Tr,F be specified by: 8 The verification that K and L are interpretations requires a standard induction on the length of the proofs of the relevant theories.
By inspecting the proof above, one realizes that the argument is independent from the choice of the non-logical schemata employed in the truth theories. This enables one to employ the same argument to obtain the next corollary.
(ii) KF L N + CONS and KF L N + COMP are mutually truth-definable.
We now turn to the main claim of the section. KF + CONS and KF + COMP are equivalent in a much stricter sense than the one given by truth definitions. The interpretations K and L given above are inverse to each other, provably in KF + CONS and KF + COMP. This witnesses the intertranslatability of the two theories.
That intertranslatability given by truth-definitions is a properly stricter notion than mutual truth definability follows from results in Nicolai (2017): the theories KF and PUTB (cf. Halbach (2014) for a definition) over a finitely axiomatizable theory such as EA or I 1 are mutually truth definable but not intertranslatable.
Proof Given our definition of intertranslatability, it suffices to check that the interpretations K and L commute in the required sense for primitive predicates of L Tr,F . By abusing of notation for the sake of readability, I write K and L instead of τ for the translation as well.
The case of arithmetical relations (including the trivial domains) is trivial in both directions and we omit it. We verify (i) that the interpretation L • K behaves like the identity intepretation in KF + CONS on Tr, and (ii) that the interpretation K • L behaves like the identity interpretation in KF + COMP on Tr.
(Trx) L•K is ¬F L x by definition of K; L then gives us ¬¬Trx, which is obviously logically equivalent to Trx. Similarly, F L•K x is just ¬Tr L , that is ¬¬Fx, which is equivalent to Fx. Since K and L are both based on τ , the same equivalence are obtained by inverting the roles of K and L. Therefore we have: as desired.

Remark 1
The result is somewhat dependent on the chosen axiomatization of KF. While the argument above goes through for Feferman's axiomatization of KFi.e., with unrestricted KF9 and without KF0-, it does not immediately go through for the axiomatization of KF dispensing with the falsity predicate (e.g., the one in Halbach (2014)). To give a sense of the issue, in defining Trx as ¬Tr¬ .
x, an argument analogous to the one in Prop. 1 tells us that we would require the equivalence between Tr¬ . ¬ .
x and Trx. However, this would only hold with the contextual information that Sent L Tr (x). However, in order to enforce this contextual information, we would require an axiom stating that only sentences are true, which would then create problems to obtain Lemma 1.
By inspection of the proofs above, we notice that the induction schema IND(L Tr,F ) does not play a key role: the proof only rests on the fact that KF+CONS and KF+COMP both feature IND(L Tr,F ). Therefore, we have: Remark 2 Proposition 1 and Corollary 2 can be reformulated in stronger forms. The interpretations witnessing the intertranslatability of the theories are in fact L N -preserving. Nicolai (2021) introduced the notions of L N -bi-interpretability and L N -intertranslatability, which replace relative interpretations with L N -interpretations in the definitions of bi-interpretability and intertranslatability. Working on L Ninterpretations has the advantage that the notions become directly comparable with mutual truth-definability (in fact, properly stricter). By a theorem of Visser and Friedman (2014), L N -bi-interpretability and L N -interpretability coincide.
To summarize, the duality theorem for KF + COMP and KF + CONS tells us that each theory can reproduce the truth and falsity predicates of the other by means of a new predicate obtained by combining their primitive truth and falsity predicates with classical (external) negation. This is enough to guarantee the proof-theoretic equivalence of the two systems in several respects: the mutual interpretability result entails that the two systems have equal consistency strength; the fact that the translation τ is in fact a truth definition in the sense explained above entails that the two theories prove the same L N -sentences. The intertranslatability of KF + CONS and KF + COMP reveals that the relationships between the two theories are in fact much stricter.
The combination of Observation 1 and Proposition 1 provides us with another example of a pair of theories sharing part of their signature that are intertranslatable but not definitionally equivalent. Other, simpler examples are known. For instance, one can consider the theories in classical predicate logic {∀x Px} and {∀x¬Px} in the signature {P}. By interpreting P as ¬P, one obtains a mutual interpretability result and the intertranslatability of the two theories. However, since the two theories are mutually inconsistent, they cannot be definitionally equivalent. Unlike those simple examples, Proposition 1 involves rich, non ad hoc theories that have been employed in several theoretical contexts.

Kripke-Feferman truth and the significance of theoretical equivalence
The observations contained in the previous section are prima facie puzzling. KF+CONS and KF + COMP appear to formalize different notions of truth: KF + CONS states there are no truth value gluts, but that there may be sentences that are neither true nor false. KF+COMP drastically disagrees, and states that any sentence is either true or false, and that occasionally it can be both. Yet, the theories are intertranslatable, and therefore formally equivalent in a strict sense. In the present section, we discuss this seemingly paradoxical situation in the context of a more general analysis of the role of notions of theoretical equivalence for theories of truth. Natural notions of theoretical equivalence can be linearly arranged on the basis of their strictness. On one side, we find the strictest notion of equivalence, definitional equivalence (which, we have seen, coincides with our notion of intertranslatability under some plausible assumptions). 9 On the looser end, we can reasonably place mutual interpretability. There is much in between, and we refer to systematic studies on the topic for a comprehesive overview (Halvorson, 2019;Visser, 2006); these intermediate notions are not immediately relevant to our discussion. A parallel but less structured hierarchy involves theories formulated in signatures that extend L N and in which the interpretation of the arithmetical vocabulary is kept fixed. To this hierarchy belong mutual truth-definability, and the properly stricter notion of L Nintertranslatability (cf. Remark 2).
Is is difficult to determine the philosophical import of notions of theoretical equivalence. It is so in the case of formalization of theories from the natural sciences, and it's even more so in the case of logico-mathematical theories that lack something like the distinction between theoretical and empirical vocabulary. 10 The significance of results on inter-theoretic equivalence is bound to be purpose-relative. 11 In certain contexts, strong notions of theoretical equivalence isolate equivalence classes of theories/models that represent the right kind of objects for all theoretical purposes. In certain areas of mathematical logic, bi-interpretability appears to be sufficient: according to the model theorist Pillay, for instance, 'the business of "pure" model theory becomes the classification of first-order theories up to bi-interpretability' (Buss et al. 2001, p. 186). At the same time, it's also clear that identification of structures up to (definable) isomorphism may be too crude; for instance, despite the definitional equivalence of theories of finite sets and arithmetic, the view that natural numbers and finite sets are irreducible structures can be coherently defended (Tait, 2015).

Conceptions of truth and reducibility
Since we are mainly interested in discussing formal theoretical equivalence in the case of theories of truth such as KF + CONS and KF + COMP, one would ideally require that formal theoretical equivalence could preserve the conception of truth embodied by a theory. A conception of truth may be defined as a collection of conditions that the notion of truth should possess. These conditions, of course, may be of a different kind; 12 some of them may be constitutive of the notion-without them, one would not even be talking about truth-, others may be compatible with someone disagreeing with them and yet reasonably possessing a notion of truth (conception-specific). The literature offers several such conditions. The following, non-exhaustive list of criteria, for instance, builds on Halbach and Horsten (2015), Leitgeb (2007), and Nicolai (2017): material adequacy (the theory of truth should entail the full Tarski-biconditionals for the truthfree language), preservation of ontological commitments (theories of truth should allow for standard interpretations of the objects of truth), compositionality (truth (and falsity) should commute with the logical connectives of the internal logic in fully quantified form), generalizing power (truth should enable one to establish desirable 9 We omit logical equivalence in the general overview as it only applies to theories with the same signature. 10 Although such a distinction may be hard to motivate (Van Fraassen, 1980). generalizations, such as the truth of the base theory), consistency (no sentence and its negation should be true), completeness (either a sentence or its negation should be true), finite axiomatizability (the truth axioms should be given by a finite list), no type restrictions (the theory of truth should prove genuine instances of self-application).
Nicolai (2017) employed such criteria to calibrate the formal notions of theoretical equivalence to the comparison of theories of truth. The project starts with the observation that some of the criteria just listed, such as compositionality and finite axiomatizability (over the base theory), are not prima facie preserved by some natural candidate for conceptual equivalence of truth predicates, such as mutual truthdefinability. For instance, the theory of type-free disquotational truth PUTB-see (Halbach 2014, Sect. 19.3-19.5)-and KF are mutually-truth definable: KF interprets PUTB via the identity interpretation, whereas PUTB employs the diagonal lemma and the truth predicate to mimic the KF-truth axioms. However, PUTB is a disquotational, non-finitely axiomatizable theory, whereas KF is compositional and features a finite set of truth axioms over PA in L Tr,F . In Nicolai (2017) it is shown that bi-interpretability, and therefore intertranslatability, are more sensitive than mutual truth-definability to the criteria above; PUTB and KF fail to be bi-interpretable over a finitely axiomatized base theory. 13 Proposition 1 shows that even intertranslatability is not sensitive to some of the criteria above; consistency and completeness of truth are not preserved by intertranslatability. From this, one may be tempted to conclude that even the strictest notion of theoretical equivalence fails to preserve a conception of truth.
The scope of this conclusion, however, is limited. The problem is that truth-theorists may starkly disagree on which criteria amount to a conception, and which do not. Undoubtedly, material adequacy in the sense above is constitutive of truth, but already compositionality in the strong form considered in the list is not uncontroversially recognized as a constitutive feature. For instance, transparency is taken by some theorists to be the only constitutive feature of truth. 14 But compositionalilty in fully quantified form is not necessary for transparency; a transparent truth predicate guarantees compositionality for each, externally given sentence, but not for all sentences in the sense of object-language quantifiers. An obvious reaction would be to impose that formal theoretical inter-reducibility ought to preserve only what is uncontroversially constitutive of truth. However, it is an upshot of our discussion that this risks simply recreating the debate on acceptable criteria at this more fundamental level. For instance, preservation of material adequacy does not even discriminate between primitive and non-primitive truth predicates, and would allow for weak notions of inter-theoretic reducibility to capture theoretical equivalence. The Tarskian Tr-schema for L N -sentences, for instance, is mutually interpretable with PA.
To avoid such shortcomings, one can resort to the requirement-in line with what we called 'preservation of ontological commitments' in the list above-that quantifiers 13 To obtain a failure of theoretical equivalence over the infinitely axiomatized PA, one needs to employ what Nicolai (2021) calls L N -bi-interpretability and L N -intertranslatability, which imposes the usual requirements for bi-interpretability and intertranslatability, respectively, on relative truth-definitions (i.e., interpretations based in L N -preserving translations) instead of simple relative interpretations. See Remark 2. 14 See, for instance, Beall (2009), Field (2008. over the objects to which truth applies should not be relativized. 15 This would certainly rule out mutual interpretability as a conception-preserving notion of theoretical equivalence, while suggesting that mutual truth-definability is much better suited to preserve constitutive features of a conception of truth. That, as we have just seen, may also be controversial without further qualification. Compositionality, completeness, and consistency are not preserved by mutual-truth definability, yet they are strong candidates for being constitutive features of truth. Analogously, the distinction between type-free and typed theories of truth is not preserved by mutual truth-definability: for instance, finite iterations of Tarksian (typed) truth are mutually truth-definable with a suitable subsystem of Friedman-Sheard (type-free) truth allowing only finitely many applications of the necessitation rule. 16 To fix this, one may ascend even higher in the hierarchy of inter-theoretic reduction, and only require bi-interpretability or intertranslatability to preserve constitutive features of truth. That as well, we have seen, may be controversial, as paraconsistent and paracomplete theories of truth diverge precisely on matters of consistency and completeness that are, by Proposition 1, not discriminated by such notions.
Fortunately, the discussion does not need to proceed only at such a general level. Instead of quantifying over all possible conceptions of truth, we can discuss what the intertranslatability of KF + CONS and KF + COMP can tell us about specific conceptions underlying the main applications of Kripke-Feferman truth. Before this, we will discuss a position that undermines the significance of Proposition 1 by rejecting KF + CONS and KF + COMP as viable theoretical options.

Rejecting KF + CONS and KF + COMP
The theoretical equivalence of KF+CONS and KF+COMP could be used as the conclusion of a reductio argument. One could accept that intertranslatability is a good notion of theoretical equivalence for theories of truth, and employ the intertranslatability of KF + CONS and KF + COMP as showing that the two theories are failed attempts to truly capture, respectively, a partial or inconsistent truth predicate in classical logic. This would be in line with other assessments of KF + CONS and KF + COMP. Several authors attribute to KF and its variants a form of incoherence-for instance Field (2008), chapter 6, and Horsten (2012), chapter 9. It is incoherent to assert (prove) a sentence, and assert (prove) that it isn't true; it is incoherent to assert the negation of a sentence, and yet to assert its truth; it is incoherent to assert (prove) a disjunction whose disjunct are both incoherent. As discussed in Sect. 2.1, this is what happens in KF + CONS, KF + COMP, and KF respectively.
Many of these critics, including Field and Horsten, are happy to give up classical logic to overcome this incoherence. In fact, by realigning the internal logic of the truth predicate and the external logic of the theory of truth, the asymmetries between provability and truth disappear. For instance, one can construct axiomatizations of fixed point semantics in the style of Halbach and Horsten's PKF (Halbach and Horsten, 2006) in which A and Tr A are interderivable, and whose logic is either the internal logic of KF + CONS, Strong Kleene Logic, or the internal logic LP of KF + COMP. It is clear that, for quite trivial reasons, an analogue of Proposition 1 is not immediately available for such nonclassical systems. The very notion of relative interpretation is not devised to compare theories in different logics. Surely the truth systems would have the same L N -consequences, but nothing like the strict correspondence given by intertranslatability would be available. 17 The purported incoherence of KF + CONS and KF + COMP, however, should be weighed against the cost of giving up well-established logical principles. The adoption of a nonclassical logic impacts directly on contexts in which classical logic is traditionally undisputed, such as mathematics and its applicability to scientific theorizing (Williamson, 2018). We would for instance like to apply mathematical induction to properties involving the notion of truth itself. This obvious task is severely impeded if, say, we move from a classical theory such as KF + CONS to its nonclassical version in Strong Kleene logic. A significant amount of inductive reasoning is lost by adopting a nonclassical logic (Halbach and Nicolai, 2018;Nicolai, 2022).
For theorists who regard the failure of transparency as more palatable than abandoning classical logic, KF + CONS and KF + COMP represent valid theoretical options. In fact, Kripke-Feferman truth has been employed in several theoretical contexts. It is to those that we now turn.

Scientific truth
As it is argued in Fischer et al. (2021), KF (and variants theoreof) can be seen as a theory of scientific truth. The theoretical status of KF, they argue, depends entirely on the success of its applications outside logic. This is unlike nonclassical theories, which are fully characterized by logical properties such as the inter-substitutivity A with Tr A ; these theories have a different epistemological status because their constitutive principles are conceptually necessary. They see applications of KF to the foundations of mathematics as part of the scientific uses of Kripke-Feferman truth. Here we take a different stance: scientific applications of KF will be the ones that fall outside logic and mathematics.
Kripke-Feferman truth, for instance, can be used in semantics, more specifically to articulate the formal properties of a semantic notion of truth. According to Michael Glanzberg (see e.g., Glanzberg (2015)), our implicit grasp of the semantic properties of a language can be made explicit by an act of reflection, involving an explicit characterization of the notion of truth for the language. One such characterization is the formulation of the theory KF + CONS. Glanzberg countenances hierarchies of KF + CONS-axioms to model the open-ended nature of the act of reflecting on one's implicit grasp of the semantic properties of a language. Glanzberg's perspective can be seen as the semanticist's framework to study languages endowed with a self-applicable truth predicate. 18 As such, Glanzberg's programme is not an a-priori enterprise, as it depends on empirical data to calibrate which articulation of Kripke-Feferman truth is more suited for the project; semantic theorizing may well reveal that it is not KF + CONS, but rather KF + COMP the best theory to model truth ascriptions. An analogous programme, using a combination of the KF axioms with other logical resources, is carried out in McGee (1991).
Kripke-Feferman truth has also been employed to provide a diagnosis of the Liar paradox. Maudlin (2004) argued that KF + CONS is the basis of a theory of truth and permissible assertability. Roughly speaking, theorems of KF + CONS such as the Liar sentence that are not true are nonetheless assertible. The view is then completed by an investigation of the norms relating truth and assertability that are compatible with such formal properties.
Since these applications of KF rely in part on empirical data, the import of Proposition 1 on theoretical equivalence touches on the broader discussion of the import of formal reducibility on the equivalence of scientific theories. On a standard neopositivist picture-where a distinction between theoretical and empirical vocabulary is assumed to be available-equivalence of observational consequences is sufficient for theoretical equivalence. Of course, one needs to spell out what this equivalence is, even if at the empirical level only. According to a sensible position, equivalence of observational consequences cannot be a matter of mere translation. 19 Translation cannot discriminate between mere notational differences-e.g., between the theories whose only axioms are 'Orchideen sind Blumen' and 'Orchids are flowers'-and semantic differences-e.g., between the theories 'Orchids are flowers' and 'Lions are cats'. In the latter case, even if the theories are intertranslatable, the operational meaning of empirical vocabulary is lost: ...mere commonality of logical form, even of a total theory when compared with another total theory, is certainly not by itself sufficient for theoretical equivalence. The meanings of the terms in the theories, however construed, are crucial to questions of equivalence. (Sklar 1982, p. 12) In other words, the operational meaning of empirical vocabulary appears to be essential for theoretical equivalence, unless one wants to adopt very strong forms of semantic holism in which the meaning of specific terms can only be fixed once the overall theory underlying all the community's usage of these empirical terms is available. The stance on empirical vocabulary proper of the view should be contrasted with the one on theoretical -e.g., purely logico-mathematical-apparatus of the theories, for which formal equivalence ensures theoretical equivalence in a full sense.
For semantic applications of KF+CONS and KF+COMP, we can reasonably assume that the truth predicate(s) of the theories correspond to the "fixed", observational component of the vocabulary. What to do with the rest, the syntactic/mathematical component of the theories, is a more delicate matter. As discussed in Nicolai (2015), 20 Peano arithmetic plays a double role in traditional axiomatizations of truth. The first is a structural role of providing the basic combinatorics presupposed by speech and writing in natural and formal languages. The second is the role of an object theory in a specific language, whose sentences are apt to semantic scrutiny in the same way as truth-ascriptions are.
The conception of truth that is relevant for semantic applications of Kripke-Feferman truth is then one in which the exact patterns of truth ascriptions uncovered by the theories of truth in question matter, and should be preserved by theoretical equivalence. Each of KF + CONS and KF + COMP provides with incompatible verdicts on some fundamental semantic features of truth, and theoretical equivalence becomes only relevant after (partially) fixing the meaning of truth via one axiomatization. Since the two axiomatizations are incompatible, so are the meanings they assign to their truth predicates. However, nothing prevents one from employing strong notions of intertheoretic reducibility to compare the what corresponds to the "theoretical vocabulary" of the theories. Still, intertranslatability does not seem to determine theoretical equivalence in the semantic sense.
We have mentioned that what is commonly known as the base theory of a theory of truth can be seen as providing a double role. If the base theory is seen only as a theoretical machinery for formal syntax, formal theoretical equivalence can be obtained by formally equivalent choices of this formal syntax. For instance, one can consider the theory ZF fin , Zermelo-Fraenkel set theory with the axiom of infinity replaced by its negation and the axiom stating the existence of the transitive closure of any set (Kaye and Wong, 2007), or the theory HF fromŚwierczkowski (2003) If instead the base theory is considered in its double role, there seem to be two options. One can extend the treatment of the truth predicate to the base language as well by considering the base theory in its role of "object language". In this case, not only semantic predicates need to be preserved by translations, but also the vocabulary of the base theory; in effect, on these assumptions the right notion of theoretical equivalence would arguably amount to what Halvorson calls Heraclitean equivalence: theories should be identified if the are logically equivalent. Again, Proposition 1 would not pose a particular problem to this conception, since theoretical equivalence cuts finer than intertranslatability. A second option is to be faithful to this double role, and to consider instead Kripke-Feferman theories as binary functors on theories operating on a purely structural support theory and an object theory. The formal implementation of the proposal can follow the blueprint of the theories discussed in Leigh and Nicolai (2013). Semantic investigation would then be concerned directly with the truth and falsity predicates and with the second argument of this functor.  [HF, U ] would turn out to be theoretically equivalent on this view. All in all, the semantic conception of Kripke-Feferman truth is compatible with intertranslatability only in a very limited sense; on this view the seemingly puzzling aspects of Proposition 1 are resolved by the realization that intertranslatability is not strict enough for full semantic equivalence.

Truth as a logico-mathematical tool
Truth is often employed in reasoning as a generalizing device, and Kripke-Feferman truth can be employed as a purely logic-mathematical tool. Deflationists about truth believe that this is the only purpose of the truth predicate. Independently of deflationary attitudes, the logico-mathematical character of truth is widely recognized, and so is the essential role played by compositional principles such as KF5−KF8 in the generalizing power of truth. 21 KF in fact originated as a logico-mathematical tool, in the context of Feferman's predicativist view in the philosophy of mathematics. The limits of predicativity had been already investigated by means of the ramified analytical hierarchy in the sixties by Feferman himself and Schütte (Feferman, 1964;Schütte, 1965). Feferman (1991) provides a non-hierarchical framework to capture the limits of predicativity given the natural numbers. The result is a version of KF endowed with a special substitution rule-dubbed Ref * (PA(P)) in Feferman (1991). The theory KF is the simpler version of the reflective closure of PA-i.e., in Feferman's view, the theory capturing the L N -statements that are implicit in the acceptance of PA-, and it is arithmetically equivalent to the union of α < ε 0 iterations of Tarskian truth predicates over PA. This ordinal ε 0 is not ad hoc: it's the supremum of the ordinals that can be proved to be well-founded in the theory whose reflective closure is investigated, i.e., PA. KF then elegantly captures by means of a single, self-applicable truth predicate, the iterations of Tarskian truth along the wellordering that are licensed by the base theory PA.
Another use of Kripke-Feferman truth as a logico-mathematical tool can be found in Reinhardt (1986). Reinhardt advocated KF + CONS as a theoretical tool to uncover the truth-theoretic content of fixed-point semantics, which he recognized to be a successful resolution of the Liar paradox. Theorems of KF+CONS of the form Tr A are members of the extension of the truth predicate of all consistent fixed points. Therefore, one may employ KF+CONS as an efficient reasoning tool to uncover truths without giving in to the clumsiness of nonclassical conditionals proper of direct axiomatizations of fixed-point semantics.
Besides Feferman's study of the implicit commitment of formal theories, the phenomenon of incompleteness of mathematical theories prompted more daring philosophical questions, still related to the logico-mathematical nature of truth. One such question is whether the incompleteness theorems show that the human mind can be mechanized. Roger Penrose formulated an interesting argument against mechanism based on the notions of truth and absolute provability Penrose (1994). Penrose wasn't careful in calibrating the exact list of principles of truth employed in the argument. This task has been recently taken up by logicians and philosophers (Koellner, 2018;Stern, 2018). In particular, Stern analyzes Penrose's argument by formalizing it in KF + CONS: he shows that mechanism can be refuted in KF + CONS, although this refutation cannot fall into the extension of the truth predicate of KF + CONS (as we have seen, this pattern is quite common in KF + CONS).
In the logico-mathematical conception, the generalizing power of the truth predicate is a constitutive feature of truth. The truth predicate ought to enable one to achieve deductive or expressive strength, e.g., by proving reflection principles for the base theory, or by replacing set-existence assumptions. In this picture, the non-structural, semantic component of theoretical equivalence considered in empirical applications is less relevant. Therefore, the intertranslatability of KF+CONS and KF+COMP appears to be sufficient for theoretical equivalence. After all, Proposition 1 entails that the theories have equal consistency strength, and the specific nature of the interpretations K and L, which preserve L N -vocabulary, entails that the theories will have the same consequences in L N . More importantly, general claims are preserved in a strong way via the result. Consider again the generalization ∀ϕ∀ψ(Tr(ϕ → . ψ) ∧ Trϕ → Trψ) (K) stating that Tr is closed under the material conditional. We have seen that (K) is a theorem of KF + CONS but not of KF + COMP. Yet, the required generality can be recaptured in KF + COMP via ∀ϕ∀ψ(Tr K (ϕ → . ψ) ∧ Tr K ϕ → Tr K ψ) K leaves the structure of the objects of truth unchanged, so that the generalization is performed over a given ontology, and the interpretation only operates on the specific generalizing role that the truth predicate of KF + CONS plays in (K). A symmetric case can be made for KF + COMP and L, if one starts with the theorem of KF + COMP ∀ϕ∀ψ((Trϕ → Trψ) → Tr(ϕ → . ψ)).
Analogously, we can consider the theorem of KF + COMP stating that all instances of excluded middle in L Tr,F are true: ∀ϕ(LEM(ϕ) → Trϕ).
What we just said, however, leaves open whether intertranslatability is also necessary for theoretical equivalence in the logico-mathematical conception. To mimic generalizations such as (K), (2), and (3) one requires at least the existence of a truthdefinition in the sense of Sect. 4. Surely, for the reasons discussed above, mutual interpretability would not be sufficient. However, also mutual-truth definability is dubious: we mentioned above that some type-free theories of truth are mutually truthdefinable with typed theories of truth. Generalizations in one theory acquire a different logical role when translated in this way: a generalization on all sentences of L Tr,F may then become a generalization on sentences that only have a certain amount of Tarskian truth predicates. This seems to compromise the role of truth as a generalizing device, because some syntactic generalizations are in fact restricted by truth-definitions.
Intertranslatability is certainly a safer option. For one thing, in intertranslatable theories the generalizing roles of the two truth predicates are deeply intertwined, in a much more explicit way than in mutually-truth definable theories. Each theory can not only mimic truth-theoretic generalizations over a common syntactic base, but it has also the means to recognize how its truth predicate is used in the other theory, and what is required to revert back to its own truth predicate. The KF + CONS-theorist can define a predicate, Tr K (cf. Sect. 4), satisfying the axioms of KF + COMP, and verify that the definition of its own truth predicate by the KF + COMP-theorist given by the intepretation L returns precisely its own truth predicate. The KF + COMP-theorist can do the same by inverting the roles of the interpretations. In other words, each theorist not only can define in a natural way the other's truth predicate, but they can also see that the other's truth definition is a faithful one, returning their own primitive generalizing device. This is unlike what happens in mutual truth-definitions, where there may be no duality of interpretations, and the equivalence between the two kinds of generalizing tools may only be available from an external point of view. For instance, we have seen that the theory PUTB and KF are mutually-truth definable. However, the relevant interpretations are not dual, since otheriwse PUTB would prove the full compositional axioms of KF, which is not possible. 22 In the logico-mathematical conception of truth, the intertranslatability of KF + CONS and KF + COMP can be fully embraced. The consistency or completeness of truth does not constitute the raison d'être of truth, and intertranslatability preserves unequivocally the generalizing nature of the truth predicate.