In this paper, we introduce the Societal Readiness Thinking Tool to aid researchers and innovators in developing research projects with greater responsiveness to societal values, needs, and expectations. The need for societally-focused approaches to research and innovation—complementary to Technology Readiness frameworks—is presented. Insights from responsible research and innovation concepts and practice, organized across critical stages of project-life cycles are discussed with reference to the development of the SR Thinking Tool. The tool is designed to complement not only shortfalls in TR (...) approaches, but also improve upon other efforts to integrate RRI, sustainability, and design thinking in research and innovation cycles. Operationalization and early-stage user tests of the Tool are reported, along with discussion of potential future iterations and applications. (shrink)

Stewart in this book uses essays from well-known Hegel scholars such as Shlomo Avineri, Emil Fackenheim, T. M. Knox, and Henning Ottmann to identify and to correct Hegel myths. Five myths are discussed thoroughly. Part 1 deals with the myth of Hegel justifying the status quo derived from the dictum "was vernünftig ist, das ist wirklich; und was wirklich ist, das ist vernünftig" in the preface of the Philosophy of Right. This allegation does not consider that "according to his (...) [Hegel's] dialectic of culture and spirit, philosophical knowledge must emerge from within the development of actual knowledge and cultural forms, and not as an artificial imposition upon them". (shrink)

The vital status of patients who are a part of controlled donation after circulatory death (cDCD) is widely debated in bioethical literature. Opponents to currently applied cDCD protocols argue that they violate the dead donor rule, while proponents of the protocols advocate compatibility. In this article, we argue that both parties often misinterpret the moral implications of the dead donor rule. The rule as such does not require an assessment of a donor’s vital status, we contend, but rather an assessment (...) of whether procurement of organs in cDCD cause the death of the donor or not. We then argue that commonly practiced cDCD protocols do not violate the dead donor rule, since the donation does not trigger or cause the death of the donors. (shrink)

Short description: One of the major works of the great German theologian Emil Brunner, The Divine Imperative deals with one the many uncertainties in which we ...

The introduction of normothermic regional perfusion (NRP) in controlled donation after circulatory determination of death (cDCDD) protocols is by some regarded as controversial and ethically troublesome. One of the main concerns that opponents have about introducing NRP in cDCDD protocols is that reestablishing circulation will negate the determination of death by circulatory criteria, potentially resuscitating the donor. In this article, I argue that this is not the case. If we take a closer look at the concept of death underlying the (...) circulatory criterion for determination of death, we find that the purpose of the criterion is to show whether the organism as a whole has died. I argue that this purpose is fulfilled by the circulatory criterion in cDCDD protocols, and that applying NRP does not negate the determination of death or resuscitate the donor. (shrink)

INTRODUCTION In ita original form the present paper was presented to the American Mathematical Society, April 2k,, as a companion piece to the writer's ...

We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition under which the admissibility problem is coNEXP-hard. We also show that admissibility in several well-known systems (including GL, S4, and IPC) is in coNE, thus obtaining a sharp complexity estimate for admissibility in these systems.

Marking the centenary of Walter Benjamin's immensely influential essay, "Toward the Critique of Violence," this critical edition presents readers with an altogether new, fully annotated translation of a work that is widely recognized as a classic of modern political theory. The volume includes twenty-one notes and fragments by Benjamin along with passages from all of the contemporaneous texts to which his essay refers. Readers thus encounter for the first time in English provocative arguments about law and violence advanced by Hermann (...) Cohen, Kurt Hiller, Erich Unger, and Emil Lederer. A new translation of selections from Georges Sorel's Reflections on Violence further illuminates Benjamin's critical program. The volume also includes, for the first time in any language, a bibliography Benjamin drafted for the expansion of the essay and the development of a corresponding philosophy of law. An extensive introduction and afterword provide additional context. With its challenging argument concerning violence, law, and justice-which addresses such topical matters as police violence, the death penalty, and the ambiguous force of religion-Benjamin's work is as important today as it was upon its publication in Weimar Germany a century ago. (shrink)

Alienation is among the most influential terms in Marxist theory, but also one of the most ambiguous and controversial. Unlike previous literature, which has tended to focus on Marx’ early philosophical writings, this offers a novel reinterpretation of the theory of alienation found in Marx’s later works. Rather than conceiving alienation as a subjective experience or an inherent feature of social organization, I contend that alienation in the Marxist sense can be understood as an objective process arising from the appropriation (...) of the results of production and their transformation into capital. This interpretation resolves the main theoretical problems conventionally associated with alienation theory, for example the tendency towards essentialism and moral paternalism. In particular, a Marxist theory of alienation explains the paradox of social power and isolation that characterizes contemporary capitalist societies, in which feelings of powerlessness and loneliness are intensified despite objective increases in humanity’s social power and interdependence. (shrink)

We develop canonical rules capable of axiomatizing all systems of multiple-conclusion rules over K4 or IPC, by extension of the method of canonical formulas by Zakharyaschev [37]. We use the framework to give an alternative proof of the known analysis of admissible rules in basic transitive logics, which additionally yields the following dichotomy: any canonical rule is either admissible in the logic, or it is equivalent to an assumption-free rule. Other applications of canonical rules include a generalization of the Blok–Esakia (...) theorem and the theory of modal companions to systems of multiple-conclusion rules or (finitary structural global) consequence relations, and a characterization of splittings in the lattices of consequence relations over monomodal or superintuitionistic logics with the finite model property. (shrink)

" -- Franklin H. Littell In To Mend the World Emil L. Fackenheim points the way to Judaism's renewal in a world and an age in which all of our notions -- about ...

We show that IPC, K4, GL, and S4, as well as all logics inheriting their admissible rules, have independent bases of admissible rules.

We show that \, the basic theory of bounded arithmetic corresponding to the complexity class \, proves the \ axiom expressing the totality of iterated multiplication satisfying its recursive definition, by formalizing a suitable version of the \ iterated multiplication algorithm by Hesse, Allender, and Barrington. As a consequence, \ can also prove the integer division axiom, and the \-translation of induction and minimization for sharply bounded formulas. Similar consequences hold for the related theories \ and \. As a side (...) result, we also prove that there is a well-behaved \ definition of modular powering in \\). (shrink)

We show that $$ VTC ^0$$, the basic theory of bounded arithmetic corresponding to the complexity class $$\mathrm {TC}^0$$, proves the $$ IMUL $$ axiom expressing the totality of iterated multiplication satisfying its recursive definition, by formalizing a suitable version of the $$\mathrm {TC}^0$$ iterated multiplication algorithm by Hesse, Allender, and Barrington. As a consequence, $$ VTC ^0$$ can also prove the integer division axiom, and (by our previous results) the $$ RSUV $$ -translation of induction and minimization for sharply (...) bounded formulas. Similar consequences hold for the related theories $$\Delta ^b_1\text{- } CR $$ and $$C^0_2$$. As a side result, we also prove that there is a well-behaved $$\Delta _0$$ definition of modular powering in $$I\Delta _0+ WPHP (\Delta _0)$$. (shrink)

We study the notion of conservative translation between logics introduced by (Feitosa & D’Ottaviano2001). We show that classical propositional logic (CPC) is universal in the sense that every finitary consequence relation over a countable set of formulas can be conservatively translated into CPC. The translation is computable if the consequence relation is decidable. More generally, we show that one can take instead of CPC a broad class of logics (extensions of a certain fragment of full Lambek calculus FL) including most (...) nonclassical logics studied in the literature, hence in a sense, (almost) any two reasonable deductive systems can be conservatively translated into each other. We also provide some counterexamples, in particular the paraconsistent logic LP is not universal. (shrink)

We study the extension 123) of the theory S21 by instances of the dual weak pigeonhole principle for p-time functions, dWPHPx2x. We propose a natural framework for formalization of randomized algorithms in bounded arithmetic, and use it to provide a strengthening of Wilkie's witnessing theorem for S21+dWPHP. We construct a propositional proof system WF , which captures the Π1b-consequences of S21+dWPHP. We also show that WF p-simulates the Unstructured Extended Nullstellensatz proof system of Buss et al. 256). We prove that (...) dWPHP is equivalent to a statement asserting the existence of a family of Boolean functions with exponential circuit complexity. Building on this result, we formalize the Nisan–Wigderson construction in a conservative extension of S21+dWPHP. (shrink)

Excerpt from Die Lehre vom Urteil Windelband hat in seinen "präludien und in dem Aufsatz der Festschrift für Zeller "beiträge zur Lehre vom nega tiven Urteil gerade vermittelst der Urteilslehre den ent scheidenden Schritt zu tun vermocht, der Logik wieder ihre sachliche Heimat im Ganzen der Philos0phie zu bestimmen. Rickerts "gegenstand der Erkenntnis ist sodann das Grund buch für alle logischen Untersuchungen der Werttheorie geworden und geblieben. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. (...) Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works. (shrink)

This essay explores the implications of historicising John Rawls’s theory of justice. While historical research on Rawls and his social context has provided valuable insights, some scholars argue that historicising carries significant philosophical consequences. This paper critically examines one such argument that contends that historicising Rawls’s theory demonstrates its contextual nature, undermines its diagnostic powers, and leads to its complete dissolution. We offer a reconstruction of this argument and show that it fails. Further, while we argue that this argument fails, (...) we go on to suggest that historical evidence may contribute to a defensive argument against appeals to expert opinion. By examining the appropriate relationship between historical research and philosophy, this essay contributes to the evaluation of the historicist critique and offers insights into the broader role of historical research in philosophical discourse. (shrink)

According to John Rawls’s famous Liberal Principle of Legitimacy, the exercise of political power is legitimate only if it is justifiable to all citizens. The currently dominant interpretation of what is justifiable to persons in this sense is an internalist one. On this view, what is justifiable to persons depends on their beliefs and commitments. In this paper I challenge this reading of Rawls’s principle, and instead suggest that it is most plausibly interpreted in externalist terms. On this alternative view, (...) what is justifiable to persons is not in any way dependent on, or relativized to, their beliefs and commitments. Instead, what is justifiable to all in the relevant sense is what all could accept as free and equal. I defend this reinterpretation of the view by showing how it is supported by Rawls’s account of the freedom and equality of persons. In addition, a considerable advantage of this suggestion is that it allows for an inclusive account of to whom the exercise of political power must be made justifiable. (shrink)

The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory T in which all partially recursive functions are representable, yet T does not interpret Robinson’s theory R. To this end, we borrow tools from model theory — specifically, we investigate model-theoretic properties of the model completion of the empty theory in a language with function symbols. We obtain a certain characterization of ∃∀ theories interpretable in (...) existential theories in the process. (shrink)

There have been few attempts thus far to read Rorty through a humanistic lens. This paper is an attempt at making explicit some of the key features of his conception. My main objective is to show that humanism is integral to his philosophy and to explain what it consists in. I focus on Rorty’s secular humanism, which I believe lies at the center of his thought. In sections 2 and 3, I provide an account of key humanist sources, both pragmatist (...) and non-pragmatist. Section 4 examines recent interpretations of Rorty as a humanist. In section 5, I focus on the distinction between the human and nonhuman as the central feature of his humanism. Section 6 outlines Rorty’s project to humanize humanity. In the concluding section, I summarize the key features of his humanism. (shrink)

We prove that the sharply bounded arithmetic T02 in a language containing the function symbol ⌊x /2y⌋ is equivalent to PV1.

We investigate the substitution Frege () proof system and its relationship to extended Frege () in the context of modal and superintuitionistic propositional logics. We show that is p-equivalent to tree-like , and we develop a “normal form” for -proofs. We establish connections between for a logic L, and for certain bimodal expansions of L.We then turn attention to specific families of modal and si logics. We prove p-equivalence of and for all extensions of , all tabular logics, all logics (...) of finite depth and width, and typical examples of logics of finite width and infinite depth. In most cases, we actually show an equivalence with the usual system for classical logic with respect to a naturally defined translation.On the other hand, we establish exponential speed-up of over for all modal and si logics of infinite branching, extending recent lower bounds by P. Hrubeš. We develop a model-theoretical characterization of maximal logics of infinite branching to prove this result. (shrink)

By a well-known result of Cook and Reckhow [S.A. Cook, R.A. Reckhow, The relative efficiency of propositional proof systems, Journal of Symbolic Logic 44 36–50; R.A. Reckhow, On the lengths of proofs in the propositional calculus, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1976], all Frege systems for the classical propositional calculus are polynomially equivalent. Mints and Kojevnikov [G. Mints, A. Kojevnikov, Intuitionistic Frege systems are polynomially equivalent, Zapiski Nauchnyh Seminarov POMI 316 129–146] have recently shown p-equivalence of (...) Frege systems for the intuitionistic propositional calculus in the standard language, building on a description of admissible rules of IPC by Iemhoff [R. Iemhoff, On the admissible rules of intuitionistic propositional logic, Journal of Symbolic Logic 66 281–294]. We prove a similar result for an infinite family of normal modal logics, including K4, GL, S4, and. (shrink)

In Beyond the Limits of Thought [2002], Graham Priest argues that logical and semantic paradoxes have the same underlying structure (which he calls the Inclosure Schema ). He also argues that, in conjunction with the Principle of Uniform Solution (same kind of paradox, same kind of solution), this is sufficient to 'sink virtually all orthodox solutions to the paradoxes', because the orthodox solutions to the paradoxes are not uniform. I argue that Priest fails to provide a non-question-begging method to 'sink (...) virtually all orthodox solutions', and that the Inclosure Schema cannot be the structure that underlies the Liar paradox. Moreover, Ramsey was right in thinking that logical and semantic paradoxes are paradoxes of different kinds. (shrink)

We develop approximate counting of sets definable by Boolean circuits in bounded arithmetic using the dual weak pigeonhole principle (dWPHP(PV)), as a generalization of results from [15]. We discuss applications to formalization of randomized complexity classes (such as BPP, APP, MA, AM) in PV₁ + dWPHP(PV).

"Jewish Philosophy and the Academy reflects in broad terms on the current state of Jewish philosophy in the university. This generation of university teachers lives at a unique historic junction. It is the last to be taught by the giants of European Wissenschaft des Judentums and the first to experience the remarkable expansion of Judaic scholarship in Israel and abroad." "Emil Fackenheim suggests that if we are indebted to Athens for the philosophical method, we are also indebted to Jerusalem (...) for the ethical content of philosophy, which is both an intellectual and a moral challenge. This dual challenge shapes the diverse papers in this volume."--BOOK JACKET.Title Summary field provided by Blackwell North America, Inc. All Rights Reserved. (shrink)

We develop an arithmetical theory and its variant , corresponding to “slightly nonuniform” . Our theories sit between and , and allow evaluation of log-depth bounded fan-in circuits under limited conditions. Propositional translations of -formulas provable in admit L-uniform polynomial-size Frege proofs.

The elementary arithmetic operations +,·,≤\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${+,\cdot,\le}$$\end{document} on integers are well-known to be computable in the weak complexity class TC0, and it is a basic question what properties of these operations can be proved using only TC0-computable objects, i.e., in a theory of bounded arithmetic corresponding to TC0. We will show that the theory VTC0 extended with an axiom postulating the totality of iterated multiplication proves induction for quantifier-free formulas in the language ⟨+,·,≤⟩\documentclass[12pt]{minimal} (...) \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\langle{+,\cdot,\le}\rangle}$$\end{document}, and more generally, minimization for Σ0b\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma_{0}^{b}}$$\end{document} formulas in the language of Buss’s S2. (shrink)