Truth, Topicality, and Transparency: One-Component Versus Two-Component Semantics

When do two sentences say the same thing, that is, express the same content? We defend two-component (2C) semantics: the view that propositional contents comprise (at least) two irreducibly distinct constituents, (1) truth-conditions, and (2) subject-matter. We contrast 2C with one-component (1C) semantics, focusing on the view that subject-matter is reducible to truth-conditions. We identify exponents of this view and argue in favor of 2C. An appendix proposes a general formal template for propositional 2C semantics.


Introduction
'Jane is a lawyer' says something about Jane's profession, that is true just in case she is a lawyer.So one way to model the content of a meaningful declarative sentence ϕ is as a pair T ϕ , S ϕ : T ϕ denotes the Truth conditions of ϕ, determining the circumstances under which ϕ is true (and under which ϕ is false, if the latter are to be this, but his remedy is to incorporate partial states into the space of truth-supporting circumstances.Thus, content is still identified with the circumstances at which it is true. More recently, 2C theories are ascendant.Yablo (2014, p. 2) aims for a view that "makes subject-matter an independent factor in meaning, constrained but not determined by truth-conditions".Hawke (2016Hawke ( , 2018)), Plebani and Spolaore (2021) and Hoek (2022) offer 2C modifications of Lewis (1988a).The triplet Ferguson (2023aFerguson ( , 2023bFerguson ( , 2023c) develops an abstract 2C account proposed by two of us-PH and FBin Berto (2022) and applies it to a variety of topics in modal and epistemic logic.Hawke et al. (2020) apply it to the logic of ordinary knowledge ascription (tackling the problem of logical omniscience).Özgün and Schoonen (2022) apply it to the logic of imagination episodes.Berto and Hornischer (2023) use it to provide an account of cognitive synonymy.
What, if anything, recommends 2C theories over T ⇒ S style 1C theories?We argue against T ⇒ S using minimal resources, then unify the case against 1C.Along the way, we separate the wheat from the chaff: we explicate two prominent (though typically implicit) arguments against T ⇒ S, each of which, we argue, the T ⇒ S theorist has the resources to challenge.Our preferred argument against T ⇒ S appeals only to features rooted in pre-theoretic intuition and widely deployed by prior theorists: we take truthconditions to be intimately related to logical properties, we take a conjunction to include the subject-matter of its conjuncts, and we take the subject-matter of a valid conclusion to sometimes outstrip that of its premises.To unify the case against 1C, we subsume both our case against T ⇒ S and the Yablovian case against S ⇒ T under a broader argument.We call it the argument from transparency.
We stay as neutral as possible on the nature of truth-conditions, topicality, and content.We leave it open whether truth-conditions should be formulated in terms of complete or partial states; whether a refined 1C theorist or 2C theorist ought to embrace further components to content (Fregean senses, presuppositional content), or two-dimensionalism à la Chalmers (2011); whether content has an underlying, unified structure which generates both truth-conditions and subject-matter.
Thus, 1C should not be confused with the stronger view that content is identical to truth-conditions, let alone the specific interpretation of these as given by a set of metaphysically possible worlds (Stalnaker, 1984).2C should not be confused with the neo-Russellian view that a propositional content has structure that largely reflects the syntax of declaratives that can express it (Soames, 1987).Neo-Russellianism per se is consistent with 1C, if the subject-matter of ϕ is identified with the Russellian proposition ϕ expresses, with truth-conditions treated as derivative.It is also consistent with 2C, if a Russellian proposition generates both subject-matter and truth-conditions, but shouldn't be identified with either.
We proceed as follows.Section 2 fixes our assumptions about truth-conditions and subject-matter.Section 3 presents a first argument against T ⇒ S that invites a pointed response: the argument from topic-divergent necessities.Section 4 presents a second argument against T ⇒ S that invites a pointed response: the argument from Yablo's thesis.Section 5.1 presents our preferred criticism of T ⇒ S; Sect.5.2 criticizes on its basis specific T ⇒ S approaches found in the literature.Section 6 draws on the apparent topic-transparency of the connectives to broaden our case, targeting 1C in general.
We add an Appendix with an abstract template for formal 2C semantics, capable of incorporating topic-transparency for the standard connectives, while allowing finegrained truth-conditions and neutrality on the structure of subject-matter.

Preliminaries
We take true, about, topic, subject-matter, follows from and cognate concepts as core to semantics, basic competence with which is reflected in ordinary meta-linguistic judgments.We thus take semantic theorizing as geared towards understanding such notions and responsive to pre-theoretic judgments on them.

Truth-conditions
We assume that there is an intimate relationship between truth-conditions and pretheoretic judgments on logical consequence: identical truth-conditions implicate identical logical properties, and vice versa.('To discover truths is the task of all sciences; it falls to logic to discern the laws of truth', Frege (1984, p. 351)).Though not completely uncontroversial (e.g., questioned in the tradition of dynamic semantics, as a helpful referee reminds us), the idea that logical consequence is tightly tied to truth preservation enjoys widespread support.
To make this precise, let ϕ denote ϕ's truth set: the set of all logically possible circumstances at which ϕ is true.What we mean by this is that the function assigns to every declarative a set of truth-supporting circumstances where ϕ logically entails ψ iff ϕ ⊆ ψ , ϕ and ψ are logically equivalent iff ϕ = ψ , and ϕ and ψ are logically contrary iff ϕ ∩ ψ = ∅ (van Fraassen, 1968).Given this, our opening assumption is essentially that ϕ's truth-conditions are individuated by its truth set: T ϕ = T ψ iff ϕ = ψ .(We often take ϕ's falsity set to be a function of its truth set, for simplicity.But we'll discuss views that spell out truth and falsity conditions separately.Then ϕ's truth-and-falsity-conditions can be taken as a pair.) Then patterns of logical entailment, equivalence, or contrariety will constrain truth-conditional semantics (as per standard semantics textbooks, e.g., Chierchia and McConnell-Ginet (1990)).For example, the entailment from 'Jim is unmarried and male' to 'Jim is male' corresponds to a truth-conditional law: (3) At every logically possible circumstance, if 'Jim is unmarried and male' is true then 'Jim is male' is true, too.
It's controversial how fine-grained the space of logically possible circumstances needs to be for to do its job.(Complete worlds?Partial situations?Inclusion of some metaphysically impossible circumstances?) It's also controversial whether a comprehensive theory of content also needs truth-supporting circumstances that misrepresent truth-conditions-logically impossible circumstances (see, e.g., Priest (2005)) where logic is different.We maintain neutrality on both counts.
Because we take ϕ to individuate the truth-conditions for ϕ, it conveniently simplifies our discussion to assume that ϕ = T ϕ : ϕ's truth-conditions just are given by its truth set.(Or, by its truth set ϕ and falsity set ¬ϕ in pair.) We use ¬ and ∧ for the propositional connectives, typically expressed by 'not' and 'and'.We assume they exhibit basic truth-conditional properties that uncontroversially correspond to mundane patterns of valid reasoning.For example, ϕ ∧ ψ is true only if both ϕ and ψ are true (at any logically possible circumstance) reflects the validity of Simplification in ordinary discourse.This is not to deny that 'not' and 'and' sometimes serve further functions in natural language, of course (e.g., dynamic conjunction, Humberstone, 2011, Sects. 5.11-5.12;meta-linguistic negation, Horn, 1989, Ch. 6;intensional conjunction, Humberstone, 2011, Sect. 5.16).

Subject-matter
We use t for an arbitrary topic and boldface to denote individual topics, e.g., Jane's profession, mathematics.For our argument to have broad applicability, we maintain neutrality on the nature of topics.Some (Lewis, 1988a;Roberts, 2012;Plebani & Spolaore, 2021) link topics to questions: 'Our topic is the number of stars' comes with the nearby question, 'How many stars are there?'On the other hand, any kind of worldly object or event may serve as a conversational topic: 'Our topic today is Barack Obama'; 'In this module we'll talk about the French revolution'.The two strands may pull in opposite directions (Hawke, 2018;Berto, 2022, Ch. 2).So we simply denote the topic associated with object a as a, leaving it open whether a just is a, or the set of possible ways things can be with respect to a, or the states involving a as a constituent, or something else yet.
Next, there is an intuitive distinction between a sentence being wholly about a topic or only partially about a topic (Lewis, 1988b): ϕ is partly about t just in case part of what ϕ says is about t ('Jane practices karate and Jim practices judo' is only partly about Jane).ϕ is wholly about t just in case no part of what ϕ says isn't about t ('Jane practices karate and judo' is wholly about Jane).We'll use 'about' inclusively, allowing partial aboutness.
Let ϕ denote ϕ's topic set: all that ϕ is about.We take it that ϕ's subject-matter is individuated by ϕ : S ϕ = S ψ iff ϕ = ψ .It conveniently simplifies our discussion to assume that ϕ = S ϕ : ϕ's subject-matter just is its topic set. 3verall, ϕ and ϕ denote two integral aspects of [ϕ], the content of ϕ.Let's now focus on their relation.

From topic-divergent necessities
Here's a first argument against T ⇒ S.

The argument
The orthodox view on truth-conditions (or, the closest we have to one) takes the truth-conditions for ϕ to be individuated by the set of metaphysically (as we say, post-Kripke) possible worlds at which ϕ is true.But combining orthodoxy with pre-theoretic judgment delivers prima facie counterexamples to T ⇒ S: Plausibly, these are true at the same possible worlds, i.e., all of them.So, following orthodoxy, they have the same truth-conditions.But only one is about π .

The reply
But a T ⇒ S theorist can claim that (4) and ( 5) help us to see that orthodoxy is mistaken.ϕ entails ψ iff every circumstance that verifies ϕ, verifies ψ.Now if the circumstances in question are constrained to the metaphysically possible worlds, (4) entails (5).But the first claim intuitively doesn't support the second: no mathematician would take the truth of '1+1 = 2' as a conclusive reason to accept 'π is irrational'.We just need a refined notion of circumstance, with refined accounts of truth-conditions and entailment in tow.This is a motivation, e.g., for relevance logicians (Anderson & Belnap, 1975;Anderson et al., 1992;Beall & Restall, 2006) and situation theorists (Barwise & Perry, 1983) for supplementing the possible worlds in their model theory with partial/impossible situations.But now it is no longer obvious that such refined truth-conditions don't determine subject-matter.Unlike (5), (4) plausibly isn't verified by a partial situation featuring π but not 2.
The argument against T ⇒ S isn't rescued simply by replacing (4) and ( 5) with presumed logical truths (say, 'John is infected, or not' versus 'Jack is infected, or not').For analogous reasoning may be deployed: to avoid the counter-intuitive prediction that 'Obama is a lawyer' deductively supports 'John is infected, or not', one had better posit partial/impossible circumstances at which the former is true but not the latter.But now it is far from clear that 'John is infected, or not' and 'Jack is infected, or not' have identical truth-conditions (or genuinely count as logical truths); only the former is true relative to a situation featuring John but not Jack.
Die-hard defenders of classical logic may be unmoved, but this is cold comfort for those less sanguine about the debates on relevance logic and logical consequence, or hoping to defeat 1C with easy counterexamples.The effectiveness of our first argument against T ⇒ S is mired in core disputes in philosophy of logic.

Perry, Lewis, and Fine as T ⇒ S
One good thing the above argument does is that it highlights resources available to T ⇒ S theorists.In particular, refining the space of truth-supporting circumstances may get a better fix on subject-matter.Perry (1989) argues for treating propositions as sets of partial situations, precisely to address what he calls the subject-matter problem: if propositions are merely sets of possible worlds, then if any claim is about t then every claim is about t.His argument: assume that ϕ is about t.Then, intuitively, ϕ ∨ ¬ϕ is also about t.Then, intuitively, ψ ∧ (ϕ ∨¬ϕ) is about t.But if the possible-worlds view is true, ψ is then about t (for, [ψ] = ψ = ψ ∧ (ϕ ∨ ¬ϕ) = [ψ ∧ (ϕ ∨ ¬ϕ)] and, trivially, identical propositions have identical aboutness properties).Perry's solution is to resist the identity ψ = ψ ∧ (ϕ ∨ ¬ϕ) , by resisting the identification of propositions with sets of possible worlds.
There are at least three influential accounts of subject-matter which take propositions as sets of partial situations, and can then explain the difference in subject-matter between ( 4) and ( 5) in terms of differing truth-conditions.These show how 1C semantics, in the T ⇒ S version, is well-established in the literature.
Perry's account.According to Perry (1989), ϕ is about o exactly when o is part of every situation in ϕ's truth set ϕ .That is, T ϕ fixes S ϕ via the function f that maps ϕ to a set of objects ϕ : those that exist at every situation in ϕ .This fits with any number of accounts of truth-conditions (e.g., classical logic, strong Kleene logic, weak Kleene logic, etc.).Note that if a disjunction is true exactly when one of its disjuncts is true, Perry's account entails that 'Ann is a lawyer or Bob is an accountant' isn't about Ann and isn't about Bob; presumably neither Ann nor Bob is included in every situation where only one disjunct is true.To avoid this, one may drop the assumption about disjunctions (embracing, say, weak Kleene logic) or adopt a Perryean variant: ϕ is about object o exactly when either o is part of every situation in ϕ's truth set ϕ or o is part of every situation in ϕ's falsity set ¬ϕ .Now 'Ann is a lawyer or Bob is an accountant' is about Ann and Bob because every situation that satisfies 'Ann isn't a lawyer and Bob isn't an accountant' includes Ann and Bob.
Lewis' account.According to Lewis (1988a), a topic t is a partition (understood as a question) dividing logical space into ways a subject can be; ϕ is about t exactly when t refines the binary partition composed of ϕ's truth set and its complement.That is, T ϕ fixes S ϕ via the function f that maps ϕ to the partitions refining its binary partition.As Lewis notes, if ϕ is merely a set of possible worlds, then f egregiously maps every necessary truth to the same subject-matter; but if ϕ also includes the partial or impossible situations where ϕ is true, the subject-matter of necessary truths (e.g., (4), ( 5)) can be differentiated.Note that Lewis (1988a) takes his account to only capture when a sentence is wholly about a topic.We return to this in Sect.5.2.
Fine's account.According to Fine (2016b), a topic t is a (potentially partial) situation, and ϕ is about t exactly when t overlaps with any of a certain subset of the partial situations at which ϕ is true: the exact verifiers and exact falsifiers of ϕ.This is a 1C, T ⇒ S view, if one assumes that ϕ's truth-conditions T ϕ are individuated by its exact verifiers and exact falsifiers, fixing ϕ's subject-matter as follows: = the set of states that overlap the fusion of every state in the union of ϕ's exact verifiers and falsifiers.Intuitively, an exact verifier for ϕ may be thought of as a wholly relevant truthmaker for ϕ and an exact falsifier for ϕ as a wholly relevant falsemaker for ϕ.A truthmaker for ϕ is a situation s which, if part of a world, explains why ϕ is true at that world.A wholly relevant truthmaker for ϕ contains no parts that are irrelevant to this explanation.'Plato is wearing a red toga' is made true by any situation where Plato and Socrates are both wearing red togas.But this isn't exact: the goings-on with Socrates are irrelevant.In contrast, a situation in which Plato is appropriately attired-no more, no less-is an exact truthmaker for 'Plato is wearing a red toga'.The fusion of ϕ's exact verifiers and falsifiers, then, is a plausible representation of ϕ's subject-matter insofar as it collects all and only states that are wholly relevant to ϕ's truth or falsity.The situation that Plato and Socrates are both wearing red togas forces the truth of 'Plato is wearing a red toga', but doesn't pinpoint the latter's subject-matter, given the irrelevance of Socrates' attire.These ideas find technical expression via natural recursive constraints on the exact verification relation between situations and sentences (written ), and the exact falsification relation ( ), inspired by van Fraassen (1969) (cf.Yablo, 2014, Sect.4.2): s ¬ϕ iff s ϕ s ¬ϕ iff s ϕ s ϕ ∧ ψ iff s is the fusion of some t and u where t ϕ and u ψ s ϕ ∧ ψ iff s ϕ or s ψ s ϕ ∨ ψ iff s ϕ or s ψ s ϕ ∨ ψ iff s is the fusion of some t and u where t ϕ and u ψ Then, a T ⇒ S construal of Fine's theory says this: T ϕ is individuated by the pair ϕ = {s : s ϕ} and ¬ϕ = {s : s ϕ}, generating subject-matter ϕ as the set of states that overlap the fusion of the situations in ϕ and ¬ϕ .
The logic of cognitive attitude ascriptions is captured, one might think, by two facts: (6) Immanent Closure: "If S knows that P, and Q is part of P, then S knows that Q" (Yablo, 2014, p. 117) (7) Yablo's Thesis: "Content-inclusion is implication plus subject-matter inclusion" (Yablo, 2014, p. 15) But combining these with T ⇒ S egregiously implies that knowledge ascriptions are closed under mere entailment.So, T ⇒ S is false.
To unpack: note, first, that facts about same-saying and partial content seem mirrored in the logic of attitude ascriptions.Consider: (8) Jane is an experienced fisherman and an actuary.(9) Jane is an experienced fisherman.(10) Jane is a fisherman.
(9) plausibly expresses a proper part of (8)'s content: if ( 9) is true then (8) is at least partly true.(Ann claims 'Jane is an experienced fisherman and an actuary'; Bob claims: 'Jane is an experienced fisherman'; what Bob says has already been said by Ann-who said more: that Jane is also an actuary.)(10) expresses a proper part of the content of ( 9).(Carla says: 'Jane is a fisherman': Bob already said this, and more: she's experienced.)Compare: (11) David knows that Jane is an experienced fisherman and an actuary.(12) David knows that Jane is an experienced fisherman.(13) David knows that Jane is a fisherman.
Mirroring the above, (11) cannot hold without (12), and (12) cannot hold without (13).Moreover, this doesn't depend on David's logical skills (Soames, 1987).An easy inference delivers knowledge that the number of apples in the hamper is less than a googol, if it is already known that there are exactly two apples.But one can have the latter knowledge without the former: one didn't bother to draw the inference, or, as with a small child, is bereft of requisite mathematical knowledge.The relationships between ( 11)-( 13) seem different: it is impossible to know that Jane is an experienced fisherman without knowing that she is a fisherman, no matter one's logical or epistemic impairments.Jane being a fisherman is part of what one knows when one knows that Jane is an experienced fisherman.Likewise, one cannot believe that Jane is rich and powerful without believing that she is rich. 4et 'ϕ ψ' say that the content of ϕ contains that of ψ as a part: ϕ says whatever ψ says.Generalizing the above judgments delivers two principles: Clearly, isn't just entailment: if it were, (15) would egregiously imply that ordinary thinkers are logically omniscient.Now notice that (8) includes (9)'s subjectmatter, and (9) includes (10)'s subject-matter.Generalizing in the obvious way delivers one elaboration of Yablo's thesis: in particular, we take 'is' in the thesis as a biconditional and 'implication' as logical entailment, and assume that the subject-matter of ϕ includes that of ψ exactly when ϕ is about everything that ψ is about: This amounts to identifying content-inclusion with Parry-implication (Parry, 1968;Fine, 1986;Parry, 1989;Ferguson, 2015). 5The left-to-right direction of ( 16) addresses logical omniscience: one can know ϕ but not its consequence ψ when ψ expands the subject-matter of ϕ.The converse direction also offers attractive explanatory power: on the plausible assumption that a conjunction merely merges the subject-matter of its conjuncts, (16) entails principle ( 14), explaining our reaction to, e.g., ( 8) and ( 9).With (15), it explains our reaction to (11)-( 13).Now here's the second argument against T ⇒ S: logical omniscience comes roaring back if one combines T ⇒ S with ( 14), (15), and ( 16).Consider ϕ and ψ, where the former entails the latter.By ( 14), ϕ ∧ ψ ψ.So, by the left-to-right direction of ( 16), ψ is about topic t only if ϕ ∧ ψ is about t.As ϕ and ϕ ∧ ψ have identical truth-conditions, it follows by T ⇒ S that ψ is about topic t only if ϕ is about t.Thus, by the right-to-left direction of ( 16), ϕ ψ.But then (15) delivers: knowing ϕ entails knowing ψ.

The reply
But again the T ⇒ S theorist can resist the argument: there are apparent counterexamples to the right-to-left direction of Strong Yablo.'Jane is an actuary' plausibly Parry-implies 'Jane is or is not an actuary': p entails p ∨ ¬ p. Plausibly, p and p ∨ ¬ p have the same subject-matter.But 'Jane is or is not an actuary' is not, one might think, part of the content of 'Jane is an actuary'.If it were, 'Jane is an actuary' would be partly true whenever 'Jane is or is not an actuary' is true.But the latter is true if Jane is not an actuary, and then 'Jane is an actuary' isn't even partly true.

Fine again
One might think that a better account of content-inclusion (and perhaps an alternative elaboration of Yablo's thesis) is readily available to the T ⇒ S theorist.Suppose one embraces Fine's recursive truthmaker semantics, with the T ⇒ S construal of Sect.3.3.Then, following Fine (2017) (cf.Yablo, 2014, Sect.3), one can say that ϕ has ψ as a part just in case any state that makes ψ true makes ϕ partially true.To elaborate: ϕ ψ iff (i) every state that exactly verifies ϕ includes some state that exactly verifies ψ and (ii) every state that exactly verifies ψ is part of some state that exactly verifies ϕ. (On the T ⇒ S construal: ϕ ψ iff (i) if s ∈ ϕ then part of s is in ψ and (ii) if s ∈ ψ then s is part of a state in ϕ .)Thus, if ϕ is true and ϕ includes ψ, then ψ must also be true; if ψ is true and ϕ includes ψ, then the actual world contains at least part of a truthmaker for ϕ.On this account, p does not include p ∨ ¬p: a possible world where p ∨ ¬p is true merely because ¬ p is true need not contain part of a truthmaker for p.

From topic-divergent logical equivalents
We finally present our own preferred argument against T ⇒ S. We then use its rather minimal assumptions to specify objectionable features of the T ⇒ S exemplars outlined in Sect.3.3.

The argument
The argument's key assumptions are ( 17)-( 21) below.Let c be any logically possible circumstance, i.e., any truth-supporting circumstance that respects the actual laws of logic.Then, for any interpreted ϕ and ψ:  (20) Inflation: There exists interpreted declaratives α and β such that (i) β is about something that α isn't about, (ii) α entails β, and (iii) β anti-entails α (i.e., at every logically possible circumstance, if β is false then α is false).
(If the falsity set of a sentence is always a well-behaved function of its truth set, then (iii) is superfluous for the argument.) Now ( 17) and ( 18) are paradigmatic truth-conditional facts, reflecting exceptionally mundane valid reasoning: Simplification, Adjunction, their contrapositives.Their denial is equally disturbing to classical logicians and relevance logicians (Belnap, 1977), at best changing the subject to something other than the actual truthconditions for the standard conjunction.
To appreciate (19), recall the characterization of truth-conditions in Sect.2.1.Perhaps there are logically impossible circumstances: worlds at which logic is different, or where the actual truth-conditional laws fail.Perhaps these are essential to semantics, with quantification over deviant circumstances crucial in assigning truth values to counter-possible conditionals or reports of anarchic attitudes like imagination (Nolan, 1997;Priest, 2005).But as such circumstances misrepresent truth-conditions, their existence is irrelevant to the truth of ( 19).
(20) has abundant common sense support.Take 'No gerbil drinks whiskey' for α and 'No gerbil drinks whiskey with British royalty' for β (only the latter talks about British royalty); or 'Obama isn't a dentist' for α and 'Obama isn't both a dentist and a bachelor' for β (only the latter talks about Obama's marital status); or 'Only humans philosophize' for α and 'Non-human androids do not philosophize' for β (only the latter talks about androids).
Combined with relatively innocuous assumptions, denying (20) issues in absurdity.Suppose ϕ entails ψ and ψ anti-entails ϕ (say, ϕ is 'Ann is a lawyer and Bob is a lawyer' and ψ is 'Ann is a lawyer').It presumably follows that ¬ψ entails ¬ϕ and that ¬ϕ anti − entails ¬ψ .Denying (20), we conclude: ψ ⊆ ϕ and ¬ϕ ⊆ ¬ψ .Now assume that negation preserves subject-matter (cf.Yablo's case against S ⇒ T, per).We conclude ϕ ⊆ ψ ; so, ϕ = ψ .But this is absurd: it seems obvious that 'Ann is a lawyer and Bob is a lawyer' is about Bob, while 'Ann is a lawyer' is not.
(21) also finds support in common sense.'Ann is a lawyer' is about Ann; 'Ann is a lawyer and Bob is an accountant' is also about Ann (among other things, such as Bob).This seems generalizable: to say ϕ ∧ ψ is to say, at least, no less than to merely say ϕ.
But given ( 17)-( 21), T ⇒ S is false.Per (20), let α and β be interpreted sentences such that there is a topic t that β is about but α is not about, α entails β, and β antientails α.By ( 19), α and α ∧ β have identical truth-conditions.For if α is true at logically possible circumstance c, then α and β are true at c (as α entails β) and so α ∧ β is true at c, by ( 17).If α ∧ β is true at c, then α is true, also by ( 17).On the other hand, if α is false at c, α ∧ β is false, by ( 18).If α ∧ β is false at c, then α is false or β is false, by ( 18), and either way, α is false (as β anti-entails α).Thus, if T ⇒ S holds, ∈ α , it follows that α = α ∧ β .By modus tollens, T ⇒ S is false.

Critiquing T ⇒ S theories
Our argument in Sect.5.1 pinpoints criticisms of the T ⇒ S style 1C theories from Sect.3.3: equipping situation theory with Perry's account of subject-matter violates assumption (20) (or, on a variation of the account, ( 21)), equipping it with Lewis' account violates ( 21), and equipping it with Fine's account violates (17).
Perry.Recall: Perry (1989) models subject-matter ϕ as the set of objects that exist at every situation in truth set ϕ .It follows that if α entails β, β anti-entails α, and β is about t, then α is about t: if object o exists at every situation where β is true and the only situations where α is true are β-situations, then o must exist at every situation where α is true.
Section 3.3 also considered a Perryean variant: o ∈ ϕ exactly when either o exists at every situation in truth set ϕ or at every situation in falsity set ¬ϕ .This variant satisfies (20): as Bob is included in any situation where 'neither Ann nor Bob is a lawyer' is true, 'Either Ann or Bob is a lawyer' is about Bob on our Perryean variant, unlike 'Ann is a lawyer'.But it violates (21); we leave this to a footnote. 6 Lewis.Recall: Lewis (1988a) models topics as partitions of logical space, and subject-matter ϕ as the set of refinements of the binary partition that divides the space of all logically possibly circumstances into ϕ and its complement.Hence, ϕ is about topic (i.e., partition) t when t ∈ ϕ .Trivially, ϕ is about its associated binary 6 We require p and q where: (i) every ¬q-situation includes o, (ii) not every p ∧ q-situation (and so not every p situation) includes o, and (iii) not every ¬ p ∨ ¬q-situation includes o.If (i) holds, q is about o, on our Perryean account.If (ii) and (iii) hold, p ∧ q isn't about o, on our Perryean account.The following example does the job: take 'Ann is fussy about fashion' for p and 'Ann either doesn't like Bob's outfit or doesn't like Carla's outfit' for q (so ¬q is 'Ann likes Bob's outfit and likes Carla's outfit').Then (i) is satisfied.Situations where Ann likes Bob's outfit, or doesn't like Bob's outfit, include Bob.So situations where Ann both likes Bob's outfit and likes Carla's outfit include Bob.(ii) is satisfied.Not every situation where Ann is fussy about fashion and either dislikes Bob's outfit or Carla's outfit is a situation that includes Bob.Some such situations include only Ann and Carla: Ann is fussy about fashion and dislikes Carla's outfit.(iii) is satisfied.Not every situation where either Ann isn't fussy about fashion or likes both Bob's outfit and Carla's outfit is one that includes Bob.Some such situations include only Ann.Altogether, on our modified Perryean account, 'Ann doesn't like Bob's outfit or doesn't like Carla's outfit' is about Bob, but 'Ann is fussy about fashion and either doesn't like Bob's outfit or doesn't like Carla's outfit' isn't about Bob.
partition. in general there is no reason why the binary partition of q and its complement should refine the binary partition of p ∧ q and its complement: the set of situations where Bob is an accountant is coarser than the set of situations where Ann is a lawyer and Bob is an accountant.Hence, on the Lewisian picture, q can be about t despite p ∧ q not being about t.Lewis (1988a) seems aware of the issue; he dodges it by insisting that the above account of 'aboutness' only covers when ϕ is wholly about a topic.We do not expect Conjunct Containment (i.e., ( 21)) to hold when restricted to 'wholly about': that ψ is wholly about t does not, in general, imply that ϕ ∧ ψ is wholly about t.One part of ϕ ∧ ψ-namely, ϕ-may not be about t.Lewis (1988b) suggests that we recover partial aboutness from his account as follows: ϕ is partially about t exactly when ϕ has a part that is wholly about t.But this lands the Lewisian with another problem: they owe us an independent account of content-parthood.Lewis (1988b, Sect. VIII) suggests that ψ is part of ϕ exactly when ϕ entails ψ.But this is problematic: p entails p ∨ ¬p but the truth of p ∨ ¬p (e.g., in virtue of ¬ p being true) does not guarantee that p is partially true (cf.Sect.4.2).
Fine.Recall: Fine (2016b) provides the tools for a state-based approach to T ⇒ S. One takes T ϕ to be composed of two sets of states: a set of 'exact verifiers' and a set of 'exact falsifiers' (or only one set, if the former determines the latter).These fix subject-matter: S ϕ = ϕ = f (T ϕ ) = the states that overlap the fusion of every state in the union of those sets.To extend this to a version of T ⇒ S, we can then stipulate that ϕ's truth set ϕ is identical to the set of its exact verifiers and ϕ's falsity set ¬ϕ is identical to the set of its exact falsifiers.But this is to interpret s ϕ ('s is an exact truthmaker for ϕ') as 'ϕ is true at s'.
However, assuming (17), the preceding is no satisfactory account of truthconditions.As it is consistent for s p ∧ q to hold without s p (the part of s that exactly verifies q might fail to exactly verify p), the proposed account of truthconditions egregiously allows for p ∧ q to be true at s without p being true.Let |ϕ| denote the set of circumstances that exactly verify ϕ.Hence, |ϕ| shouldn't be identified with the truth set ϕ , for we require p ∧ q ⊆ p , but | p ∧ q| ⊆ |p| doesn't hold (cf.Fine & Jago, 2019).
A better account of 'being true' is available to the Finean (cf.van Fraassen, 1969, pp. 483-484;Fine, 2017, pp. 668-669): ϕ is true at s iff part of s is an exact truthmaker for ϕ (i.e., s includes some t such that t ϕ).Taking entailment as truth-preservation and the logically possible circumstances as the set of all states, it is straightforwardly verified that the ensuing account of truth-conditions and subject-matter satisfies assumptions ( 17)-( 21).Hence, setting ϕ to be the set of states at which ϕ is true (as defined here), we can rehearse the argument of Sect.5.1 to show that the present account of truth-conditions and subject-matter entails 2C.
So in the end, Fine's semantics is better interpreted along 2C lines!There are serious objections to (as above) taking its verification conditions as mere truth-conditions, while the most natural means for generating truth-conditions from them delivers a 2C framework.

Against 1C from transparency
If the are true (call their conjunction Transparency), the case against 1C can be systematized, building on the argument from Sect. 5. (With ϕ ∨ψ standing for ¬(¬ϕ ∧¬ψ), we have: ϕ ∨ψ = ϕ ∪ ψ .)These say that the truth-functional logical vocabulary is transparent with respect to subject-matter: it adds none of its own.7

The argument
Recall how Yablo (2014, Sect.2.8) notes that S ⇒ T conflicts with Transparency.If there is an f such that T ϕ = f (S ϕ ) for all ϕ, then Transparency egregiously mandates that p and ¬ p are always true in the same logically possible circumstances.
But as our argument in Sect.5.1 shows, T ⇒ S also conflicts with Transparency (in conjunction with uncontentious truth-conditional facts), as Transparency implies Conjunct Containment.Indeed, given further light assumptions about truth-conditions, Transparency also implies Inflation.Consider a variant of our argument that replaces Inflation with: (24) ¬ϕ is true at c iff ϕ is false at c. (25) ¬ϕ is false at c iff ϕ is true at c.
Let p and q be interpreted sentences such that there is a topic t that q is about but p is not about.One easily verifies that (17), ( 18), ( 19), (24), and (25) together entail that ¬ p and ¬ p ∧¬( p ∧q) have identical truth-conditions.So, T ⇒ S implies that ¬ p and ¬ p ∧¬( p ∧q) have identical subject-matter.But Transparency implies ¬ p ∧¬( p ∧q) is about something that ¬ p isn't about (for ¬ p = p and ¬ p ∧ ¬( p ∧ q) = p ∪ q ).So, Transparency implies Inflation and contradicts T ⇒ S.This used the benign assumption that declaratives can have different subject-matter.Thus, the argument can be re-framed as a generalization of Perry's subject-matter problem (Sect.3.3), targeting even his own T ⇒ S theory: given both Transparency and uncontroversial truth-conditional facts, T ⇒ S implies, absurdly, that every declarative must have the same subject-matter.
Given Transparency, we may thus label our summarized case against 1C as the argument from transparency: Transparency is true; if Transparency is true then S ⇒ T and T ⇒ S are false; thus, 1C is false.
Second, abductive considerations support it.If the discussion topic is what you read this morning, then 'I read the newspaper', 'I read a novella', 'I didn't read the newspaper', 'I read the newspaper and a novella', 'I read the newspaper or a novella (I can't remember which)', and 'I read neither the newspaper nor a novella' are all fully on-topic.In contrast,'I read the newspaper and I ate eggs for breakfast' is clearly partly off-topic, in light of 'I ate eggs for breakfast' clearly being entirely off-topic.The examples can be multiplied indefinitely.Transparency best explains the copious data, by positing appropriate relationships between the subject-matter of the foregoing sentences: if negation preserves subject matter, and conjunction and disjunction merely combine subject matter, then being on-topic or off-topic is (at least partly) preserved by applying the connectives (assuming, of course, that being on-or off-topic is, predominantly, a function of subject matter).
Third, alleged counter-examples to Transparency tend to wither under scrutiny.Consider four instructive candidates.
Candidate 1.A challenge to Conjunctive Transparency: Take 'The people of Greece want to call their country Macedonia' and 'The people of Macedonia want to call their country Macedonia'.Neither is about conflict on its own, but their conjunction may well be.The conjunctive combination may alter the class of topics concerned.(Demolombe & Jones, 1995, p. 55) Reply.We grant that (26) below is typically relevant when the discourse topic is conflict, despite neither conjunct being obviously relevant if uttered in isolation.
(26) The people of Greece want to call their country Macedonia and the people of Macedonia want to call their country Macedonia.
But conjunction is accidental to this.Uttering the sentences in succession has identical conversational effect: (27) The people of Greece want to call their country Macedonia.The people of Macedonia want to call their country Macedonia.
A better explanation will leave Transparency alone and appeal to pragmatics.Taken literally, 'The people of Greece want to call their country Macedonia' isn't about conflict, but is about (something like) what the people of Greece want to call their country-mutatis mutandis for 'The people of Macedonia want to call their country Macedonia'.Per Transparency, (26) merely combines the subject matter of these Nevertheless, they are together indirectly relevant in a conversation about conflict: against the common ground, they have an obvious joint implication that clearly is about conflict: 'The desires of the people of Greece and of Macedonia are in conflict'.That this is so does not entail that the conjunction is itself about conflict (cf.( 20)).
Candidate 2. Claims can be about (perhaps non-actual) states of affairs.'Jane is not in Barcelona' is about Jane not being in Barcelona, while 'Jane is in Barcelona' is not about Jane not being in Barcelona.(Compare the view that ϕ's subject-matter is individuated by the structured Russellian proposition it expresses.)To bolster this, observe that if Ann lies by saying 'Jane is in Barcelona', it is misleading to report 'Ann lied about Jane not being in Barcelona' rather than 'Ann lied about Jane being in Barcelona' (cf.Holton, 2019).Hence, 'Jane is in Barcelona' and 'Jane is not in Barcelona' have different subject-matter, contra Transparency.
Reply.It isn't clear that saying that Jane is not in Barcelona is yet to say anything about Jane not being in Barcelona (as when one says 'Jane not being in Barcelona is unusual').But grant that 'Jane is in Barcelona' is about Jane being in Barcelona and 'Jane is not in Barcelona' is about Jane not being in Barcelona.Grant that it can sometimes be misleading to report 'Ann lied about Jane not being in Barcelona' when Ann lies by saying 'Jane is in Barcelona'.We should not jump to the conclusion that 'Jane is in Barcelona' isn't also about Jane not being in Barcelona.As Holton (2019) notes, subtle pragmatic effects are in play: it is also easy to concoct contexts where one aptly reports 'Ann lied about Jane not being in Barcelona' when Ann lies by saying 'Jane is in Barcelona'.For example, the following sounds natural if the interlocutors know that Jane fled to Madrid and that Ann was questioned by Barcelona's authorities about Jane's whereabouts: (28) Did Ann lie about Jane not being in Barcelona?(29) Yes, she said that Jane is in Barcelona.
Whatever is going on here, it seems implausible that what distinguishes these different contexts is that 'Jane is in Barcelona' varies in subject-matter: its content seems fixed.
Candidate 3. Someone asks 'Who won the 2018 Nobel prize in literature?' without a clue as to the answer.'Patti Smith did' is an obviously relevant and wholly on-topic (whether true or not) initial response.'Patti Smith did not' is obviously irrelevant and wholly off-topic, failing to meaningfully answer the pertinent question under discussion.So, 'Patti Smith did' and 'Patti Smith did not' must speak to different topics.
Reply.Suppose Ann replies to the query: 'Patti Smith won'.Bob retorts: 'No, Patti Smith did not'.Surely Bob can't be accused of saying something off-topic.Indeed, a pragmatic effect can explain the initial infelicity of 'Patti Smith didn't win' in context: plausibly, as an initial reply it is markedly unhelpful insofar as it is uninformativegiven a large pool of potential winners, it contributes little to resolving the query, even if wholly on-topic and true.In contrast, using it to dispute an earlier reply can be markedly helpful.
Candidate 4. Consider: (30) 'Obama is a lawyer and a politician' is about whether Obama is both a lawyer a politician.(31) 'Obama is a lawyer and a politician' is not about whether Obama is a lawyer or a politician.(32) 'Obama is a lawyer or a politician' is about whether Obama is a lawyer or a politician.(33) 'Obama is a lawyer or a politician' is not about whether Obama is both a lawyer and a politician.
It follows that the sentence in ( 30) and ( 31) is about a topic that the sentence in ( 32) and ( 33) is not about, and vice versa.
Reply.Denying (30) or ( 32) is hopeless, but both ( 31) and ( 33) are plausibly denied on reflection.Given that a policy is justified if it is either just or economical, Ann asks: 'Is a basic income grant just or economical?' Bob responds, informatively: 'In my view, a basic income grant is just and economical'.It would be odd for Ann to complain 'OK, but why are you talking about that?' The oddness isn't explained merely by the fact that Bob's response obviously implies the unequivocally on-topic 'A basic income grant is just'.Compare Carla's response: 'A basic income grant is just and e is transcendental'.Ann rightly complains: 'OK, but why are you talking about e?' In contrast, 'A basic income grant is just and economical' seems wholly on-topic: unlike Carla's response, there is no obvious conversational advantage in cutting some content.A simple explanation: ϕ ∧ ψ is (wholly) about whether ϕ ∨ ψ (among other things), so is on-topic when talking about the latter.
Similarly: Bob says 'Let's discuss whether quarantining Jack is cruel and ineffective'.Ann responds, informatively: 'Quarantining Jack is cruel or ineffective, depending on the quarantine's duration'.Bob might rightly complain that this response doesn't completely resolve the question under discussion (i.e., isn't ideally informative), but it would be odd for Bob to complain 'Sure, but don't change the subject!' (Compare Carla's objectionably irrelevant but very informative response: 'Jack is a dentist'.)Explanation: ϕ ∨ ψ is about whether ϕ ∧ ψ (among other things), so is on-topic in a conversation about the latter.

Conclusion
We have cast doubt on the efficacy of arguments against T ⇒ S from topic-divergent necessities and Yablo's thesis.But the argument from topic-divergent logical equivalents is, we think, hard to resist.More generally: Transparency is a key theoretical posit in the present debate.Arguments based in Transparency can be deployed against both T ⇒ S and S ⇒ T, presenting a unified case against 1C.
One may still wonder: what should a formal 2C semantics look like?In Appendix A, we provide a template for studying 2C formal systems, with some applications.

A.2. A template
Instead, we build a template for a simple formal 2C semantics that, design, can incorporate both truth-conditional facts and Transparency.
We work with the propositional language built from atomic sentences p 0 , p 1 , . . .with the Boolean connectives ¬, ∧, ∨.We write L for the set of sentences.We now use ϕ, ψ, χ as variables for sentences in L and p, q, r , . . .as variables for atomic sentences.As discussed in Sect.2, a semantics should assign meaning to the sentences of L, which we then can use to reason about statements of the form ϕ ≡ ψ, saying that the content of ϕ is equivalent to that of ψ, to the extent that ϕ and ψ have identical truth conditions and subject matter.Concretely, we want to say when such statements are true in a model of the semantics, or when they are valid (true in all relevant models).
A model (or abstract model) M is a tuple (S, T , I , J ) where -S is a set whose elements are called states.
-T is a set whose elements are called topics.
-I : L → P(S) is a function, called truth assignment, which maps each sentence ϕ to a set of states I (ϕ) ⊆ S.Here s ∈ I (ϕ) means that ϕ is true at state s.-J : L → P(T ) is a function, called topic assignment, which maps each sentence ϕ to a set of topics J (ϕ) ⊆ T .Here t ∈ J (ϕ) means that ϕ is about topic t.
Given M, we write ϕ M for I (ϕ) and ϕ M for J (ϕ); we omit the subscript 'M' if clear from context.We say that ϕ ≡ ψ is true in M (short ϕ ≡ M ψ) if ϕ = ψ and ψ = ϕ .
We have defined our language and models in a deliberately abstract way.This leaves two paths for adding structure and specifying more refined theories.On the one hand, one could elaborate the language (e.g., to include first-order linguistic devices) or the models (e.g., to enhance the space of topics with a specific structure, such as the partition structure of Lewis (1988a), deployed by Plebani and Spolaore (2021), among others).On the other hand, one could constrain the class of models.We briefly illustrate the second technique.

Instances of the template
The states in our abstract models can act like open impossible worlds: truth can be assigned to sentences without constraint.For example, there are abstract models where s ∈ p ∩ ¬p , or where s / ∈ p ∪ ¬p .To avoid this, one can impose constraints familiar from the preceding discussion.Finally, define J c (ϕ) to be the set of atomic sentences occurring in ϕ.
The canonical classical 2C model helps to characterize content-equivalence.
Proposition 1 For any two sentences ϕ and ψ, the following are equivalent.
(1) ϕ and ψ have the same content in all classical 2C models; i.e., for all classical 2C models M, ϕ ≡ M ψ.
(3) ϕ and ψ are classically equivalent and have the same atomic sentences.
In previous work, one of us-LH-(Hornischer, 2020) has shown that the above notion of content-equivalence is exactly axiomatized by the following calculus: take the calculus AC of Fine (2016a) and add (using our notation) the axiom ϕ ≡ ϕ ∨ ( p ∧ ¬ p) for all atomic p occurring in ϕ. 10 Then ϕ ≡ ψ is derivable in this calculus if and only if ϕ and ψ are synonymous according to our above classical 2C semantics.
One need not concentrate on the classical setting.One could replace (36) with a weaker constraint, making room for incomplete states, at which a sentence ϕ is neither true nor false: 10 AC consists of: the axioms stating double negation elimination; idempotence, commutativity, and associativity for ∧ and ∨; DeMorgan laws; distributivity; and the rules

(
17) ϕ ∧ ψ is true at c iff ϕ and ψ are true at c. (18) ϕ ∧ ψ is false at c iff either ϕ is false at c or ψ is false at c.

( 19 )
If ϕ and ψ agree in their truth value assignment-true, false (or neither, or both, to accommodate various non-classical views)-at every logically possible circumstance, then ϕ and ψ have identical truth-conditions.