Still, some may still want to say it. If so, my replies may gain nothing better than a stalemate against such persistence, though I can hope that earlier revelations will discourage others from persisting. But two replies are possible. Both come down, one circuitously, to an issue with us from the beginning: whether the language of the right side of (10) is suspect. For if (10) is to support instances for (6) which are about objects, that clause must itself be (...) about objects. (These would be ones assigned by variants of I it mentions to constants it mentions.) Yet Barwise and I would call it implicitly about functions. Ironically, the discussion surrounding (10), hoping to settle that issue, could only do so if the issue were already settled, revealing decisively the ontology of (10). If irritating, this is also inevitable, given the Tarskian spirit of the ensivioned semantics for QLB.A second reply begins by noting that a QLB semantics which implies (10) cannot simply be assumed. Even a QL semantics augmented to imply (11) is not trivial to frame, as I will let readers confirm. On the QLB project, Barwise comments thus:It is not possible to explain the meaning of an essential use of branching quantification ... inductively, by treating one quantifier at a time in a first-order fashion. Some use of higher-type abstract objects is essential. (BQE75)But believers in a modest ontology for QLB can claim a non sequitur here. For (10), as they read it, succeeds without mentioning abstract objects, though not in the “one quantifier at a time” way which Barwise rightly finds impossible. This is not yet to say the same about a QLB semantics implying (10). But that too can be said, as it happens, with as good a conscience as with (10). A suitable treatment can begin by somehow linearizing non QL sentences like (6). Still assuming prefixes whose rows each consist, speaking loosely, of n universal quantifiers followed by a single existential, we could simply line up these rows in any order, with unique deconcatenatability being assured. From then on, it gets both tedious and complex. A full syntax is essential, and some surprising categories arose in mine. I will spare readers all details, except to say that one can indeed “treat one quantifier at a time”, if not “in first-order fashion”: schematic rules for treating n quantifiers at once can be eschewed. Unsurprisingly, heavy use is made of the “depending only on” idiom seen in (10). Nor does it surprise me that this semantics can succeed, with that idiom available. Roughly, if open talk about functions works in a semantics for QLF, what I read as implicit talk about them should work in a semantics for QLB See [6] for a start on a semantics aspiring to handle sentences like (6) without invoking abstract objects. See also my comments on its notion of dependence, in [9]. . So even from a bare sketch, we can see that this new semantics settles nothing. It just leads back to the stalemate. Barwise and I will read crucial clauses as talking implicitly about functions, but this general charge against an idiom is equally deniable wherever the idiom occurs: in a reading for (6), say, or in the metalanguage can hardly repress a motherhood slogan: better dead than obscurely read. But that just denies the denial, unhelpfully. A better comment is the reminder that the claim stays alive only in a form which no one has ever imagined for it. The QLB quantifiers that cannot be shown not to range over objects are not the items anyone would ever have pointed to in illustrating the unkillable claim. (shrink)

Following Henkin's discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or "cardinality" quantifiers, e.g., "most", "few", "finitely many", "exactly α", where α is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, Henkin (...) definition first to a general definition of monotone-increasing (M↑) POQ and then to a general definition of generalized POQ, regardless of monotonicity. The extension is based on (i) Barwise's 1979 analysis of the basic case of M↑ POQ and (ii) my 1990 analysis of the basic case of generalized POQ. POQ is a non-compositional Ist-order structure, hence the problem of extending the definition of the basic case to a general definition is not trivial. The paper concludes with a sample of applications to natural and mathematical languages. (shrink)

Following Henkin’s discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or “cardinality” quantifiers, e.g., “most”, “few”, “finitely many”, “exactly α ”, where α is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, (...) Henkin definition first to a general definition of monotone-increasing (M↑) POQ and then to a general definition of generalized POQ, regardless of monotonicity. The extension is based on (i) Barwise’s 1979 analysis of the basic case of M↑ POQ and (ii) my 1990 analysis of the basic case of generalized POQ. POQ is a non-compositional 1st-order structure, hence the problem of extending the definition of the basic case to a general definition is not trivial. The paper concludes with a sample of applications to natural and mathematical languages. (shrink)

In the dissertation we study the complexity of generalized quantifiers in natural language. Our perspective is interdisciplinary: we combine philosophical insights with theoretical computer science, experimental cognitive science and linguistic theories. -/- In Chapter 1 we argue for identifying a part of meaning, the so-called referential meaning (model-checking), with algorithms. Moreover, we discuss the influence of computational complexity theory on cognitive tasks. We give some arguments to treat as cognitively tractable only those problems which can be computed in polynomial (...) time. Additionally, we suggest that plausible semantic theories of the everyday fragment of natural language can be formulated in the existential fragment of second-order logic. -/- In Chapter 2 we give an overview of the basic notions of generalized quantifier theory, computability theory, and descriptive complexity theory. -/- In Chapter 3 we prove that PTIME quantifiers are closed under iteration, cumulation and resumption. Next, we discuss the NP-completeness of branching quantifiers. Finally, we show that some Ramsey quantifiers define NP-complete classes of finite models while others stay in PTIME. We also give a sufficient condition for a Ramsey quantifier to be computable in polynomial time. -/- In Chapter 4 we investigate the computational complexity of polyadic lifts expressing various readings of reciprocal sentences with quantified antecedents. We show a dichotomy between these readings: the strong reciprocal reading can create NP-complete constructions, while the weak and the intermediate reciprocal readings do not. Additionally, we argue that this difference should be acknowledged in the Strong Meaning hypothesis. -/- In Chapter 5 we study the definability and complexity of the type-shifting approach to collective quantification in natural language. We show that under reasonable complexity assumptions it is not general enough to cover the semantics of all collective quantifiers in natural language. The type-shifting approach cannot lead outside second-order logic and arguably some collective quantifiers are not expressible in second-order logic. As a result, we argue that algebraic (many-sorted) formalisms dealing with collectivity are more plausible than the type-shifting approach. Moreover, we suggest that some collective quantifiers might not be realized in everyday language due to their high computational complexity. Additionally, we introduce the so-called second-order generalized quantifiers to the study of collective semantics. -/- In Chapter 6 we study the statement known as Hintikka's thesis: that the semantics of sentences like ``Most boys and most girls hate each other'' is not expressible by linear formulae and one needs to use branching quantification. We discuss possible readings of such sentences and come to the conclusion that they are expressible by linear formulae, as opposed to what Hintikka states. Next, we propose empirical evidence confirming our theoretical predictions that these sentences are sometimes interpreted by people as having the conjunctional reading. -/- In Chapter 7 we discuss a computational semantics for monadic quantifiers in natural language. We recall that it can be expressed in terms of finite-state and push-down automata. Then we present and criticize the neurological research building on this model. The discussion leads to a new experimental set-up which provides empirical evidence confirming the complexity predictions of the computational model. We show that the differences in reaction time needed for comprehension of sentences with monadic quantifiers are consistent with the complexity differences predicted by the model. -/- In Chapter 8 we discuss some general open questions and possible directions for future research, e.g., using different measures of complexity, involving game-theory and so on. -/- In general, our research explores, from different perspectives, the advantages of identifying meaning with algorithms and applying computational complexity analysis to semantic issues. It shows the fruitfulness of such an abstract computational approach for linguistics and cognitive science. (shrink)

Branching quantifiers were first introduced by L. Henkin in his 1959 paper ‘Some Remarks on Infmitely Long Formulas’. By ‘branching quantifiers’ Henkin meant a new, non-linearly structured quantiiier-prefix whose discovery was triggered by the problem of interpreting infinitistic formulas of a certain form} The branching (or partially-ordered) quantifier-prefix is, however, not essentially infinitistic, and the issues it raises have largely been discussed in the literature in the context of finitistic logic, as they will be here. (...) Our discussion transcends, however, the resources of standard lst-order languages and we will consider the new form in the context of 1st-order logic with 1- and 2-place ‘Mostowskian` generalized quantifiers.2.. (shrink)

Next SectionWe discuss the thesis formulated by Hintikka (1973) that certain natural language sentences require non-linear quantification to express their meaning. We investigate sentences with combinations of quantifiers similar to Hintikka's examples and propose a novel alternative reading expressible by linear formulae. This interpretation is based on linguistic and logical observations. We report on our experiments showing that people tend to interpret sentences similar to Hintikka sentence in a way consistent with our interpretation.

This paper extends the investigations into logical properties of the quantified argument calculus (Quarc) by suggesting a series of proper subsystems which, although retaining the entire vocabulary of Quarc, restrict quantification in such a way as to make the result decidable. The proof of decidability is via a procedure that prunes the infinite branches of a derivation tree in what is a syntactic counterpart of semantic filtration. We demonstrate an application of one of these systems by showing that Aristotle’s assertoric (...) syllogistic is embeddable within, thus also providing another method of showing its decidability. (shrink)

In this paper we present BTC, which is a complete logic for branchingtime whose modal operator quantifies over histories and whose temporal operators involve a restricted quantification over histories in a given possible choice. This is a technical novelty, since the operators of the usual logics for branching-time such as CTL express an unrestricted quantification over histories and moments. The value of the apparatus we introduce is connected to those logics of agency that are interpreted on branching-time, as (...) for instance Stit Logics. (shrink)

The paper develops a set of quantified temporal alethic boulesic doxastic systems. Every system in this set consists of five parts: a ‘quantified’ part, a temporal part, a modal (alethic) part, a boulesic part and a doxastic part. There are no systems in the literature that combine all of these branches of logic. Hence, all systems in this paper are new. Every system is defined both semantically and proof-theoretically. The semantic apparatus consists of a kind of$$T \times W$$T×Wmodels, and the (...) proof-theoretical apparatus of semantic tableaux. The ‘quantified part’ of the systems includes relational predicates and the identity symbol. The quantifiers are, in effect, a kind of possibilist quantifiers that vary over every object in the domain. The tableaux rules are classical. The alethic part contains two types of modal operators for absolute and historical necessity and possibility. According to ‘boulesic logic’ (the logic of the will), ‘willing’ (‘consenting’, ‘rejecting’, ‘indifference’ and ‘non-indifference’) is a kind of modal operator. Doxastic logic is the logic of beliefs; it treats ‘believing’ (and ‘conceiving’) as a kind of modal operator. I will explore some possible relationships between these different parts, and investigate some principles that include more than one type of logical expression. I will show that every tableau system in the paper is sound and complete with respect to its semantics. Finally, I consider an example of a valid argument and an example of an invalid sentence. I show how one can use semantic tableaux to establish validity and invalidity and read off countermodels. These examples illustrate the philosophical usefulness of the systems that are introduced in this paper. (shrink)

Some fifteen years ago, research on generalized quantifiers was con sidered to be a branch of mathematical logic, mainly carried out by mathematicians. Since then an increasing number of linguists and philosophers have become interested in exploring the relevance of general quantifiers for natural language as shown by the bibliography compiled for this volume. To a large extent, the new research has been inspired by Jon Barwise and Robin Cooper's path-breaking article "Generalized Quantifiers and Natural Language" from (...) 1981. A concrete sign of this development was the workshop on this topic at Lund University, May 9-11, 1985, which was organized by Robin Cooper, Elisabet Engdahl, and the present editor. All except two of the papers in this volume derive from that workshop. Jon Barwise's paper in the volume is different from the one he presented in connection with the workshop. Mats Rooth's contribution has been added because of its close relationship with the rest of the papers. The articles have been revised for publication here and the authors have commented on each other's contributions in order to integrate the collection. The organizers of the workshop gratefully acknowledge support from the Department of Linguistics, the Department of Philosophy and the Faculty of Humanities at Lund University, the Royal Swedish Academy of Sciences (through the Wallenberg Foundation), the Swedish Institute, and the Letterstedt Foundation. (shrink)

In this paper we develop a novel propositional semantics based on the framework of branching time. The basic idea is to replace the moment-history pairs employed as parameters of truth in the standard Ockhamist semantics by pairs consisting of a moment and a consistent, downward closed set of so-called transitions. Whereas histories represent complete possible courses of events, sets of transitions can represent incomplete parts thereof as well. Each transition captures one of the alternative immediate future possibilities open at (...) a branching point. The transition semantics exploits the structural resources a branching time structure has to offer and provides a fine-grained picture of the interrelation of modality and time. In addition to temporal and modal operators, a so-called stability operator becomes interpretable as a universal quantifier over the possible future extensions of a given transition set. The stability operator allows us to specify how and how far time has to unfold for the truth value of a sentence at a moment to become settled and enables a perspicuous treatment of future contingents. We show that the semantics developed along those lines generalizes and extends extant approaches: both Peirceanism and Ockhamism can be viewed as limiting cases of the transition approach that build on restricted resources only, and on both accounts, stability collapses into truth. (shrink)

Although first-order Kripke semantics has become a well established branch of modal logic, very little - almost nothing - is written about logics with a weaker modal fragment. We try to help the situation by isolating principles determining the interaction between quantifiers and modalities in minimal semantics. First, we let the standard-model properties of monotonic and anti-monotonic domains clue us in on how to do this – i. e. we try to articulate, in terms of the inclusiveness of the (...) domains of a certain set of worlds, a set of semantical restrictions that will validate the Barcan and converse Barcan formulae respectively. As it turns out, this can indeed by done, but only by adding assumptions strong enough to make the models virtually normal. Since the whole point of switching to a minimal framework would be to generalise the logic, we therefore abandon the worlds-objects thinking altogether, and switch to a much simpler and more direct validation strategy in which the propositions we are after are simply picked out as such. (shrink)

We discuss the thesis formulated by Hintikka that certain natural language sentences require non-linear quantification to express their meaning. We investigate sentences with combinations of quantifiers similar to Hintikka's examples and propose a novel alternative reading expressible by linear formulae. This interpretation is based on linguistic and logical observations. We report on our experiments showing that people tend to interpret sentences similar to Hintikka sentence in a way consistent with our interpretation.

This paper outlines a formal account of tensed sentences that is consistent with Ockhamism, a view according to which future contingents are either true or false. The account outlined substantively differs from the attempts that have been made so far to provide a formal apparatus for such a view in terms of some expressly modified version of branching time semantics. The system on which it is based is the simplest quantified modal logic.

The first aim of the paper is to show that under certain conditions generative syntax can be made suitable for Montague semantics, based on his type logic. One of the conditions is to make branching in the so-called X-bar syntax strictly binary, This makes it possible to provide an adequate semantics for Noun Phrases by taking them as referring to sets of collections of sets of entities ( type <ett,t>) rather than to sets of sets of entities (ett).

Several authors proposed to devise logical structures for Natural Language (NL) semantics in which noun phrases yield referential terms rather than standard Generalized Quantifiers. In this view, two main problems arise: the need to refer to the maximal sets of entities involved in the predications and the need to cope with Independent Set (IS) readings, where two or more sets of entities are introduced in parallel. The article illustrates these problems and their consequences, then presents an extension of the (...) proposal made in Sher (J Philos Logic 26:1–43, 1997 ) in order to properly represent the meaning of IS readings involving NL quantifiers. The solution proposed here allows to uniformly deal with both standard linear and IS readings, regardless of their actual existence in NL or quantifiers’ monotonicity. Sentences featuring nested quantifications are particularly problematic. By avoiding parallel nested quantification in the formulae, the proper true values are achieved. (shrink)

We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide an insight into branching operation yielding intractable natural language multi-quantifier expressions. Next, we focus on a linguistic case study. We use computational complexity results (...) to investigate semantic distinctions between quantified reciprocal sentences. We show a computational dichotomy<br>between different readings of reciprocity. Finally, we go more into philosophical speculation on meaning, ambiguity and computational complexity. In particular, we investigate a possibility to<br>revise the Strong Meaning Hypothesis with complexity aspects to better account for meaning shifts in the domain of multi-quantifier sentences. The paper not only contributes to the field of the formal<br>semantics but also illustrates how the tools of computational complexity theory might be successfully used in linguistics and philosophy with an eye towards cognitive science. (shrink)

The dynamics of epiphytic bryophyte communities following natural and human disturbance have rarely been quantified. We describe the response of bryophyte communities on bigleaf maple trees in Olympia, Washington, following their experimental removal. Approximately 8% of the exposed area was recolonized by bryophytes 1 year after clearing, and 27% after 3 years. Lateral encroachment from bryophytes on the sides of the 20-cm-long plots accounted for 75% of this recolonization, with growth from residual plant parts or aerially dispersed diaspores accounting for (...) the remaining 25%. Though it was not possible to distinguish between the latter two sources of cover, the number of clear de novo colonization events over the course of the year was low. Disturbance appeared to reduce bryophyte diversity at this successional stage, as alpha and gamma diversity remained low after 1 year and had not recovered after 3 years. Reflecting the preponderance of lateral encroachment as the mechanism for recolonization, disturbance size may significantly affect the time needed to recolonize disturbed branch substrates. In addition to contributing to ecologists' understanding of processes of succession, these experiments may help to develop sustainable practices for moss-harvesting in the Pacific Northwest.Key words: succession, bryophytes, epiphytes, Acer macrophyllum, recolonization, canopy studies. (shrink)

It is known that various complexity-theoretical problems can be translated into some special spectra problems. Thus, questions about complexity classes are translated into questions about the expressive power of some languages. In this paper we investigate the spectra of some logics with Henkin quantifiers in the empty vocabulary.

The COVID-19 pandemic spread catastrophically over the world since the spring of 2020. In this paper, a heterogeneous branching process with immigration is established to quantify the human-to-human transmission of COVID-19 in local communities, based on the temporal and structural transmission patterns extracted from public case disclosures by four provincial Health Commissions in China. With proper parameter settings, our branching model matches the actual transmission chains satisfactorily and, therefore, sheds light on the underlying COVID-19 spreading mechanism. Moreover, based (...) on our branching model, the efficacy of home quarantine and social distancing are explored, providing a reference for the effective prevention of COVID-19 worldwide. (shrink)

We study generalized quantifiers on finite structures.With every function : we associate a quantifier Q by letting Q x say there are at least (n) elementsx satisfying , where n is the sizeof the universe. This is the general form ofwhat is known as a monotone quantifier of type .We study so called polyadic liftsof such quantifiers. The particular lifts we considerare Ramseyfication, branching and resumption.In each case we get exact criteria fordefinability of the lift in terms (...) of simpler quantifiers. (shrink)

We show in rather informal terms how witness sets can be useful in both explicating some basic intuitions about scope and understanding how particular denotational semantic differences between noun phrases affect their abilities to bear out certain scopal patterns. More generally we suggest that the usual notion of scope needs to be factored into variation distributivity and maximality. This part lays some groundwork for several of the subsequent chapters and is thus of interest to all readers. The second part shows (...) that already in this initial raw form the above insights can be applied to make a novel claim concerning the availability of so-called branching readings. In logical terms a branching reading can be defined for any sentence with a subject and a direct object. However speakers of English accept only a fraction of these readings, so the question arises how the data can be predicted from the meanings of the participating quantifiers and the syntactic structure of the sentence. We propose that thinking about the behavior of quantifiers along the lines introduced in the first part leads to a simple answer to this question. (shrink)

A predicate extension SQHT= of the logic of here-and-there was introduced by V. Lifschitz, D. Pearce, and A. Valverde to characterize strong equivalence of logic programs with variables and equality with respect to stable models. The semantics for this logic is determined by intuitionistic Kripke models with two worlds with constant individual domain and decidable equality. Our sequent formulation has special rules for implication and for pushing negation inside formulas. The soundness proof allows us to establish that SQHT= is a (...) conservative extension of the logic of weak excluded middle with respect to sequents without positive occurrences of implication. The completeness proof uses a non-closed branch of a proof search tree. The interplay between rules for pushing negation inside and truth in the “there” world of the resulting Kripke model can be of independent interest. We prove that existence is definable in terms of remaining connectives. (shrink)

Replacing the value-free ideal (VFI) for science requires attention to the broader understanding of how science in society should function. In public spaces, science needed to project the VFI in norms for science advising, science education, and science communication. This resulted in the independent science advisor model and a focus on science literacy for science education and communication. Attending to these broader implications of the VFI which structure science and society relationships is crucial if we are to properly replace the (...) VFI with a better ideal. (shrink)

The COVID-19 crisis has highlighted the considerable challenge of sourcing expertise and determining which experts to trust. Dissonant information fostered controversy in public discourse and encouraged an appeal to a wide range of social indicators of trustworthiness in order to decide whom to trust. We analyze public discourse on expertise by examining how social indicators inform the reputation of Dr. Didier Raoult, the French microbiologist who rose to international prominence as an early advocate for using hydroxychloroquine to treat COVID-19. To (...) comprehend how these indicators came to inform his reputation, we outline Dr. Raoult's rise to fame based on discourse about hydroxychloroquine. We then discuss why we trust in experts like scientist-practitioners. This is followed by an examination of how social indicators of trust like status, epistemic authority, influence and values have informed Dr. Raoult's reputation. We conclude with recommendations for how to improve the selection and evaluation social indicators of trust and reputations. Our aim here, instead of making a claim about the efficacy of hydroxychloroquine or Dr. Raoult's reputation per se, is to outline through this case study how social indicators of trust inform reputation and the challenge they present to evaluating expertise. (shrink)

That the result of flipping quantifiers and negating what comes after, applied to branching-quantifier sentences, is not equivalent to the negation of the original has been known for as long as such sentences have been studied. It is here pointed out that this syntactic operation fails in the strongest possible sense to correspond to any operation on classes of models.

I served as a medical student and resident in the 1960s. Science as a belief system had reached a pinnacle. Yet Not infrequently in those days, I found myself caring, with little available backup, for a hospital ward filled with sick and dying people. It was a lonely and often frightening responsibility. I began to encounter situations that were at odds with our collective certainty that science would provide the answers. Some of these memories I repressed for almost a decade. (...) I was unable to process them until I had personally experienced a more humanistic side of medicine. (shrink)

The International Criminal Court's intervention into the ongoing civil war in northern Uganda evoked a chorus of confident predictions as to its capacity to bring peace and justice to the war-torn region. However, this optimism is unwarranted.

Expert knowledge regularly informs personal and civic-decision making. To decide which experts to trust, lay publics —including policymakers and experts from other domains—use different epistemic and non-epistemic cues. Epistemic cues such as honesty, like when experts are forthcoming about conflicts of interest, are a popular way of understanding how people evaluate and decide which experts to trust. However, many other epistemic cues, like the evidence supporting information from experts, are inaccessible to lay publics. Therefore, lay publics simultaneously use second-order social (...) cues in their environment to inform decisions to trust. These second-order social cues, or ‘social indicators of trust’, prevent lay publics from having to trust blindly. Social indicators of trust therefore inform lay publics’ epistemic vigilance, or constant low level-monitoring of testimony from experts. This special issue examines the nature, acquisition and application of social indicators of trust for scientific experts and institutions. It also raises questions about the types of trust asked of lay publics and challenges traditional normative assumptions about the relationship between science and lay publics through study of attitudes, values, and experiences. The issue descriptively re-examines the structure of institutions, their role and methods for ferrying information, as well as how social indicators operate in times of crisis. In this collection of works, we bridge history, science, philosophy of science, science and technology studies, science communication and social epistemology, to broaden the discourse on trust in experts and more accurately reflect the imperfect yet indispensable endeavour that trusting is. (shrink)

Publics trust experts for personal and pro-social reasons. Scientists are among the experts publics trust most, and so, epistemic trust is routinely afforded to them. The call for epistemic trust to be more socially situated in order to account for the impact of science on society and public welfare is at the forefront of enhanced epistemic trust. I argue that the value-free ideal for science challenges establishing enhanced epistemic trust by preventing the inclusion of non-epistemic values throughout the evaluation of (...) evidence and communication of these values. By selectively silencing non-epistemic values, the ideal cannot take into account publics’ social and moral responses to inductive risk, which are instrumental for defining and determining public welfare. Furthermore, by emphasising epistemic values almost exclusively in science education and communication, the value-free ideal is presented to publics in such a way that it becomes a social indicator of trust. I show this through examination of the importance of values in decisions to trust, and conclude that values (and restrictions on them) can be used by lay publics to help decide which experts to trust. (shrink)

The recent proposal by the Independent Expert Panel of the Stop Ecocide initiative to include the crime of ecocide in the International Criminal Court's Rome Statute has raised expectations for preventing and remedying severe environmental harm through international prosecution. As alluring as this image is, we argue that ecocide prosecutions may be the most difficult, perhaps even impossible, in precisely the cases that the ICC would need to be concerned with; namely, the gravest global incidents of environmental harm, including those (...) associated with planetary climate change. We explore a series of questions about the panel's formulation of ecocide that resonate with longer debates around criminalizing environmental harm but take on new dimensions amid the Anthropocene and after twenty years of ICC trials. Ecocide must contend with the hard lessons learned concerning the ICC's limitations in realizing justice in a fraught international political context and also with fundamental challenges to knowledge and legitimacy arising from the uncertainty and dynamic socioenvironmental context of the Anthropocene. The proposed amendment, if adopted, risks ineffective prosecutions or even perverse outcomes for the environment itself. This risk, however, may characterize any effort to prosecute ecocide internationally in the Anthropocene unless the terms of international criminal law are fundamentally rethought. (shrink)

La guerre d’Algérie a été l’occasion d’une remise en cause de l’image traditionnelle du combattant. Ni les formes de combat, ni les activités demandées aux soldats français, ni les ennemis qu’on les chargeait de poursuivre ne pouvaient les conforter dans l’image que les appelés du contingent avaient du statut militaire. Ces décalages eurent des conséquences sur les modèles de masculinité élaborés et éprouvés pendant la guerre, que ce soit entre hommes ou par rapport aux femmes.