This paper critically interrogates the usefulness of the concept of violence regimes for social politics, social analysis, and social theory. In the first case, violence regimes address and inform politics and policy, that is, social politics, both around various forms of violence, such as gender-based violence, violence against women, anti-lesbian, gay and transgender violence, intimate partner violence, and more widely in terms of social and related policies and practices on violence and anti-violence. In the second case, violence regimes assist social (...) analysis of the interconnections of different forms and aspects of violence, and relative autonomy from welfare regimes and gender regimes. Third, the violence regime concept engages a wider range of issues in social theory, including the exclusion of the knowledges of the violated, most obviously, but not only, when the voices and experiences of those killed are unheard. The concept directs attention to assumptions made in social theory as incorporating or neglecting violence. More specifically, it highlights the significance of: social effects beyond agency; autotelic ontology, that is, violence as a means and end in itself, and an inequality in itself; the relations of violence, sociality and social relations; violence and power, and the contested boundary between them; and materiality-discursivity in violence and what is to count as violence. These are key issues for both violence studies and social theory more generally. (shrink)

Levinas did not present any new ethical theories; he did not even give any normative recommendations. But his phenomenological investigations help us to understand how the idea of ethics emerges and how we try to cope with it. The purpose of this paper is to suggest some implications from a reading of Levinas on how ethical challenges are handled within a management perspective. The paper claims that management, both in theory and in practice, is necessarily egocentric and thus ethically biased. (...) Therefore, ethics, defined as the idea that it is possible to do otherwise than pursue one's own interest, must have its source outside the scope of management. Levinas identifies this source as the call for responsibility from the Other, beyond the reach of managerial control. He also suggests how this idea of ethics is put into practice, especially in economic life: the existence of money makes it both possible and necessary to compare unique and incomparable others. Management tools may be used in the service of always more justice, as it also may be used for the opposite purpose. Instead of trying to draw a normative conclusion from Levinas, we may distinguish between two ways of experiencing reality: one through language and knowledge, covering both descriptive and normative knowledge, including ‘business ethics’, and the other through the particular events of encounters, from where this knowledge is continuously questioned through the call for responsibility, and thereby may provide possibilities for continuous improvements towards always more justice. (shrink)

This volume examines the notion of an analytic proof as a natural deduction, suggesting that the proof's value may be understood as its normal form--a concept with significant implications to proof-theoretic semantics.

There are two main routes to a concept of (generalized) quantifier. The first starts from first‐order logic, FO, and generalizes from the familiar ∀ and ∃ occurring there. The second route begins with real languages, and notes that many so‐called noun phrases, a kind of phrase which occurs abundantly in most languages, can be interpreted in a natural and uniform way using quantifiers.

Bolzano’s definition of consequence in effect associates with each set X of symbols (in a given interpreted language) a consequence relation X . We present this in a precise and abstract form, in particular studying minimal sets of symbols generating X . Then we present a method for going in the other direction: extracting from an arbitrary consequence relation its associated set C of constants. We show that this returns the expected logical constants from familiar consequence relations, and that, restricting (...) attention to sets of symbols satisfying a strong minimality condition, there is an isomorphism between the set of strongly minimal sets of symbols and the set of corresponding consequence relations (both ordered under inclusion). (shrink)

The paper elaborates two points: i) There is no principal opposition between predicate logic and adherence to subject-predicate form, ii) Aristotle's treatment of quantifiers fits well into a modern study of generalized quantifiers.

According to a main idea of Gentzen the meanings of the logical constants are reflected by the introduction rules in his system of natural deduction. This idea is here understood as saying roughly that a closed argument ending with an introduction is valid provided that its immediate subarguments are valid and that other closed arguments are justified to the extent that they can be brought to introduction form. One main part of the paper is devoted to the exact development of (...) this notion. Another main part of the paper is concerned with a modification of this notion as it occurs in Michael Dummett’s book The Logical Basis of Metaphysics. The two notions are compared and there is a discussion of how they fare as a foundation for a theory of meaning. It is noted that Dummett’s notion has a simpler structure, but it is argued that it is less appropriate for the foundation of a theory of meaning, because the possession of a valid argument for a sentence in Dummett’s sense is not enough to be warranted to assert the sentence. (shrink)

This is a reply to H. Ben-Yami, 'Generalized quantifiers, and beyond' (this journal, 2009), where he argues that standard GQ theory does not explain why natural language quantifiers have a restricted domain of quantification. I argue, on the other hand, that although GQ theory gives no deep explanation of this fact, it does give a sort of explanation, whereas Ben-Yami's suggested alternative is no improvement.

A semantics may be compositional and yet partial, in the sense that not all well-formed expressions are assigned meanings by it. Examples come from both natural and formal languages. When can such a semantics be extended to a total one, preserving compositionality? This sort of extension problem was formulated by Hodges, and solved there in a particular case, in which the total extension respects a precise version of the fregean dictum that the meaning of an expression is the contribution it (...) makes to the meanings of complex phrases of which it is a part. Hodges' result presupposes the so-called Husserl property, which says roughly that synonymous expressions must have the same category. Here I solve a different version of the compositional extension problem, corresponding to another type of linguistic situation in which we only have a partial semantics, and without assuming the Husserl property. I also briefly compare Hodges' framework for grammars in terms of partial algebras with more familiar ones, going back to Montague, which use many-sorted algebras instead. (shrink)

We characterize the generalized quantifiers Q which satisfy the scheme $QxQy\phi \leftrightarrow QyQx\phi$ , the so-called self-commuting quantifiers, or quantifiers with the Fubini property.

A common misunderstanding is that there is something logically amiss with the classical square of opposition, and that the problem is related to Aristotle’s and medieval philosophers’ rejection of empty terms. But [Parsons 2004] convincingly shows that most of these philosophers did not in fact reject empty terms, and that, when properly understood, there are no logical problems with the classical square. Instead, the classical square, compared to its modern version, raises the issue of the existential import of words like (...) all; a semantic issue. I argue that the modern square is more interesting than Parsons allows, because it presents, in contrast with the classical square, notions of negation that are ubiquitous in natural languages. This is an indirect logical argument against interpreting all with existential import. I also discuss some linguistic matters bearing on the latter issue. (shrink)

Ethics in business and economics is often attacked for being too superficial. By elaborating the conclusions of two such critics of business ethics and welfare economics respectively, this article will draw the attention to the ethics behind these apparently well-intended, but not always convincing constructions, by help of the fundamental ethics of Emmanuel Levinas. To Levinas, responsibility is more basic than language, and thus also more basic than all social constructions. Co-operation relations in organizations, markets and value networks are generated (...) from personal relations and personal responsibilities. It is not sufficient to integrate ethics in an impersonal, rational system, neither in business organizations nor in the world economy. Ethics has its source not in rationality, but in the personal. (shrink)

We study the logical and computational properties of basic theorems of uncountable mathematics, including the Cousin and Lindelöf lemma published in 1895 and 1903. Historically, these lemmas were among the first formulations of open-cover compactness and the Lindelöf property, respectively. These notions are of great conceptual importance: the former is commonly viewed as a way of treating uncountable sets like e.g. [Formula: see text] as “almost finite”, while the latter allows one to treat uncountable sets like e.g. [Formula: see text] (...) as “almost countable”. This reduction of the uncountable to the finite/countable turns out to have a considerable logical and computational cost: we show that the aforementioned lemmas, and many related theorems, are extremely hard to prove, while the associated sub-covers are extremely hard to compute. Indeed, in terms of the standard scale (based on comprehension axioms), a proof of these lemmas requires at least the full extent of second-order arithmetic, a system originating from Hilbert–Bernays’ Grundlagen der Mathematik. This observation has far-reaching implications for the Grundlagen’s spiritual successor, the program of Reverse Mathematics, and the associated Gödel hierarchy. We also show that the Cousin lemma is essential for the development of the gauge integral, a generalization of the Lebesgue and improper Riemann integrals that also uniquely provides a direct formalization of Feynman’s path integral. (shrink)

Levinas did not present any new ethical theories; he did not even give any normative recommendations. But his phenomenological investigations help us to understand how the idea of ethics emerges and how we try to cope with it. The purpose of this paper is to suggest some implications from a reading of Levinas on how ethical challenges are handled within a management perspective. The paper claims that management, both in theory and in practice, is necessarily egocentric and thus ethically biased. (...) Therefore, ethics, defined as the idea that it is possible to do otherwise than pursue one's own interest, must have its source outside the scope of management. Levinas identifies this source as the call for responsibility from the Other, beyond the reach of managerial control. He also suggests how this idea of ethics is put into practice, especially in economic life: the existence of money makes it both possible and necessary to compare unique and incomparable others. Management tools may be used in the service of always more justice, as it also may be used for the opposite purpose. Instead of trying to draw a normative conclusion from Levinas, we may distinguish between two ways of experiencing reality: one through language and knowledge, covering both descriptive and normative knowledge, including business ethics, and the other through the particular events of encounters, from where this knowledge is continuously questioned through the call for responsibility, and thereby may provide possibilities for continuous improvements towards always more justice. (shrink)

We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. A basic property of Cantor space$2^ $ is Heine–Borel compactness: for any open covering of $2^ $, there is a finite subcovering. A natural question is: How hard is it to compute such a finite subcovering? We make this precise by analysing the complexity of so-called fan functionals that given any $G:2^ \to $, output a (...) finite sequence $\langle f_0, \ldots,f_n \rangle $ in $2^ $ such that the neighbourhoods defined from $\overline {f_i } G\left$ for $i \le n$ form a covering of $2^ $. A basic property of Cantor space in Nonstandard Analysis is Abraham Robinson’s nonstandard compactness, i.e., that every binary sequence is “infinitely close” to a standard binary sequence. We analyse the strength of this nonstandard compactness property of Cantor space, compared to the other axioms of Nonstandard Analysis and usual mathematics.Our study of yields exotic objects in computability theory, while leads to surprising results in Reverse Mathematics. We stress that and are highly intertwined, i.e., our study is holistic in nature in that results in computability theory yield results in Nonstandard Analysis and vice versa. (shrink)

It has been common in contemporary logic and philosophy of logic to identify the validity of an inference with its conclusion being a (logical) consequence of its premisses.

We study the logical and computational properties of basic theorems of uncountable mathematics, in particular Pincherle's theorem, published in 1882. This theorem states that a locally bounded function is bounded on certain domains, i.e. one of the first ‘local-to-global’ principles. It is well-known that such principles in analysis are intimately connected to (open-cover) compactness, but we nonetheless exhibit fundamental differences between compactness and Pincherle's theorem. For instance, the main question of Reverse Mathematics, namely which set existence axioms are necessary to (...) prove Pincherle's theorem, does not have an unique or unambiguous answer, in contrast to compactness. We establish similar differences for the computational properties of compactness and Pincherle's theorem. We establish the same differences for other local-to-global principles, even going back to Weierstrass. We also greatly sharpen the known computational power of compactness, for the most shared with Pincherle's theorem however. Finally, countable choice plays an important role in the previous, we therefore study this axiom together with the intimately related Lindelöf lemma. (shrink)

Ibn al-'Arabī (d. 1240) was one of the towering figures of Islamic intellectual history, and among Sufis still bears the title of al-shaykh al-akbar, or "the greatest master." Ibn al-'Arabī and Islamic Intellectual Culturetraces the history of the concept of "oneness of being" (wahdat al-wujūd) in the school of Ibn al- 'Arabī, in order to explore the relationship between mysticism and philosophy in Islamic intellectual life. It examines how the conceptual language used by early mystical writers became increasingly engaged over (...) time with the broader Islamic intellectual culture, eventually becoming integrated with the latter's common philosophical and theological vocabulary. It focuses on four successive generations of thinkers (Sadr al-Dīn al-Qūnawī, Mu'ayyad al-Dīn al-Jandī, 'Abd al-Razzāq al-Kāshānī, and Dāwūd al-Qaysarī), and examines how these "philosopher-mystics" refined and developed the ideas of Ibn al-'Arabī. Through a close analysis of texts, the book clearly traces the crystallization of an influential school of thought in Islamic history and its place in the broader intellectual culture. Offering an exploration of the development of Sufi expression and thought, this book will be a valuable resource for students and scholars of Islamic thought, philosophy, and mysticism. (shrink)

It is not unreasonable to think that the dispute between classical and intuitionistic mathematics might be unresolvable or 'faultless', in the sense of there being no objective way to settle it. If so, we would have a pretty case of relativism. In this note I argue, however, that there is in fact not even disagreement in any interesting sense, let alone a faultless one, in spite of appearances and claims to the contrary. A position I call classical pluralism is sketched, (...) intended to provide a coherent methodological stance towards the issue. Some reasons to recommend this stance are given, as well as some speculations as to why not everyone might want to follow the recommendation. (shrink)

This note explains the circumstances under which a type 1 quantifier can be decomposed into a type 1, 1 quantifier and a set, by fixing the first argument of the former to the latter. The motivation comes from the semantics of Noun Phrases (also called Determiner Phrases) in natural languages, but in this article, I focus on the logical facts. However, my examples are taken among quantifiers appearing in natural languages, and at the end, I sketch two more principled linguistic (...) applications. (shrink)

In the 12th century the "Book of the Soul" by the philosopher Avicenna was translated from Arabic into Latin. It had an immense success among scholastic writers and deeply influenced the structure and content of many psychological works of the Middle Ages. The reception of Avicenna's book is the story of cultural contact at an imipressively high intellectural level. The present volume investigates this successful reception using two approaches. The first is chronological, tracing the stages by which Avicenna's work was (...) accepted and adapted by Latin scholars. The second is doctrinal, analyzing the fortunes of key doctrines. The sense of the original Arabic text of Avicenna is kept in mind throughout and the degree to which his original Latin interpreters succeeded in conveying it is evaluated. (shrink)

This article points out problems in current dynamic treatments of anaphora and provides a new account that solves these by grafting Muskens' Compositional Discourse Representation Theory onto a partial theory of types. Partiality is exploited to keep track of which discourse referents have been introduced in the text (thus avoiding the overwrite problem) and to account for cases of anaphoric failure. Another key assumption is that the set of discourse referents is well-ordered, so that we can keep track of the (...) order in which they have been introduced, allowing a semantic characterization of anaphoric accessibility across stretches of discourse. Unlike other dynamic approaches, the system defines semantic values for unresolved anaphors. This leads to a clear separation of monotonic and non-monotonic content (in this case anaphoric resolution) and arguably provides a sound basis for a non-monotonic theory of anaphoric resolution. (shrink)

I see the question what it is that makes an inference valid and thereby gives a proof its epistemic power as the most fundamental problem of general proof theory. It has been surprisingly neglected in logic and philosophy of mathematics with two exceptions: Gentzen’s remarks about what justifies the rules of his system of natural deduction and proposals in the intuitionistic tradition about what a proof is. They are reviewed in the paper and I discuss to what extent they succeed (...) in answering what a proof is. Gentzen’s ideas are shown to give rise to a new notion of valid argument. At the end of the paper I summarize and briefly discuss an approach to the problem that I have proposed earlier. (shrink)

We may try to explain proofs as chains of valid inference, but the concept of validity needed in such an explanation cannot be the traditional one. For an inference to be legitimate in a proof it must have sufficient epistemic power, so that the proof really justifies its final conclusion. However, the epistemic concepts used to account for this power are in their turn usually explained in terms of the concept of proof. To get out of this circle we may (...) consider an idea within intuitionism about what it is to justify the assertion of a proposition. It depends on Heyting’s view of the meaning of a proposition, but does not presuppose the concept of inference or of proof as chains of inferences. I discuss this idea and what is required in order to use it for an adequate notion of valid inference. (shrink)

Cantor’s first set theory paper (1874) establishes the uncountability of ${\mathbb R}$. We study this most basic mathematical fact formulated in the language of higher-order arithmetic. In particular, we investigate the logical and computational properties of ${\mathsf {NIN}}$ (resp. ${\mathsf {NBI}}$ ), i.e., the third-order statement there is no injection resp. bijection from $[0,1]$ to ${\mathbb N}$. Working in Kohlenbach’s higher-order Reverse Mathematics, we show that ${\mathsf {NIN}}$ and ${\mathsf {NBI}}$ are hard to prove in terms of (conventional) comprehension axioms, (...) while many basic theorems, like Arzelà’s convergence theorem for the Riemann integral (1885), are shown to imply ${\mathsf {NIN}}$ and/or ${\mathsf {NBI}}$. Working in Kleene’s higher-order computability theory based on S1–S9, we show that the following fourth-order process based on ${\mathsf {NIN}}$ is similarly hard to compute: for a given $[0,1]\rightarrow {\mathbb N}$ -function, find reals in the unit interval that map to the same natural number. (shrink)