On Toleration,Charity, and Epistemic Fallibilism

In this paper I examine some presuppositions of toleration and pluralism and explore two models, viz., a deontological and a consequentialist model, respectively, which could support the view that rational agents should act in a tolerant way. Against the background which is offered by the first model, I give two arguments in favor of the view that people are better off and more rational if they act in a tolerant way. The first argument draws upon a principle of charity which is usually applied in philosophy of mind and philosophy of language, but which could, equally well, work with regard to foundational issues in ethics and philosophy of action. The second argument is built upon the epistemic principle of fallibilism and it is meant to show that acting in a tolerant way is the rational thing to do from this perspective.     

THE PARADOXICAL RELATIONSHIP BETWEEN MORALITY AND MORAL WORTH

Abstract: If the social environment were arranged so that most people in the West could, with relatively little effort, be morally good to a reasonable degree, would this be a good thing? I claim that it is not entirely obvious that we should say yes. This is no idle question: mainstream Western social morality today seems to be approaching the prospect for a morality that is not taxing. This question has substantial theoretical interest because exploring it will help us understand the paradoxical relationship between morality and moral worth.     

Computer Implication and the Curry Paradox

There are theoretical limitations to what can be implemented by a computer program. In this paper we are concerned with a limitation on the strength of computer implemented deduction. We use a version of the Curry paradox to arrive at this limitation.     

In Defence of the Open Question Argument

The purpose of this paper is to defend G. E. Moore's open question argument, understood as an argument directed against analytic reductionism, the view that moral properties are analytically reducible to non-moral properties. In the first section I revise Moore's argument in order to make it as plausible and resistant against objections as possible. In the following two sections I develop the argument further and defend it against the most prominent objections raised against it. The conclusion of my line of reasoning is that the open question argument offers the best explanation of our responses to the questions put in the argument, namely that analytic reductionism is mistaken. This revised version was published online in August 2006 with corrections to the Cover Date.     

从混沌角度浅谈凋亡悖论

细胞凋亡是生命科学研究的热点之一,随着近年来研究的愈加深入,新的发现对传统凋亡机制及观念提出了挑战,凋亡悖论应运而生。凋亡悖论的提出是一个值得深入探讨的哲学问题,表明需要对当前科学研究中的还原论方法和线性思维方式进行深刻反思,这提示对于生命现象这类复杂系统科学研究需要混沌思维。     

教条悖论：行为心理学家的新挑战

在各种专业或私人情境中, 人们经常需要整合不同的意见来判断某一观点的对错。当观点的形式类似于将多个论点组合而成的逻辑公式(使用“且”、“或”等逻辑连接词)时, 容易产生教条悖论(doctrinal paradox)。即, 虽然整体意见支持该观点是正确的(或错误的), 但是分析这些整体意见中所包含的各个论点, 却会得到相反的结论。教条悖论是判断整合研究中关注的重要问题, 已在各科学领域引发大量的规范性研究。行为心理学家需在这个重要问题上开展系统研究。本文简要介绍了教条悖论及其过往研究, 总结已有的行为数据, 并指出未来行为研究的方向和视角。     

Numeral Classifiers and the White Horse Paradox

This paper presents an interpretation of Gongsun Long＇s white horse paradox. The Chinese sentence he uses to state his main thesis （Bai ma fei ma） has two potential readings： （a） The white horses are not horses. （b） The white horses are not the horses Although （a） gives the usual and correct reading of the sentence, according to the interpretation, Gongsun Long takes it to state （b）. He gives good arguments for （b） while taking them to establish （a） as well, for he fails to distinguish between the two different theses. In presenting this interpretation, the paper gives an account of the function of numeral classifiers and discusses the semantics of count nouns in languages with no grammatical number system, including classical Chinese and classifier languages （e.g., contemporary Chinese）.     

Abstraction in Algorithmic Logic

We develop a functional abstraction principle for the type-free algorithmic logic introduced in our earlier work. Our approach is based on the standard combinators but is supplemented by the novel use of evaluation trees. Then we show that the abstraction principle leads to a Curry fixed point, a statement C that asserts C ⇒ A where A is any given statement. When A is false, such a C yields a paradoxical situation. As discussed in our earlier work, this situation leaves one no choice but to restrict the use of a certain class of implicational rules including modus ponens.     

A Note on Priest's Finite Inconsistent Arithmetics

We give a complete characterization of Priest's Finite Inconsistent Arithmetics observing that his original putative characterization included arithmetics which cannot in fact be realized.