The process-dissociation procedure has been used in a variety of experimental contexts to assess the contributions of conscious and unconscious processes to task performance. To evaluate whether motivation affects estimates of conscious and unconscious processes, participants were given incentives to follow inclusion and exclusion instructions in a perception task and a memory task. Relative to a control condition in which no performance incentives were given, the results for the perception task indicated that incentives increased the participants' ability to exclude previously (...) presented information, which in turn both increased the estimate of conscious processes and decreased the estimate of unconscious processes. However, the results also indicated that incentives did not influence estimates of conscious or unconscious processes in the memory task. The findings suggest that the process-dissociation procedure is relatively immune to influences of motivation when used with a memory task, but that caution should be exercised when the process-dissociation is used with a perception task. (shrink)

In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. First, we show that first-order theories of finite signature that have functional non-surjective ordered pairing are definitionally equivalent to extensions in the same language of the basic theory of non-surjective ordered pairing. Second, we show that a first-order theory of finite signature is sequential (is a theory of sequences) iff it is (...) definitionally equivalent to an extension in the same language of a system of weak set theory called WS. (shrink)

In this paper we study essential hereditary undecidability. Theories with this property are a convenient tool to prove undecidability of other theories. The paper develops the basic facts concerning essentially hereditary undecidability and provides salient examples, like a construction of essentially hereditarily undecidable theories due to Hanf and an example of a rather natural essentially hereditarily undecidable theory strictly below. We discuss the (non-)interaction of essential hereditary undecidability with recursive boolean isomorphism. We develop a reduction relation essential tolerance, or, in (...) the converse direction, lax interpretability that interacts in a good way with essential hereditary undecidability. We introduce the class of $$\Sigma ^0_1$$ Σ 1 0 -friendly theories and show that $$\Sigma ^0_1$$ Σ 1 0 -friendliness is sufficient but not necessary for essential hereditary undecidability. Finally, we adapt an argument due to Pakhomov, Murwanashyaka and Visser to show that there is no interpretability minimal essentially hereditarily undecidable theory. (shrink)

This paper is concerned with the logical structure of arithmetical theories. We survey results concerning logics and admissible rules of constructive arithmetical theories. We prove a new theorem: the admissible propositional rules of Heyting Arithmetic are the same as the admissible propositional rules of Intuitionistic Propositional Logic. We provide some further insights concerning predicate logical admissible rules for arithmetical theories.

As computers became multi-component systems in the 1950s, handling the speed differentials efficiently was identified as a major challenge. The desire for better understanding and control of ‘concurrency’ spread into hardware, software, and formalism. This paper examines the way in which the problem emerged and was handled across various computing cultures from 1955 to 1985. In the machinic culture of the late 1950s, system programs called ‘monitors’ were used for directly managing synchronisation. Attempts to reframe synchronisation in the subsequent algorithmic (...) culture pushed the problem to a higher level of abstraction; Dijkstra’s semaphores were a reaction to the algorithms’ complexity. Towards the end of the 1960s, the culture of ‘structured programming’ created a milieu in which Dijkstra, Hoare, and Brinch Hansen (among others) aimed for a concurrency primitive which embodied the new view of programming. Via conditional critical regions and Dijkstra’s ‘secretaries’, the co-produced ‘monitor’ appeared to provide the desired encapsulation. The construct received embodiment in a few programming languages; this paper ends by considering Modula and Concurrent Pascal. (shrink)

"Something in between : on the nature of love" -- Love's blindness (1) : love's closed heart -- Love's blindness (2) : love's friendly eye -- Beyond comparison -- Commitments, values, and frameworks -- Valuing persons -- Love and morality -- Afterword. Between the universal and the particular.

In this paper, we characterize the strength of the predicative Frege hierarchy, , introduced by John Burgess in his book [J. Burgess, Fixing frege, in: Princeton Monographs in Philosophy, Princeton University Press, Princeton, 2005]. We show that and are mutually interpretable. It follows that is mutually interpretable with Q. This fact was proved earlier by Mihai Ganea in [M. Ganea, Burgess’ PV is Robinson’s Q, The Journal of Symbolic Logic 72 619–624] using a different proof. Another consequence of the our (...) main result is that is mutually interpretable with Kalmar Arithmetic . The fact that interprets EA was proved earlier by Burgess. We provide a different proof. Each of the theories is finitely axiomatizable. Our main result implies that the whole hierarchy taken together, , is not finitely axiomatizable. What is more: no theory that is mutually locally interpretable with is finitely axiomatizable. (shrink)

A theory T is trustworthy iff, whenever a theory U is interpretable in T, then it is faithfully interpretable. In this paper we give a characterization of trustworthiness. We provide a simple proof of Friedman’s Theorem that finitely axiomatized, sequential, consistent theories are trustworthy. We provide an example of a theory whose schematic predicate logic is complete Π20.

Attempts to capture the distinction between categorical and dispositional states in terms of more primitive modal notions – subjunctive conditionals, causal roles, or combinatorial principles – are bound to fail. Such failure is ensured by a deep symmetry in the ways dispositional and categorical states alike carry modal import. But the categorical/dispositional distinction should not be abandoned; it underpins important metaphysical disputes. Rather, it should be taken as a primitive, after which the doomed attempts at reductive explanation can be transformed (...) into circular but interesting accounts. (shrink)

The reason of faith -- Thought and language -- Truth -- The Monologion arguments for the existence of God -- The Proslogion argument for the existence of God -- The divine attributes -- Thinking and speaking about God -- Creation and the word -- The Trinity -- Modality -- Freedom -- Morality -- Incarnation and atonement -- Original sin, grace, and salvation.

In the past decade, the concept of recognition appears to have acquired an important theoretical position in the work and organization literature. While in principle recognition denotes a positive and social form of freedom, in current-day organizations recognition may be often negative or instrumental. In order to capture this ambivalence in organizational recognitive conditions, the recent work of the American philosopher Judith Butler appears particularly applicable. The purpose of this paper is to explore theoretically to what extent her views on (...) recognition shed new light on the variety of recognition patterns in current-day organizations. Towards that purpose, this paper first turns to the ‘master-slave’ episode in the work of Hegel and its influential interpretation by Kojève, which are at the heart of Butler’s reading and conception of recognition. As a second step, the ambivalent conception of recognition in the work of Butler is discussed and critically assessed, while in the final section this conception is extended to work and organizations. (shrink)

In his _Between Logic and the World_, in the course of presenting his theory of generics, Nickel (Between logic and the world, Oxford University Press, 2016) argues for a theory of characteristicness, or “genericity”, which states that a property is characteristic for a kind if and only if its presence among the members of that kind is explicable by some explanatory domain that recognizes the existence of that kind in the course of engaging the explanatory strategies made available by that (...) explanatory domain. I argue that this notion of genericity is too narrow, excluding properties characteristic for kinds that go unrecognized in such explanatory domains. In particular, Nickel’s theory excludes some characteristic properties of anthropic kinds, such as lilies and cedars, members of which have properties that may be similarly exploited in various human practices despite having divergent geneses. I argue for a generalization of Nickel’s view of genericity where explicability of presence is only one sort of genericity, with others, such as practicability, being possible too. (shrink)

There is a “Pragmatist turn” visible in the field of organization science today, resulting from a renewed interest in the work of Pragmatist philosophers like Dewey, Mead, Peirce, James and others, and in its implications for the study of organizations. Following Wicks and Freeman, in the past decade Pragmatism has also entered the field of business ethics, which, however, has not been uniformly applauded in that field. Some scholars fear that Pragmatism may enhance already existing positivist and managerialist tendencies in (...) current business ethics, while others see more emancipatory potential in Pragmatism, arguing that it complements and supports stakeholder theory. In this paper, a comparison of the philosophical underpinnings of Pragmatist and Critical conceptions of business ethics is offered, concentrating on the Pragmatism of John Dewey and the Critical theory of the Frankfurt School, in particular of Axel Honneth. It is argued that these two developed along two converging lines. Along the first line, Dewey was far more skeptical and critical of capitalism than is often thought. Along the second line, the reactions to Pragmatism of Frankfurt School Critical theorists developed over time from generally hostile, to partially inclusive, to more fully integrative. At the crossroads of these converging lines a Pragmatist Critical perspective is developed and exemplified, and its implications for business ethics are outlined. (shrink)

This paper contributes to debates regarding the normative justification of basic income (BI) via a critical reevaluation of Philippe Van Parijs’ ‘real-libertarian’ theory. Van Parijs’ work constitutes the most ambitious attempt within the literature to ground a justification of BI within a systematic normative framework. In this paper I argue that key elements of his framework should form part of any progressive justification of BI. Specifically, his linking of the principle of ‘real freedom for all’ with the policy mechanism of (...) the ‘highest sustainable basic income.’ I take issue with Van Parijs’ treatment of compensation for unequal internal endowments based on the criterion of ‘undominated diversity’ and I reject the ‘external resources’ approach to justifying the funding of a substantial BI, including Van Parijs’ ‘jobs as assets’ argument. I introduce the concept of ‘total social productivity’ as a means of understanding the production and reproduction of society in a manner that anchors the justification of BI in a commitment to a ‘deep form of social reciprocity.’ Finally, I suggest that BI be framed as a ‘pragmatic-utopian reform.’. (shrink)

This study explores models of how people perceive moral aspects of socio‐scientific issues. Thirty college students participated in interviews during which they discussed their reactions to and resolutions of two genetic engineering issues. The interview data were analyzed qualitatively to produce an emergent taxonomy of moral concerns recognized by the participant. The participants expressed sensitivity to moral aspects including concern and empathy for the well‐being of others, an aversion to altering the natural order and slippery slope implications. In arriving at (...) their final resolutions, many participants integrated their moral concerns with non‐moral factors. The patterns revealed suggest that moral and non‐moral concerns act in concert as they influence socio‐scientific decision‐making. (shrink)

This paper contains a careful derivation of principles of Interpretability Logic valid in extensions of I0+1.

In this note we compare propositional logics for closed substitutions and propositional logics for open substitutions in constructive arithmetical theories. We provide a strong example where these logics diverge in an essential way. We prove that for Markov's Arithmetic, that is, Heyting's Arithmetic plus Markov's principle plus Extended Church's Thesis, the logic of closed and the logic of open substitutions are the same.

Essays over het gedachtegoed van de Duitse filosoof (1844-1900).

In his paper "Undecidability without arithmetization," Andrzej Grzegorczyk introduces a theory of concatenation $\mathsf{TC}$. We show that pairing is not definable in $\mathsf{TC}$. We determine a reasonable extension of $\mathsf{TC}$ that is sequential, that is, has a good sequence coding.

In this paper we formulate a version of Second Incompleteness Theorem. The idea is that a sequential sentence has ‘consistency power’ over a theory if it enables us to construct a bounded interpretation of that theory. An interpretation of V in U is bounded if, for some n , all translations of V -sentences are U -provably equivalent to sentences of complexity less than n . We call a sequential sentence with consistency power over T a pro-consistency statement for T (...) . We study pro-consistency statements. We provide an example of a pro-consistency statement for a sequential sentence A that is weaker than an ordinary consistency statement for A . We show that, if A is $${{\sf S}^{1}_{2}}$$ , this sentence has some further appealing properties, specifically that it is an Orey sentence for EA . The basic ideas of the paper essentially involve sequential theories. We have a brief look at the wider environment of the results, to wit the case of theories with pairing. (shrink)

Benardete paradoxes involve infinite collections of Grim Reapers, assassins, demons, deafening peals, or even sentences. These paradoxes have recently been used in arguments for finitist metaphysical theses such as temporal finitism, causal finitism, and discrete views of time. Here we develop a new finite Benardete-like paradox. We then use this paradox to defend a companions in guilt argument that challenges recent applications of patchwork principles on behalf of the aforementioned finitist arguments. Finally, we develop another problem for those applications by (...) examining the notion of exact duplication. (shrink)