Expressivity results for deontic logics of collective agency

We use a deontic logic of collective agency to study reducibility questions about collective agency and collective obligations. The logic that is at the basis of our study is a multi-modal logic in the tradition of stit (‘sees to it that’) logics of agency. Our full formal language has constants for collective and individual deontic admissibility, modalities for collective and individual agency, and modalities for collective and individual obligations. We classify its twenty-seven sublanguages in terms of their expressive power. This classification enables us to investigate reducibility relations between collective deontic admissibility, collective agency, and collective obligations, on the one hand, and individual deontic admissibility, individual agency, and individual obligations, on the other.


Introduction
In the philosophy of the social sciences, individualism is the methodological precept that any social phenomenon is ultimately to be explained in terms of the actions and interactions of individuals. One of the central questions in the debate on individualism is whether statements about collectives can be reduced to statements about individuals. Does it hold that for every statement about collectives there is a logically equivalent statement about individuals? In this paper, we use techniques from modal logic to find answers to specific reducibility questions, including: Does it hold that for every statement about collective agency there is a logically equivalent statement about individual agency? Does it hold that for every statement about collective obligations there is a logically equivalent statement about collective agency and individual obligations?
By way of a formal study of expressivity relations, we aim to assess which sorts of reductionism about collective agency and collective obligations are tenable. Accordingly, we rephrase the reducibility questions as questions of expressivity: Can statements from a specific language that includes specific statements about collectives be expressed with statements from another language? We follow standard practice in modal logic and develop new notions of bisimulation to determine the answers to these questions of expressivity. Doing so enables us to answer our reducibility questions with logical precision.
To answer our expressivity questions, we use a deontic logic of collective agency. This multi-modal logic is a simplified and generalized version of Horty's (1996Horty's ( , 2001 deontic logic of agency. 1 Alongside the usual sentential connectives and the universal modality, our full formal language has constants for collective and individual deontic admissibility, modalities for collective and individual agency, and modalities for collective and individual obligations. 2 Truth-conditions for the formulas of the full formal language are specified in terms of deontic game models (Tamminga and Hindriks 2020 § 3.2). There are twenty-seven sublanguages of the full language, depending on (a) whether constants for collective and/or individual deontic admissibility are excluded, (b) whether modalities for collective and/or individual agency are excluded, and (c) whether modalities for collective and/or individual obligations are excluded. Because each of these three items gives rise to three possibilities, there are exactly twentyseven sublanguages. The main technical contribution of this paper consists in charting this new territory and ordering these twenty-seven sublanguages in terms of their expressive power.
Our paper is organized as follows. In Sect. 2, we first define the full language and give truth-conditions for its formulas in terms of deontic game models. The twentyseven sublanguages are then defined. Next, we define the concept of expressivity and give three criteria on expressivity that help to classify the twenty-seven sublanguages in terms of their expressive power (Sect. 3). We chart the sublanguages that are equally expressive in Sect. 4 and then give the full picture of the expressivity relations in Sect. 5. Subsequently, we introduce a class of bisimulation relations between pointed deontic game models and prove a Hennessy-Milner theorem for each of the twenty-seven sublanguages (Sect. 6). In the following three sections, we prove that the full picture of expressivity relations is accurate. We briefly discuss two assumptions on our models and languages in Sect. 10. A short summary and some philosophical considerations conclude the paper.

Languages and semantics
Let P be a fixed countable set of atomic propositions and let N be a fixed finite set of individual agents that contains at least three elements. (We return to this assumption in Sect. 10.) We use p and q as variables for atomic propositions, i, j, and k as variables for individual agents, and F and G as variables for non-empty sets of individual agents. We use −G to refer to the complement N −G. The full language L G , [G],(G) of our deontic logic of collective agency contains (i) deontic admissibility constants of the form "Group G of agents performs a deontically admissible group action" (formalized as G ) and "Agent i performs a deontically admissible individual action" (formalized as i ). Moreover, it contains (ii) necessity statements of the form "It is settled true that φ" (formalized as φ), (iii) agentive statements of the form "Group G of agents sees to it that φ" (formalized as [G]φ) and "Agent i sees to it that φ" (formalized as [i]φ), and (iv) deontic statements of the form "Group G of agents ought to see to it that φ" (formalized as (G)φ) and "Agent i ought to see to it that φ" (formalized as (i)φ). Its Backus-Naur form is the following: where p ranges over P and G ranges over non-empty subsets of N .
The operators →, ↔, ♦, and G abbreviate the usual constructions. We leave out brackets and braces if the omission does not give rise to ambiguities. Accordingly, the formulas i , [i]φ, and (i)φ are shorthand for the formulas {i} , [{i}]φ, and ({i})φ, respectively.

Deontic game models
Truth-conditions for the formulas of L G , [G], (G) are specified in terms of deontic game models. A deontic game model is a one-shot game in which each individual agent i is assigned a non-empty and finite set A i of available individual actions. The set A G of group actions that are available to a non-empty set G of individual agents is given by A G = × i∈G A i . The set A of action profiles equals the set A N of group actions that are available to the grand coalition N of all individual agents and is given by The set of action profiles plays the role of the set of worlds in possible-worlds models for standard deontic logic. A deontic ideality function d assigns to each action profile a in A a value d(a) that is either 0 or 1. A valuation function assigns to each atomic proposition p in P a set v( p) of action profiles where p is true. 3 Formally, Definition 1 (Deontic Game Model) A deontic game model M is a quadruple N , (A i ), d, v such that for each agent i in N it holds that A i is a non-empty and finite set of actions available to agent i, d : A → {0, 1} is a deontic ideality function such that there is at least one a in A with d(a) = 1, and v : P → ℘ (A) is a valuation function.
To specify truth-conditions for deontic admissibility constants and for deontic statements, we order the group actions that are available to any (possibly singleton) set G of individual agents by way of a dominance relation: A group action that is available to any (possibly singleton) set G of individual agents is deontically admissible if and only if it is not strongly dominated by any of G's available group actions. Accordingly, be a non-empty set of individual agents. Then the set of G's deontically admissible actions in M, denoted by Adm M (G), is given by We can now specify the truth-conditions for the formulas of the full language L G , [G], (G) . (Note that by setting G = {i} we obtain the truth-conditions for the individualistic formulas i , [i]φ, and (i)φ.) Definition 4 (Truth-Conditions) Let M = N , (A i ), d, v be a deontic game model. Let G ⊆ N be a non-empty set of individual agents. Let a ∈ A be an action profile. Let p ∈ P be an atomic formula and let φ, ψ ∈ L G ,[G],(G) be arbitrary formulas. Then Given a deontic game model M, we write M | φ if for all action profiles a in A it holds that (M, a) | φ. A formula φ is valid (notation: | φ) if for all deontic game models M it holds that M | φ.

Twenty-seven sublanguages
The full language L G , [G],(G) of the deontic logic of collective agency contains constants for collective and individual deontic admissibility, modalities for collective and individual agency, and modalities for collective and individual obligations. Our basic language is the standard modal language L built from the set P of atomic propositions, using negation (¬), conjunction (∧), and the universal modality ( ). (We return to the assumption of including the universal modality in Sect. 10.) The sublanguages of our full language are obtained from the basic language L by adding (a) either collective deontic admissibility constants, individual deontic admissibility constants, or no deontic admissibility constants; (b) collective agency modalities, individual agency modalities, or no agency modalities; and/or (c) collective obligation modalities, individual obligation modalities, or no obligation modalities. This gives us twenty-seven languages, ranging from L to L G , [G], (G) . Their names are systematized as follows: where represents the omission of the relevant constant or modality. Their Backus-Naur forms are read off from their names. For instance, if x = i , y = [G], and z = , we obtain the language L i , [G] . Its Backus-Naur form is where p ranges over P, i ranges over N , and G ranges over non-empty subsets of N .
We use L to refer to the set that consists of exactly all of our twenty-seven sublanguages. Truth-conditions for the formulas of any L * ∈ L are specified by Definition 4. We now order the twenty-seven languages in L in terms of their expressive power. 4

Expressivity
Let us first recall the concept of expressive power, as standardly used in modal logic. We say that a formula ψ from language L * * can be expressed in language L * if and only if there is a φ in L * such that φ and ψ are logically equivalent. If every formula from the language L * * can be expressed in the language L * , we say that L * is at least as expressive as L * * . Formally, Definition 5 Let L * , L * * ∈ L. Then L * is at least as expressive as L * * (notation: L * L * * ) if and only if for every ψ in L * * there is a φ in L * such that | ψ ↔ φ.
As usual, L * ≡ L * * abbreviates the conjunction of L * L * * and L * * L * . Moreover, L * L * * abbreviates the conjunction of L * L * * and L * * L * . Note that L * * L * 4 Other metalogical investigations of these languages are scarce. Xu (1998), Wansing (2006), and Balbiani et al. (2008) prove completeness for L [i] , and Murakami (2005) proves completeness for L [i],(i) . Kooi and Tamminga (2008) characterize the possibility of moral conflicts in L [G],(G) . Balbiani et al. (2008) and Herzig and Schwarzentruber (2008) study the complexity of L [i] , and the latter study also the complexity of L [G] . Duijf et al. (ms.) define a new and stronger concept of inexpressivity based on nomological equivalence and prove that there are no statements φ and ψ in L i , [i] such that φ and G are equivalent modulo ψ (where ψ specifies a set of individualistic background laws). if and only if there is a φ in L * such that for every ψ in L * * it holds that | ψ ↔ φ. Accordingly, there is no formula in L * * that is logically equivalent to φ.
To chart the expressivity landscape of our twenty-seven languages, we introduce three criteria of expressive power. The first two criteria are straightforward. First, consider the obvious inclusion criterion for L * L * * : Secondly, consider the transitivity criterion for L * L * * . It follows from the transitivity of : Lemma 2 (Transitivity Criterion) Let L * , L * * , L * * * , L * * * * ∈ L. Then If L * * * L * * * * and L * * * L * and L * * L * * * * , then L * L * * .
The third criterion is a criterion for L * L * * that is defined in terms of pointed deontic game models. The criterion applies if two pointed deontic game models validate exactly the same formulas from L * but give different truth-values to a formula from L * * . Any ordered pair (M, a) that consists of a deontic game model M and one of its action profiles a is a pointed deontic game model. Two pointed deontic game models are equivalent on L * if and only if they validate exactly the same formulas from L * : We can now formulate the equivalence criterion for L * L * * : The inclusion criterion, the transitivity criterion, and the equivalence criterion help to classify the twenty-seven sublanguages of L G , [G], (G) in terms of their expressive power. We start with the sublanguages that have precisely the same expressive power.

Equally expressive sublanguages
Any obligation modality can be given an Andersonian-Kangerian definition in terms of the universal modality and the relevant deontic admissibility constant: The Andersonian-Kangerian definitions of obligation modalities are central to the proofs that some of the sublanguages of L G , [G],(G) are equally expressive.
. Because all of them are also elements of L G ,y,z , there is a φ ∈ L G ,y,z such that | ψ ↔ φ.
Theorem 1 Each of the following holds: Proof (  Because our focus is on charting the expressivity relations between our twentyseven sublanguages, we refer to any class of equally expressive languages by the language in that class with the shortest name. Hence, we use the six languages in the first column in Theorem 1 to refer to the six classes of equally expressive languages that were identified in this theorem. Accordingly, L G , [G] refers to the class of the languages in L that are equally expressive as the full language L G ,[G],(G) .

The full picture of the expressivity relations
The eighteen sublanguages that remain to be classified are the six languages of the first column of Theorem 1 and the sublanguages in L that were not mentioned in this theorem. No two of these eighteen sublanguages are equally expressive. If we represent L * L * * by an arrow from L * to L * * , the expressivity relations between the eighteen languages can be pictured as in Fig. 1.
Accordingly, L G , [G] is the most expressive language in L and L is the least expressive language in L. To prove that this picture adequately represents the expressivity relations among the eighteen sublanguages, we think of the picture as a three-dimensional prism and decompose it in the left front face (Fig. 2), the right front face (Fig. 9), and the horizontals (Fig. 10).

Bisimulations and Hennessy-Milner theorems
To prove that some sublanguage L * is not at least as expressive as another sublanguage L * * , we apply the equivalence criterion to specific pairs of pointed deontic game models. The equivalence criterion can only be applied if the pointed deontic game models in the pair are L * -equivalent. To prove that they are L * -equivalent, we develop a suitable concept of L * -bisimulation and show that the two languages are L * -bisimilar. All of this is standard practice in modal logic. 5 An L * -bisimulation between two pointed deontic game models (M, a) and (M , a ) is a relation R ⊆ A × A linking the models' action profiles that satisfies a specific set of structural conditions associated with the logical operators in L * . For every language L * in L we present such a set of structural conditions on R that characterizes L * -equivalence. Accordingly, for every language L * in L we show that two given pointed deontic game models are L * -bisimilar if and only if they are L * -equivalent. Such theorems are known as Hennessy-Milner theorems. We prove a general claim that summarizes the Hennessy-Milner theorems for all sublanguages in L (Theorem 2). To establish this general claim, we use a technique from Van Benthem et al. (2017, § 3) and first prove a general lemma on sublanguages in L. (Note that this technique is also called upon in our proof of the general claim itself.)  (M , c ). Therefore, because c ∈ A was arbitrary, for every c ∈ A there is a c ∈ A such that (M, c) ≡ L * (M , c ).
We now present a list of nine structural conditions on relations R that link the action profiles of two given deontic game models. Each of the twenty-seven languages in L is assigned a specific subset of these nine structural conditions. Because all of these subsets include at least three basic structural conditions, we set these three conditions apart. The relations that satisfy them are basic bisimulations: , v be deontic game models. A relation R ⊆ A× A is a basic bisimulation between M and M if R satisfies each of the following clauses: The other six structural conditions on relations R are specified as follows: be a relation between M and M . The six optional structural conditions on R are the following: Each of the twenty-seven sublanguages in L is assigned a specific subset of these six structural conditions in the following way (C is the empty condition that is satisfied trivially): y,z -bisimulation between M and M if R is a basic bisimulation that satisfies conditions C x , C y , and C z .
Consequently, an L-bisimulation is just a basic bisimulation, and an L i ,[G]bisimulation is a basic bisimulation that also satisfies conditions C i and C [G] . We write (M, a) L x,y,z (M , a ) if there is an L x,y,z -bisimulation R between M and M such that (a, a ) ∈ R.
We can now establish our general claim: Proof Although the general claim is in fact a conjunction of claims on twenty-seven individual cases, the proofs of all these claims are very similar. Because the left-to-right direction is always proved by a straightforward structural induction on φ, we omit it here. As for the right-to-left direction, we will only give a full proof for the case where

[G],(G) -bisimulation between
M and M . We first show that R is a basic bisimulation. Clause (i) of Definition 7 follows from the definition of R. Clauses (ii) and (iii) of Definition 7 follow from Lemma 6. Hence, R is a basic bisimulation. Next, we show that R satisfies conditions C G , C [G] , and C (G) .  The proofs of the other twenty-six cases are simple variations of the above proof. Consider the language L x,y,z . If x = i , y = [i], or z = (i), then replace each occurrence of G in the corresponding part of the above proof with i. If x = , y = , or z = , then leave out the corresponding part of the above proof.

The left front face
To chart the expressivity relations among the twelve sublanguages of the left front face of the full expressivity picture (Fig. 2), it suffices to prove five theorems. Using these five theorems, the inclusion criterion, the transitivity criterion and Lemma 5(i), we can easily find the expressivity relations between every pair from the twelve sublanguages of Fig. 2. The labels of the arrows in Fig. 2 indicate the theorem that can be used to establish the corresponding expressivity relation. The five theorems are the following: .
Proof Because N contains at least three elements, there are i, j, k ∈ N such that i = j and j = k and i = k. We define two pointed deontic game models that are L G ,[i] -bisimilar (and hence validate exactly the same L G ,[i] -formulas) but give different truth-values to the a −{i, j,k} )} and let v(q) = ∅ for all q ∈ P −{ p}. Model M 1 can be pictured as in Fig. 3 (the group action a −{i, j,k} is not represented). Let Model M 1 can be pictured as in Fig. 4 (the group action a −{i, j,k} is not represented).
Because for all non-empty G ⊆ N it holds that M 1 | G and M 1 | G , the relation R satisfies bisimulation condition C G . For every i ∈ N and every c ∈ A there are ∈ v( p). From these observations, it follows that R satisfies bisimulation condition C [i] . Therefore, R is an L G ,[i] -bisimulation between M 1 and M 1 . Hence, (M 1 , (a i , a j , a k , a −{i, j,k} )) L G , [i] (M 1 , (a i , a j , a k , a −{i, j,k} )). By Theorem 2, we obtain (M 1 , (a i , a j , a k , a −{i, j,k} )) ≡ L G , [i] (M 1 , (a i , a j , a k , a −{i, j,k} )).
However, note that it holds that (M 1 , (a i , a j , a k , a −{i, j,k} )) | [i, k] p and also that (M 1 , (a i , a j , a k , a −{i, j,k} ) Proof Because N contains at least two elements, there are i, j ∈ N such that i = j. We define two pointed deontic game models that are L G -bisimilar (and hence validate exactly the same L G -formulas) but give different truth-values to the Model M 2 can be pictured as in Fig. 5 can be pictured as in Fig. 5 (right; the group action a −{i, j} is not represented). Let It is easy to check that R is an L G -bisimulation between M 2 and M 2 . Hence, (M 2 , (a i , a j , a −{i, j} )) L G (M 2 , (a i , a j , a −{i, j} )). By Theorem 2, it must be that (M 2 , (a i , a j , a −{i, j} )) ≡ L G (M 2 , (a i , a j , a −{i, j} )). However, observe that (M 2 , (a i , a j , a −{i, j} )) | [i] p and (M 2 , (a i , a j , a −{i, j} )) | [i] p. By Lemma 3, it must be that L G L [i] .
Proof Because N contains at least two elements, there are i, j ∈ N such that i = j. We define two pointed deontic game models that are L i , [G],(G) -bisimilar (and hence validate exactly the same L i , [G],(G) -formulas) but give different truth-values to the d(a i , a j , a −{i, j} ) = 1. Lastly, let v( p) = ∅ for all p ∈ P. Model M 3 can be pictured as in Fig. 6 (left; the group action a −{i, j} is not represented).
Let d (a i , b j , a −{i, j} ) = d (b i , a j , a −{i, j} ) = 1 and d (a i , a j , a − Lastly, let v( p) = ∅ for all p ∈ P. Model M 3 can be pictured as in Fig. 6 (right; the group action a −{i, j} is not represented).
It is easy to check that R is an L i , [G],(G) -bisimulation between M 3 and M 3 . Hence, (M 3 , (a i , a j , a −{i, j} )) (a i , a j , a −{i, j} )). By Theorem 2, it must be that (M 3 , (a i , a j , a −{i, j} ) (G) (M 3 , (a i , a j , a −{i, j} )).
Proof Because N contains at least two elements, there are i, j ∈ N such that i = j. We define two pointed deontic game models that are L i ,[G] -bisimilar (and hence validate exactly the same Let Model M 4 can be pictured as in Fig. 7 (right; the group action a −{i, j} is not represented).
It is easy to check that R is an L i , [G] -bisimulation between M 4 and M 4 . Hence, (M 4 , (a i , a j , a −{i, j} )) L i , [G] (M 4 , (a i , a j , a −{i, j} )). By Theorem 2, it must be that (M 4 , (a i , a j , a −{i, j} )) ≡ L i , [G] (M 4 , (a i , a j , a −{i, j} )). However, observe that (M 4 , (a i , a j , a −{i, j} )) | (i, j) p and (M 4 , (a i , a j , a −{i, j} ) Proof Because N contains at least two elements, there are i, j ∈ N such that i = j. We define two pointed deontic game models that are L [G] -bisimilar (and hence validate exactly the same L [G] -formulas) but give different truth-values to the L i -formula i .
Model M 5 can be pictured as in Fig. 8 (left; the group action a −{i, j} is not represented).
Let Let

The right front face
To chart the expressivity relations among the nine sublanguages of the right front face of the full expressivity picture (Fig. 9), it suffices to prove four theorems. Using these four theorems, the inclusion criterion, and the transitivity criterion, we can easily find the expressivity relations between every pair from the nine sublanguages in Fig. 9. The labels of the arrows in Fig. 9 indicate which theorem must be used to establish the corresponding expressivity relation. The four theorems are the following: It is easy to check that R is an L [G],(i) -bisimulation between M 4 and M 4 . Hence, (M 4 , (a i , a j , a −{i, j} )) L [G],(i) (M 4 , (a i , a j , a −{i, j} )). By Theorem 2, it must be that (M 4 , (a i , a j , a −{i, j} )

The horizontals
To chart the six horizontal expressivity relations among the twelve sublanguages of Fig. 10, it suffices to prove one theorem. Using this theorem, the inclusion criterion, the transitivity criterion and Lemma 5(iv), we can easily prove the six horizontal expressivity relations. The theorem we need is the following: Let Model M 6 can be pictured as in Fig. 11 (right; the group action a −{i, j} is not represented).
Let R = A × A . It is easy to check that R is an L (G), [G] -bisimulation between M 6 and M 6 . Hence, (M 6 , (a i , a j , a −{i, j} )) L (G), [G] (M 6 , (b i , b j , a −{i, j} )). By Theorem 2, it must be that (M 6 , (a i , a j , a −{i, j} )

Weaker assumptions on models and languages
Before concluding the paper, we briefly discuss two assumptions on our models and languages: (a) the assumption that N is a fixed finite set of individual agents that contains at least three elements, and (b) the assumption that each sublanguage in L includes the universal modality. How would the expressivity relations be affected if we were to weaken these assumptions? (Because these assumptions are not central to the philosophical debate on reductionism in the social sciences, the following considerations are largely technical in nature.) Throughout the paper, we assumed that N is a fixed finite set of individual agents that contains at least three elements. Note that only Theorems 3 and 8 rely on the assumption that N contains at least three agents. There are two cases to consider: (i) If N were to contain exactly one agent, then the full language would not contain statements about (non-singleton) groups. Consequently, we would need to consider only eight sublanguages. The expressivity relations for these eight languages are given by the subfigure of Fig. 1 that contains only those languages in L that exclude collective admissibility constants, modalities for collective agency, and modalities for collective obligations. (ii) If N were to contain exactly two agents, then the only statements about (nonsingleton) groups would be of the form N , [N ]φ, and (N )φ. Note that our models validate [N ]φ ↔ φ. Consequently (and unlike the case where N contains at least three agents), for every language L * in L it holds that L * is equally expressive as the language L * * that is obtained from L * by adding modalities for collective agency.
Hence, under these circumstances, modalities for collective agency could be added without an increase of expressive power. Our results concerning the sublanguages that exclude modalities for collective agency rely only on the assumption that N contains at least two agents, and hence the expressivity relations among these sublanguages are given by Fig. 1.
Finally, each sublanguage in L includes the universal modality. What can we say about the expressivity relations between languages that exclude the universal modality? Note that because N contains at least two distinct individual agents i and j, our models validate φ ↔ [i][ j]φ. Accordingly, in each language in L that has modalities for individual agency, the universal modality is definable in terms of modalities for individual agency. (Note that for every language L * in L it holds that if L * has modalities for collective agency, then L * has also modalities for individual agency.) Hence, in each language in L that has modalities for individual agency, the universal modality could be left out without losing expressive power. This does not hold true for those languages in L that lack modalities for individual agency. These languages lose expressive power if the universal modality is left out. As a consequence, some expressivity relations no longer obtain: in languages in L without modalities for individual agency and without the universal modality, modalities for obligations cannot be defined in terms of the universal modality and the relevant deontic admissibility constant.

Conclusion
We classified the twenty-seven sublanguages in L in terms of their expressive power. To achieve this classification, we first proved twenty-seven Hennessy-Milner theorems: for every language L * in L it holds that two pointed deontic game models are equivalent on L * if and only if there is a bisimulation relation between the two pointed models that satisfies a set of structural conditions that are specific to L * . The Hennessy-Milner theorems are central to our proofs that a given sublanguage is strictly more expressive than another.
The expressivity landscape we charted in this paper strongly suggests that the answers to the two philosophical questions in the introduction are negative. Because Have we refuted reductionism about collective agency and collective obligations? No, we have not. Our main philosophical contribution to the debate on reductionism about collective agency and collective obligations is methodological: our study indicates that logical methods can be used to find precise answers to the questions we raised in the introduction. To vindicate reductionism, the philosophical interpretation of our logical results must be contested. This can be done in various ways. For instance, the modelling considerations that lie at the basis of our semantics might be criticized. The reductionist might specify alternative models and/or truth-conditions for statements about collective and individual deontic admissibility, statements about collective and individual agency, and statements about collective and individual obligations. Then, she might prove that her alternative modelling supports reductionism about collective agency and collective obligations. Our methodological contribution therefore highlights the fruitfulness of logical methods for the study of reductionism in the philosophy of the social sciences. by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.