(1948). WAT BEHOORT TOT HET WEZEN VAN GODS HEILIGENDE GENADE-INWONING VOLGENS ST. THOMAS I SENT., DIST. XIV-XVIII EN XXXVII? Bijdragen: Vol. 9, No. 1, pp. 42-58.

Anthony Price's recent book presents a contextualist approach to practical rationality. Price develops his proposal in four chapters. In the first one , he outlines a contextual account of the validity of practical inferences. This chapter deals with logicism. Logicism assumes that ‘there is a form of rationality within practical thinking that connects with the logical validity of a practical entailment’ . Price argues that although the principles of logic are ‘invariant and universal’ , their relevance in evaluating a practical (...) inference is constrained by contextual factors related to the teleology of practical thinking and by the functional role of intentions in guiding our behaviour.In the second chapter , Price argues that the content of A's remark to B – ‘I must put in another 20p’, while both stand together on an underground platform in front of a dispenser – must be interpreted contextually, i.e. as referring to a particular end of A for which she needs to put in …. (shrink)

With the past and future tense propositional operators in its syntax, a formal logical system for sortal quantifiers, sortal identity and (second order) quantification over sortal concepts is formulated. A completeness proof for the system is constructed and its absolute consistency proved. The completeness proof is given relative to a notion of logical validity provided by an intensional semantic system, which assumes an approach to sortals from a modern form of conceptualism.

Work in the setting of the recursively enumerable sets and their Turing degrees. A set X is low if X', its Turning jump, is recursive in $\varnothing'$ and high if X' computes $\varnothing''$ . Attempting to find a property between being low and being recursive, Bickford and Mills produced the following definition. W is deep, if for each recursively enumerable set A, the jump of $A \bigoplus W$ is recursive in the jump of A. We prove that there are no (...) deep degrees other than the recursive one. Given a set W, we enumerate a set A and approximate its jump. The construction of A is governed by strategies, indexed by the Turning functionals Φ. Simplifying the situation, a typical strategy converts a failure to recursively compute W into a constraint on the enumeration of A, so that $(W \bigoplus A)'$ is forced to disagree with Φ(-; A'). The conversion has some ambiguity; in particular, A cannot be found uniformly from W. We also show that there is a "moderately" deep degree: There is a low nonzero degree whose join with any other low degree is not high. (shrink)

Descriptive encyclopaedia of Indic philosophy.