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)

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)

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 prove that the sharply bounded arithmetic T02 in a language containing the function symbol ⌊x /2y⌋ is equivalent to PV1.

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)

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.

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 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)

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

This is a reproduction of a book published before 1923. This book may have occasional imperfections such as missing or blurred pages, poor pictures, errant marks, etc. that were either part of the original artifact, or were introduced by the scanning process. We believe this work is culturally important, and despite the imperfections, have elected to bring it back into print as part of our continuing commitment to the preservation of printed works worldwide. We appreciate your understanding of the imperfections (...) in the preservation process, and hope you enjoy this valuable book. (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)

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)

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).

L'axe principal de ce texte du philosophe polonais Emil Lask (1875-1915) est la critique de la philosophie de la valeur et la théorie de la connaissance. Son exposé est l'une des révisions du kantisme les plus radicales du début du XXe siècle.

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)

Comprises the Charles F. Deems Lectures delivered at New York University in 1968. Discusses the significance of the Holocaust, emphasizing theological issues, and its uniqueness in history. An authentic response to it - religious or secular - is a commitment to the autonomy and security of the State of Israel. Refers to Jewish midrash to explore the meaning and significance of the Holocaust and relates Jewish thinking about the Holocaust to Jewish thinking about earlier catastrophes. Jewish particularism remains a scandal (...) to modern secularism. Pt. 3 (p. 67-104), "The Commanding Voice of Auschwitz", states that the death of God occurs in the inward realm of the spirit alone and nowhere else. The imperative for Jews is not to flee being Jewish: "Jews are forbidden to hand Hitler posthumous victories. They are commanded to survive as Jews". (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 his book The Intellectual Virtues and the Life of the Mind: On the Place of the Virtues in Contemporary Epistemology, Jonathan Kvanvig argues that there is an interchangeability of personal and doxastic justification, which ‘blocks the quick route to virtue epistemology’. To prove that personal justification is reducible to doxastic justification, he utilizes λ-calculus expressions that aim to show the logical equivalence of the two notions of justification. In this paper, I argue that he has made an illegitimate move (...) in his translation of the ordinary talk of personal justification into λ-expressions because his translation involves both an elimination from and an addition to the ordinary language. Pace Kvanvig, there is no logical equivalence of personal to doxastic justification. So, his argument for the reducibility of personal to doxastic justification founders. More importantly, since he has failed to disprove that personal justification is irreducibly primitive, he hasn’t shown that the prospects for virtue epistemology are ‘hopeless’. (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)

Does normothermic regional perfusion (NRP) resurrect the dead? That was the question I asked in one of the target articles published in the special issue of The American Journal of Bioethics (AJOB)...

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)

John Rawls A Theory of Justice har haft ett monumentalt inflytande på den moderna politiska filosofin. Jag försöker här genom några nedslag i den nutida diskussionen förmedla en bild av detta inflytande, och av bokens fortsatta filosofiska relevans. Jag inleder med en kort presentation av huvuddragen i Rawls rättviseteori. Efter det går jag igenom, och bemöter, kritiken mot idealteori. Jag diskuterar sedan förhållandet mellan rättvisa och ekonomisk ojämlikhet, och förklarar varför teorin är radikalare än vad många kritiker insett. Slutligen går (...) jag igenom hur en kontraktsteori av detta slag kan hantera frågan om rättvisa mellan generationer. (shrink)