Dimensions of Modernity and Their Contemporary Fate

Modernity, a focal point of interest in our time, means the cultural schemata and mechanisms of social action stemming from the Enlightenment and the modernization process. It is a set of new and “man-made” rationalized mechanisms and rules for human societies that naturally grow beyond geographical boundaries. The interrelated dimensions of modernity may be roughly grouped into “intellectual” and “institutional” categories including subjectivity and individual self-consciousness, a spirit of rationalized and contracting public culture, modernity in sociohistorical narratives as an ideology, rationalization of economic operations, bureaucracy in administrative management, autonomy of the public sphere, and the democratization and contraction of public power. Modernity is inherently contradictory and risky, yet until now there has been no sign of an end in sight. It remains to be the major support and dynamic in keeping human society running. Let us beware of superficial judgment when reflecting upon theoretical critiques of modernity and try to grasp the great challenges and opportunities of globalization—essentially a process of modernity. Translated by Fan Lingmei, from Zhongguo shehui kexue, 2004:4     

Against One Form of Judgment-Determinism

Taking 'rationalized judgments' to be those formed by inference from other judgments, I argue against 'Extreme Determinism': the thesis that theoretical rationalization just is a kind of predetermination of 'conclusion-judgments' by 'premise-judgments'. The argument rests upon two key lemmas: firstly, that a deliberator - in this case, his/her assent to some proposition - to be predetermined (I call this the 'Openness Requirement'): secondly, that a subject's logical insight into his/her premise-judgments must enter into the explanation of any judgment s/he forms that is rationalized by those judgments. My contention is that, given the Openness Requirement, no version of Extreme Determinsim can allow for the role played by logical insight in the rationalization of judgment. I end by indicating briefly how this result might figure in a wider argument against any form of determinism about rationalized judgment, and by explaining why I have focused specifically upon rebutting a deterministic view of theoretical as opposed to 'practical' rationalization.     

Foundational belief change

This paper is concerned with the construction of a base contraction (revision) operation such that the theory contraction (revision) operation generated by it will be fully AGM-rational. It is shown that the theory contraction operation generated by Fuhrmann'sminimal base contraction operation, even under quite strong restrictions, fails to satisfy the supplementary postulates of belief contraction. Finally Fuhrmann's construction is appropriately modified so as to yield the desired properties. The new construction may be described as involving a modification of safe (base) contraction so as to make it maxichoice.     

The worthless remains of a physician’s calling: Max Weber,William Osler,and the last virtue of physicians

On the centenary of Max Weber’s “Science as a Vocation,” his essay still performs interpretative work. In it, Weber argues that the vocation of a scientist is to produce specialized, rationalized knowledge that will be superseded. Weber says this vocation is a rationalized version of the Protestant conception of calling or vocation (Beruf), tragically disenchanting the world and leaving the idea of calling as a worthless remains (caput mortuum). A similar trajectory can be seen in the physician William Osler’s writings, especially his essay “Internal Medicine as a Vocation,” in which the calling of a physician is described as both rational and noble. While Osler’s conception of the physician’s vocation has been formative for contemporary medicine, physicians are reporting burnout and leaving medical practice at escalating rates. As physicians abandon their noble vocations, an alternative conception of a physician’s vocation is needed. From the worthless remains of the physician’s rational and noble vocation, the labor of a physician can find grounding in humility.     

Multiple and iterated contraction reduced to single-step single-sentence contraction

Multiple contraction (simultaneous contraction by several sentences) and iterated contraction are investigated in the framework of specified meet contraction (s.m.c.) that is extended for this purpose. Multiple contraction is axiomatized, and so is finitely multiple contraction (contraction by a finite set of sentences). Two ways to reduce finitely multiple contraction to contraction by single sentences are introduced. The reduced operations are axiomatically characterized and their properties are investigated. Furthermore, it is shown how iterated contraction can be reduced to single-step, single-sentence contraction. However, in this framework the outcome of iterated contraction depends unavoidably on the order in which the inputs are received. This order-dependence makes it impossible to treat two inputs on an equal footing. Therefore it is often preferable to perform changes involving several pieces of information as multiple rather than iterated change.     

Replacement—A Sheffer Stroke for Belief Change

By replacement is meant an operation that replaces one sentence by another in a belief set. Replacement can be used as a kind of Sheffer stroke for belief change, since contraction, revision, and expansion can all be defined in terms of it. Replacement can also be defined either in terms of contraction or in terms of revision. Close connections are shown to hold between axioms for replacement and axioms for contraction and revision. Partial meet replacement is axiomatically characterized. It is shown that this operation can have outcomes that are not obtainable through either partial meet contraction or partial meet revision.     

Individual differences in motivated social cognition: the case of self-serving information processing

Three experiments examined the hypothesis that people show consistency in motivated social cognitive processing across self-serving domains. Consistent with this hypothesis, Experiment 1 revealed that people who rated a task at which they succeeded as more important than a task at which they failed also cheated on a series of math problems, but only when they could rationalize their cheating as unintentional. Experiment 2 replicated this finding and demonstrated that a self-report measure of self-deception did not predict this rationalized cheating. Experiment 3 replicated Experiments 1 and 2 and ruled out several alternative explanations. These experiments suggest that people who show motivated processing in ego-protective domains also show motivated processing in extrinsic domains. These experiments also introduce a new measurement procedure for differentiating between intentional versus rationalized cheating.     

Inter-Definability of Horn Contraction and Horn Revision

There have been a number of publications in recent years on generalising the AGM paradigm to the Horn fragment of propositional logic. Most of them focused on adapting AGM contraction and revision to the Horn setting. It remains an open question whether the adapted Horn contraction and Horn revision are inter-definable as in the AGM case through the Levi and Harper identities. In this paper, we give a positive answer by providing methods for generating contraction and revision from their dual operations. Noticeably, we cannot apply the Levi and Harper identities directly in such methods as the Horn fragment does not fully support negation. To overcome this difficulty, a Horn approximation technique called Horn strengthening is used. We show that Horn contraction generated from Horn revision is always plausible whereas Horn revision generated from Horn contraction is, in general, implausible and, to regain plausibility, the generating contraction has to be properly restricted.     

Maximal and perimaximal contraction

Generalizations of partial meet contraction are introduced that start out from the observation that only some of the logically closed subsets of the original belief set are at all viable as contraction outcomes. Belief contraction should proceed by selection among these viable options. Several contraction operators that are based on such selection mechanisms are introduced and then axiomatically characterized. These constructions are more general than the belief base approach. It is shown that partial meet contraction is exactly characterized by adding to one of these constructions the condition that all logically closed subsets of the belief set can be obtained as the outcome of a single (multiple) contraction. Examples are provided showing the counter-intuitive consequences of that condition, thus confirming the credibility of the proposed generalization of the AGM framework.     

Specified Meet Contraction

Specified meet contraction is the operation ?\div defined by the identity K ?p = K   ~  f(p)K \div p = K \,{\sim}\, f(p) where ∼ is full meet contraction and f is a sentential selector, a function from sentences to sentences. With suitable conditions on the sentential selector, specified meet contraction coincides with the partial meet contractions that yield a finite-based contraction outcome if the original belief set is finite-based. In terms of cognitive realism, specified meet contraction has an advantage over partial meet contraction in that the selection mechanism operates on sentences rather than on temporary infinite structures (remainders) that are cognitively inaccessible. Specified meet contraction provides a versatile framework in which other types of contraction, such as severe withdrawal and base-generated contraction, can be expressed with suitably chosen properties of the sentential selector.     

Maps between some different kinds of contraction function: The finite case

In some recent papers, the authors and Peter Gärdenfors have defined and studied two different kinds of formal operation, conceived as possible representations of the intuitive process of contracting a theory to eliminate a proposition. These are partial meet contraction (including as limiting cases full meet contraction and maxichoice contraction) and safe contraction. It is known, via the representation theorem for the former, that every safe contraction operation over a theory is a partial meet contraction over that theory. The purpose of the present paper is to study the relationship more finely, by seeking an explicit map between the component orderings involved in each of the two kinds of contraction. It is shown that at least in the finite case a suitable map exists, with the consequence that the relational, transitively relational, and antisymmetrically relational partial meet contraction functions form identifiable subclasses of the safe contraction functions, over any theory finite modulo logical equivalence. In the process of constructing the map, as the composition of four simple transformations, mediating notions of bottom and top contraction are introduced. The study of the infinite case remains open.     

Comparative Possibility in Set Contraction

In a recent article, Zhang and Foo generalized the AGM postulates for contraction to include infinite epistemic input. The new type of belief change is called set contraction. Zhang and Foo also introduced a constructive model for set contraction, called nicely ordered partition, as a generalization of epistemic entrenchment. It was shown however that the functions induced from nicely ordered partitions do not quite match the postulates for set contraction. The mismatch was fixed with the introduction of an extra condition called the limit postulate. The limit postulate establishes a connection between contraction by infinite epistemic input and contraction by finite epistemic input (reducing the former to the latter) and it is appealing both on mathematical and on conceptual grounds. It is debatable however whether the limit postulate can be adopted as a general feature of rationality in set contraction. Instead we propose that the limit postulate is viewed as a condition characterizing an important special case of set contraction functions. With this reading in mind, in this article we introduce an alternative generalization of epistemic entrenchment, based on the notion of comparative possibility. We prove that the functions induced from comparative possibility preorders precisely match those satisfying the postulates for set contraction (without the limit postulate). The relationship between comparative possibility and epistemic entrenchment is also investigated. Finally, we formulate necessary and sufficient conditions under which the functions induced from comparative possibility preorders coincide with the special class of contraction functions characterized by the limit postulate.     

Eligible Contraction

When a belief set is contracted only some beliefs are eligible for removal. By introducing eligibility for removal as a new semantic primitive for contraction and combining it with epistemic entrenchment we get a contraction operator with a number of interesting properties. By placing some minimal constraint upon eligibility we get an explicit contraction recipe that exactly characterises the so called interpolation thesis, a thesis that states upper and lower bounds for the amount of information to be given up in contraction. As a result we drop the controversial property of recovery. By placing additional constraints on eligibility we get representation theorems for a number of contraction operators of varying strength. In addition it is shown that recovery contraction is a special case that we get if eligibility is explicitly constructed in terms of logical relevance. This revised version was published online in August 2006 with corrections to the Cover Date.     

Effort in isometric muscular contractions related to force level and duration

The degree of perceived force involved in squeezing a handgrip dynamometer is shown to grow as a power function of the force of isometric contraction and also as a power function of the duration of the squeeze. The exponent for force turns out to be more than twice that for duration. These two power functions are able to predict measurements of muscle endurance, i.e., of the maximum length of time that contraction of any constant level of force can be sustained.     

An alternative view of the concept of utilisation of elastic energy in human movement

It is widely accepted that the series elastic component (SEC) of muscles and tendons plays an important role in dynamic human movements. Many experiments seem to show that during a pre-stretch movement energy can be stored in the SEC which is re-used during the subsequent concentric contraction. Mechanical calculations were performed to calculate the capacity for muscles and tendons to store elastic energy. The storage of elastic energy in muscle tissue appears to be negligible. In tendons some energy can be stored but the total elastic capacity of the tendons of the lower extremities appears far too small to explain reported advantages of a pre-stretch during jumping and running.Based on literature concerning chemical change and enthalpy production during experiments on isolated muscles, a model is proposed which can explain the advantages of a preliminary counter movement on force and work output during the subsequent concentric contraction. The main advantage of a pre-stretch, as seen in movements like jumping, throwing and running, seems to be to prevent a waste of cross bridges at the onset of a contraction in taking up the slack of the muscle. The model can explain why the mechanical efficiency in running can be much higher than in cycling. A muscle which is stretched prior to concentric contraction can do more work at the same metabolic cost when compared with a concentric contraction without pre-stretch.     

Bootstrap Contraction

We can often specify how we would contract by a certain sentence by saying that this contraction would coincide with some other contraction that we know how to perform. We can for instance clarify that our contraction by p&q would coincide with our contraction by p, or by q, or by {p, q}. In a framework where the set of potential outcomes is known, some contractions are “self-evident” in the sense that there is only one serious candidate that can be the outcome of such a contraction. Contraction by a specific contractee (sentence or set of sentences to be contracted) is bootstrapped if it is specified by saying that it coincides with some such self-evident contraction. For a wide range of (multiple) contraction operators, contractions by any contractee can be bootstrapped. This means that the selection mechanism (selection function, incision function, etc.) can be replaced by a function called a bootstrapping selector that assigns to each contractee some “self-evident” contractee that yields the same outcome. With bootstrapping we can eliminate traditional extralogical components in contraction (e.g., selection functions) and replace them by bootstrapping selectors that reflect more closely the ways in which we actually reason and argue about belief contraction.     

Latency of saccadic eye movement during contraction of bilateral and unilateral shoulder girdle elevators

We compared the timed latencies of saccadic eye movement during isometric contraction of the bilateral and unilateral shoulder girdle elevators in a sitting posture. Muscle contraction force was increased in 10% increments from 0% to 60% of the maximal voluntary contraction (MVC) of each side. Saccadic latency was measured as the latency to the beginning of eye movement toward the lateral target that was moved at random intervals in 20 degree amplitude jumps. Eye movement was measured using the electro-oculogram technique. During bilateral contraction, saccadic latency decreased until 30% MVC and then began to increase at 40% MVC. During unilateral contraction, saccadic latency decreased until 30% MVC in a similar pattern as in bilateral condition, was constant from 30% MVC to 50% MVC, followed by a slight increase at 60% MVC. The saccadic latencies at 10% and 40-60% MVC were significantly shorter during unilateral contraction than bilateral contraction. Thus, the relative force for producing a marked shortening of saccadic latency is observed within a wider range during unilateral contraction than bilateral contraction.     

Eradication

Eradication is a radical form of contraction that removes not only a sentence but also all of its non-tautological consequences from a belief set. Eradication of a single sentence that was included in the original belief set coincides with full meet contraction, but if the sentence is external to the belief set then the two operations differ. Multiple eradication, i.e. simultaneous eradication of several sentences, differs from full meet contraction even if the sentences to be contracted are all included in the original belief set. Eradication is axiomatically characterized and its properties investigated. It is shown to have close connections with the recovery postulate for multiple contraction. Based on these connections it is proposed that eradication rather than full meet contraction is the appropriate lower limiting case for multiple contraction operators.     

Preference-based belief revision for rule-based agents

Agents which perform inferences on the basis of unreliable information need an ability to revise their beliefs if they discover an inconsistency. Such a belief revision algorithm ideally should be rational, should respect any preference ordering over the agent’s beliefs (removing less preferred beliefs where possible) and should be fast. However, while standard approaches to rational belief revision for classical reasoners allow preferences to be taken into account, they typically have quite high complexity. In this paper, we consider belief revision for agents which reason in a simpler logic than full first-order logic, namely rule-based reasoners. We show that it is possible to define a contraction operation for rule-based reasoners, which we call McAllester contraction, which satisfies all the basic Alchourrón, Gärdenfors and Makinson (AGM) postulates for contraction (apart from the recovery postulate) and at the same time can be computed in polynomial time. We prove a representation theorem for McAllester contraction with respect to the basic AGM postulates (minus recovery), and two additional postulates. We then show that our contraction operation removes a set of beliefs which is least preferred, with respect to a natural interpretation of preference. Finally, we show how McAllester contraction can be used to define a revision operation which is also polynomial time, and prove a representation theorem for the revision operation.     

The contraction rule and decision problems for logics without structural rules

This paper shows a role of the contraction rule in decision problems for the logics weaker than the intuitionistic logic that are obtained by deleting some or all of structural rules. It is well-known that for such a predicate logic L, if L does not have the contraction rule then it is decidable. In this paper, it will be shown first that the predicate logic FL_ec with the contraction and exchange rules, but without the weakening rule, is undecidable while the propositional fragment of FL_ec is decidable. On the other hand, it will be remarked that logics without the contraction rule are still decidable, if our language contains function symbols.