Choice and Logic

There is a little known paradox the solution to which is a guide to a much more thoroughgoing solution to a whole range of classic paradoxes. This is shown in this paper with respect to Berrys Paradox, Heterologicality, Russells Paradox, and the Paradox of Predication, also the Liar and the Strengthened Liar, using primarily the epsilon calculus. The solutions, however, show not only that the first-order predicate calculus derived from Frege is inadequate as a basis for a clear science, and should be replaced with Hilbert and Bernays conservative extension. Standard second-order logic, and quantified propositional logic also must be substantially modified, to incorporate, in the first place, nominalizations of predicates, and whole sentences. And further modifications must be made, so as to insist that predicates are parts of sentences rather than forms of them, and that truth is a property of propositions rather than their sentential expressions. In all, a thorough reworking of what has been called logic in recent years must be undertaken, to make it more fit for use.Portions of this paper have previously been published in Logical Studies, vol. 9, http://www.logic.ru/LogStud/09/No9-06.html, and the Australasian Journal of Logic, vol. 2, http://www.philosophy.unimelb.edu.au/ajl/2004/2004_4.pdf.     

The Pentus Theorem for Lambek Calculus with Simple Nonlogical Axioms

The Lambek calculus introduced in Lambek [6] is a strengthening of the type reduction calculus of Ajdukiewicz [1]. We study Associative Lambek Calculus L in Gentzen style axiomatization enriched with a finite set Γ of nonlogical axioms, denoted by L(Γ).It is known that finite axiomatic extensions of Associative Lambek Calculus generate all recursively enumerable languages (see Buszkowski [2]). Then we confine nonlogical axioms to sequents of the form p → q, where p and q are atomic types. For calculus L(Γ) we prove interpolation lemma (modifying the Roorda proof for L [10]) and the binary reduction lemma (using the Pentus method [9] with modification from [3]). In consequence we obtain the weak equivalence of the Context-Free Grammars and grammars based on L(Γ).     

Number of Extensions of Non-Fregean Logics

We show that there are continuum many different extensions of SCI (the basic theory of non-Fregean propositional logic) that lie below WF (the Fregean extension) and are closed under substitution. Moreover, continuum many of them are independent from WB (the Boolean extension), continuum many lie above WB and are independent from WH (the Boolean extension with only two values for the equality relation), and only countably many lie between WH and WF.     

从道德本位到权利本位的转换——梁启超《新民说》审视

梁启超《新民说》是对以《大学》为代表的中国传统“新民”思想的改造和发展。他以民权、独立、自由的资产阶级“公德”代替以伦理道德为核心的封建主义的“私德” ,用中西文化中的优秀道德传统构建新国民 ,实现了从以伦理道德为本位的旧道德向以权利为本位的新道德的转换 ,“旧国民”向“新国民”的转换。     

Discovery algorithms for hierarchical relations

Two algorithms based on a latent class model are presented for discovering hierarchical relations that exist among a set ofK dichotomous items. The two algorithms, stepwise forward selection and backward elimination, incorporate statistical criteria for selecting (or deleting) 0–1 response pattern vectors to form the subset of the total possible 2 ^k vectors that uniquely describe the hierarchy. The performances of the algorithms are compared, using computer-constructed data, with those of three competing deterministic approaches based on ordering theory and the calculation of Phi/Phi-max coefficients. The discovery algorithms are also demonstrated on real data sets investigated in the literature.     

Probability: A new logico-semantical approach

This approach does not define a probability measure by syntactical structures. It reveals a link between modal logic and mathematical probability theory. This is shown (1) by adding an operator (and two further connectives and constants) to a system of lower predicate calculus and (2) regarding the models of that extended system. These models are models of the modal systemS ₅ (without the Barcan formula), where a usual probability measure is defined on their set of possible worlds. Mathematical probability models can be seen as models ofS ₅.     

The relative sensitivities of same-different and identification judgment models to perceptual dependence

Probabilistic models of same-different and identification judgments are compared (within each paradigm) with regard to their sensitivity to perceptual dependence or the degree to which the underlying psychological dimensions are correlated. Three same-different judgment models are compared. One is a step function or decision bound model and the other two are probabilistic variants of a similarity model proposed by Shepard. Three types of identification models are compared: decision bound models, a probabilistic multidimensional scaling model, and probabilistic models based on the Shepard-Luce choice rule. The decision bound models were found to be most sensitive to perceptual dependence, especially when there is considerable distributional overlap. The same-different model based on the city-block metric and an exponential decay similarity function, and the corresponding identification model were found to be particularly insensitive to perceptual dependence. These results suggest that if a Shepard-type similarity function accurately describes behavior, then under typical experimental conditions it should be difficult to see the effects of perceptual dependence. This result provides strong support for a perceptualindependence assumption when using these models. These theoretical results may also play an important role in studying different decision rules employed at different stages of identification training.We thank Robert Melara, Jerome Busemeyer and three anonymous reviewers for comments on an earlier draft of this paper.