Background Interest in strengthening residents’ autonomy in nursing homes is intensifying and professional caregivers’ experience ethical dilemmas when the principles of beneficence and autonomy conflict. This increased focus requires expanded knowledge of how residents experience decision-making in nursing homes and how being subject to paternalism affects residents’ dignity. Research question/aim This study explored how residents experience paternalism in nursing homes. Research design This study involved a qualitative interpretive design with participant observations and semi-structured interviews. The interpretations were informed by Gadamer’s (...) hermeneutics. Participants and research context Eleven residents were interviewed after a period of participant observation in two nursing homes. Ethical considerations The study was performed in accordance with the Helsinki declaration. The Regional Ethics Committee (REK) permitted the researcher to perform participant observation in the nursing homes. The use of audio recordings of interviews was registered and supervised by Sikt - Norwegian Agency for Shared Services in Education and Research. The resident’s consent was assessed continuously. Three interviews were terminated for ethical reasons. Findings The resident interviews revealed that residents found it obvious for caregivers to possess the decision-making authority in nursing homes. When residents explained their views, three main themes emerged: (1) To be included even though caregivers make the decisions, (2) Surrender to dependency, and (3) Adherence to nursing home norms. Conclusions Residents submit to their caregivers and give caregivers the responsibility and function as leaders. Paternalism was experienced as dignifying in situations where it contributed to residents being able to live according to second order desires and values, and when it implied respect and appraisal of residents’ capabilities. Paternalism was experienced as debasing when residents felt left out, and when residents felt that their capabilities were underestimated. This also included their capability to withstand paternalistic influence. (shrink)

Theories of personality and personality disorders need, from time to time, to be revised and updated according to new empirical and conceptual developments. Such development has taken place in the realms of affective neuroscience, evolution and social cognition. In this article we outline a new personality theory which claims that phenomena we usually ascribe to the concept personality are best understood by postulating a web consisting of three major constituents: Temperament (mainly primary emotions), attachment and self-consciousness (mentalizing). We describe these (...) constituents, their neurobiological underpinnings, the subjective experiences they evoke and their behavioral implications. We discuss the relevance of the espoused theory for the field of personality disorders with references to borderline, narcissistic and avoidant personality disorders as well as the DSM-5 Alternative Model. Implications for social psychology, psychotherapy and common-sense self-understanding are outlined. The theory aims to bridge previous contradictions between natural sciences and hermeneutics by its propositions of the evolution of self-consciousness. (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.

Reverse Mathematics (RM hereafter) is a program in the foundations of mathematics where the aim is to identify the minimal axioms needed to prove a given theorem from ordinary, i.e., non-set theoretic, mathematics. This program has unveiled surprising regularities: the minimal axioms are very often equivalent to the theorem over the base theory, a weak system of ‘computable mathematics’, while most theorems are either provable in this base theory, or equivalent to one of only four logical systems. The latter plus (...) the base theory are called the ‘Big Five’ and the associated equivalences are robust following Montalbán, i.e., stable under small variations of the theorems at hand. Working in Kohlenbach’s higher-order RM, we obtain two new and long series of equivalences based on theorems due to Bolzano, Weierstrass, Jordan, and Cantor; these equivalences are extremely robust and have no counterpart among the Big Five systems. Thus, higher-order RM is much richer than its second-order cousin, boasting at least two extra ‘Big’ systems. (shrink)

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)

Reviewed Works:Gaisi Takeuti, Proof Theory.Georg Kreisel, Proof Theory: Some Personal Recollections.Wolfram Pohlers, Contributions of the Schutte School in Munich to Proof Theory.Stephen G. Simpson, Subsystems of $\mathbf{Z}_2$ and Reverse Mathematics.Solomon Feferman, Proof Theory: A Personal Report.

The main question addressed in this chapter is how to analyze the modal ingredient in the concept of logical consequence or logical validity of an inference, here expressed by saying that the truth of the conclusion of a logically valid inference should follow by necessity of thought from the truth of the premisses. It is claimed that this modal ingredient is not taken care of by Tarski’s requirement, later developed in model theory, that for all interpretations of the non-logical terms (...) of the sentences, the conclusion is true if the premisses are. Instead we must bring in reasoning or the notion of proof in the analysis, and it is shown how one may develop a notion of proof or validity of an argument based on the constructive meaning of the logical constants. It is proposed that from a constructive point of view, a sentence is a consequence of a set of premisses if and only if there is a proof in the sense explained of the sentence from the set of premisses. Knowledge of such a proof compels us to hold the conclusion true given that we hold the premisses true. (shrink)

The traditional picture of logic takes it for granted that "valid arguments have a fundamental epistemic significance", but neither model theory nor traditional proof theory dealing with formal system has been able to give an account of this significance. Since valid arguments as usually understood do not in general have any epistemic significance, the problem is to explain how and why we can nevertheless use them sometimes to acquire knowledge. It is suggested that we should distinguish between arguments and acts (...) of inferences and that we have to reconsider the latter notion to arrive at the desired explanation. More precisely, the notions should be developed so that the following relationship holds: one gets in possession of a ground for a conclusion by inferring it from premisses for which one already has grounds, provided that the inference in question is valid. The paper proposes explications of the concepts of ground and deductively valid inference so that this relationship holds as a conceptual truth. Logical validity of inference is seen as a special case of deductive validity, but does not add anything as far as epistemic significance is concerned—it resides already in the deductively valid inferences. (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)

Dag Prawitz The Bulletin of Symbolic Logic, Volume 19, Issue 1, Page 119-122, March 2013.

This article provides an introduction to Kaplan-style semantics. The formal semantics usually employs the notion of a model, which, besides supplying the sets utterance contexts, circumstances and a domain M 0 of individuals, and also interprets the nonlogical atomic expressions of the language. Standard compositionality applies only to character: Funct makes immediate sense, since character assigns a semantic value directly to expressions. For semantic functions taking contextual arguments, the notion of compositionality must be revised. Notions of contextual compositionality apply directly (...) to the functional version of the setup that starts with the function char, and defines the other semantics from it. The point of evaluation semantics is indeed basic: if it is compositional, so is the content semantics, and the character semantics. (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)

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)

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)

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)

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)

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)

What is the appropriate notion of truth for sentences whose meanings are understood in epistemic terms such as proof or ground for an assertion? It seems that the truth of such sentences has to be identified with the existence of proofs or grounds, and the main issue is whether this existence is to be understood in a temporal sense as meaning that we have actually found a proof or a ground, or if it could be taken in an abstract, tenseless (...) sense. Would the latter alternative amount to realism with respect to proofs or grounds in a way that would be contrary to the supposedly anti-realistic standpoint underlying the epistemic understanding of linguistic expressions? Before discussing this question, I shall consider reasons for construing linguistic meaning epistemically and relations between such reasons and reasons for taking an anti-realist point of view towards the discourse in question. (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)

The aim of Reverse Mathematics (RM for short) is to find the minimal axioms needed to prove a given theorem of ordinary mathematics. These minimal axioms are almost always equivalent to the theorem, working over the base theory of RM, a weak system of computable mathematics. The Big Five phenomenon of RM is the observation that a large number of theorems from ordinary mathematics are either provable in the base theory or equivalent to one of only four systems; these five (...) systems together are called the ‘Big Five’. The aim of this paper is to greatly extend the Big Five phenomenon as follows: there are two supposedly fundamentally different approaches to RM where the main difference is whether the language is restricted to second-order objects or if one allows third-order objects. In this paper, we unite these two strands of RM by establishing numerous equivalences involving the second-order Big Five systems on one hand, and well-known third-order theorems from analysis about (possibly) discontinuous functions on the other hand. We both study relatively tame notions, like cadlag or Baire 1, and potentially wild ones, like quasi-continuity. We also show that slight generalizations and variations of the aforementioned third-order theorems fall far outside of the Big Five. (shrink)

We show how Kreisel's representation theorem for sets in the analytical hierarchy can be generalized to sets defined by positive induction and use this to estimate the complexity of constructions in the theory of domains with totality.

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.

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