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

Low birth weight, intrauterine growth retardation, and prematurity are overwhelming risk factors associated with infant mortality and morbidity. The lack of efficacious prenatal screening tests for these three outcomes illuminates the problems inherent in bivariate estimates of association. A biocultural strategy for research is presented, integrating societal and familial levels of analysis with the metabolic, immune, vascular, and neuroendocrine systems of the body. Policy decisions, it is argued, need to be based on this type of biocultural information in order to (...) impact the difficult-to-change problems of low birth weight, intrauterine growth retardation, and prematurity. (shrink)

People often say that romantic love should be unconditional, and they often want romantic love to last forever. These claims and desires are presumably linked: part of the reason it would be good for love to be unconditional is that it is assumed that such love, being detached from changing conditions, would last forever. This article argues that there are, indeed, kinds of unconditional and permanent love that are worth wanting, but also kinds that are not, and attempts to clarify (...) just what it is that is valuable about these kinds of romantic love. (shrink)

This paper studies a propositional logic which is obtained by interpreting implication as formal provability. It is also the logic of finite irreflexive Kripke Models.A Kripke Model completeness theorem is given and several completeness theorems for interpretations into Provability Logic and Peano Arithmetic.

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.

Argument schemes are abstractions substantiating the inferential connection between premise(s) and conclusion in argumentative communication. Identifying such conventional patterns of reasoning is essential to the interpretation and evaluation of argumentation. Whether studying argumentation from a theory-driven or data-driven perspective, insight into the actual use of argumentation in communicative practice is essential. Large and reliably annotated corpora of argumentative discourse to quantitatively provide such insight are few and far between. This is all the more true for argument scheme corpora, which tend (...) to suffer from a combination of limited size, poor validation, and the use of ad hoc restricted typologies. In the current paper, we describe the annotation of schemes on the basis of two distinct classifications: Walton’s taxonomy of argument schemes, and Wagemans’ Periodic Table of Arguments. We describe the annotation procedure for each, and the quantitative characteristics of the resulting annotated text corpora. In doing so, we extend the annotation of the preexisting US2016 corpus of televised election debates, resulting in, to the best of our knowledge, the two largest consistently annotated corpora of schemes in argumentative dialogue publicly available. Based on evaluation in terms of inter-annotator agreement, we propose further improvements to the guidelines for annotating schemes: the argument scheme key, and the Argument Type Identification Procedure. (shrink)

In the spring of 2005, the Portuguese government passed legislation paving the way for all residents to contribute their DNA to a national database to be used for medical and forensic purposes. There was no significant opposition. In sharp contrast, the United States will experience a contentious debate with strong opposition from many groups if and when such a law is proposed. Some of the reasons have to do with a history of sharply different experiences with, and trust of, the (...) criminal justice system. (shrink)

In this paper we study proofs of some general forms of the Second Incompleteness Theorem. These forms conform to the Feferman format, where the proof predicate is fixed and the representation of the set of axioms varies. We extend the Feferman framework in one important point: we allow the interpretation of number theory to vary.

"Dying in the City of Blues: Sickle Cell Anemia and the Politics of Race and Health" by Keith Wailoo is reviewed.

In this paper we examine various requirements on the formalisation choices under which self-reference can be adequately formalised in arithmetic. In particular, we study self-referential numberings, which immediately provide a strong notion of self-reference even for expressively weak languages. The results of this paper suggest that the question whether truly self-referential reasoning can be formalised in arithmetic is more sensitive to the underlying coding apparatus than usually believed. As a case study, we show how this sensitivity affects the formal study (...) of certain principles of self-referential truth. (shrink)

Nathan Salmon, in his paper Trans-World Identification and Stipulation (1996) purports to give a proof for the claim that facts concerning trans-world identity cannot be conceptually reduced to general facts. He calls this claim ‘Extreme Haecceitism.’ I argue that his proof is fallacious. However, I also contend that the analysis and ultimate rejection of his proof clarifies the fundamental issues that are at stake in the debate between the reductionist and haecceitist solutions to the problem of trans-world identity. These issues (...) hinge on the ability of modal logic and possible worlds semantics to draw a hard and fast distinction between the logic and the metaphysics of modal logic. I shall claim that the considerations in this paper call into question the viability of such a distinction. (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.

In this essay Troy Richardson works to develop a conceptual framework and set of terms by which a diplomatic reception of different forms of law can be developed in multicultural education. Taking up the trope of the door in multiculturalist discourse as a site in which a welcoming of the difference of others is organized, Richardson interrogates the complex nature of receptivity to Indigenous customary law, in particular. He argues that, within this trope, a metonymic structure operates in relation (...) to the deployment of “policy” that maintains a perspective of customary law as premodern and primitive. This structure leads to an impoverished set of terms and a lack of diplomacy toward difference. Richardson proceeds by considering the notion of extraterritoriality and the metonyms that organize Emmanuel Levinas's discourse of “doors” in conceptualizing a welcoming receptivity. The term “extraterritoriality” anticipates the law of the other as it approaches the door and implies a diplomatic moment of reception of such difference. Richardson concludes by highlighting Jacques Derrida's evaluation of Levinas's discourse of receptivity and by considering the possibilities for a diplomatic engagement with the laws of others toward a mutation in the current geopolitical moment. (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 I shall attempt to argue for the simple view of personal identity. I shall first argue that we often do have warrant for our beliefs that we exist as continuing subjects of experience, and that these beliefs are justified independently of any reductionist analysis of what it means to be a person. This has two important implications that are relevant to the ongoing debate concerning the number of persons that are in existence throughout any duration in time: (...) (1) the lack of logically or metaphysically necessary and sufficient conditions for distinguishing one person from another should imply neither that there is only one person nor that personhood is not individuative; and (2) the lack of such universally applicable identity criteria should not imply that the term ‘person’ is a folk term with no real application. In other words, lack of reductionist analysis does not entail lack of existence. (shrink)

In this note we derive Robinson???s Arithmetic from Hume???s Principle in the context of very weak theories of classes and relations.

The central result of this paper is the small‐is‐very‐small principle for restricted sequential theories. The principle says roughly that whenever the given theory shows that a definable property has a small witness, i.e., a witness in a sufficiently small definable cut, then it shows that the property has a very small witness: i.e., a witness below a given standard number. Which cuts are sufficiently small will depend on the complexity of the formula defining the property. We draw various consequences from (...) the central result. E.g., roughly speaking, (i) every restricted, recursively enumerable sequential theory has a finitely axiomatized extension that is conservative with respect to formulas of complexity ; (ii) every sequential model has, for any n, an extension that is elementary for formulas of complexity, in which the intersection of all definable cuts is the natural numbers; (iii) we have reflection for ‐sentences with sufficiently small witness in any consistent restricted theory U; (iv) suppose U is recursively enumerable and sequential. Suppose further that every recursively enumerable and sequential V that locally inteprets U, globally interprets U. Then, U is mutually globally interpretable with a finitely axiomatized sequential theory. The paper contains some careful groundwork developing partial satisfaction predicates in sequential theories for the complexity measure depth of quantifier alternations. (shrink)

In this paper we introduce a notion of context for Groenendijk & Stokhof's Dynamic Predicate Logic DPL. We use these contexts to give a characterization of the relations on assignments that can be generated by composition from tests and random resettings in the case that we are working over an infinite domain. These relations are precisely the ones expressible in DPL if we allow ourselves arbitrary tests as a starting point. We discuss some possible extensions of DPL and the way (...) these extensions interact with our notion of context. (shrink)

There is a growing interest in how people conceptualise the legal domain for the purpose of legal knowledge systems. In this paper we discuss four such conceptualisations (referred to as ontologies): McCarty's language for legal discourse, Stamper's norma formalism, Valente's functional ontology of law, and the ontology of Van Kralingen and Visser. We present criteria for a comparison of the ontologies and discuss the strengths and weaknesses of the ontologies in relation to these criteria. Moreover, we critically review the (...) criteria. (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)

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)

In his 1967 paper Vaught used an ingenious argument to show that every recursively enumerable first order theory that directly interprets the weak system VS of set theory is axiomatizable by a scheme. In this paper we establish a strengthening of Vaught's theorem by weakening the hypothesis of direct interpretability of VS to direct interpretability of the finitely axiomatized fragment VS2 of VS. This improvement significantly increases the scope of the original result, since VS is essentially undecidable, but VS2 has (...) decidable extensions. We also explore the ramifications of our work on finite axiomatizability of schemes in the presence of suitable comprehension principles. (shrink)

In this paper a dialogue game for critical discussion is developed. The dialogue game is a formalisation of the ideal discussion model that is central to the pragma-dialectical theory of argumentation. The formalisation is intended as a preparatory step to facilitate the development of computational tools to support the pragma-dialectical study of argumentation. An important dimension of the pragma-dialectical discussion model is the role played by speech acts. The central issue addressed in this paper is how the speech act perspective (...) can be accommodated in the formalisation as a dialogue game. The starting point is an existing ‘basic’ dialogue game for critical discussion, in which speech acts are not addressed. The speech act perspective is introduced into the dialogue game by changing the rules that govern the moves that can be made and the commitments that these result in, while the rules for the beginning, for the end, and for the structure of the dialogue game remain unchanged. The revision of the move rules is based on the distribution of speech acts in the pragma-dialectical discussion model. The revision of the commitment rules is based on the felicity conditions that are associated with those speech acts. (shrink)

In this paper I give a characterization of the closed fragment of the provability logic of $I \triangle_0 + \mathrm{EXP}$ with a propositional constant for $\mathrm{EXP}$. In three appendices many details on arithmetization are provided.