On Łukasiewicz-Moisil algebras of fuzzy sets

The set (X, J) of fuzzy subsetsf:XJ of a setX can be equipped with a structure of -valued ukasiewicz-Moisil algebra, where is the order type of the totally ordered setJ. Conversely, every ukasiewicz-Moisil algebra — and in particular every Post algebra — is isomorphic to a subalgebra of an algebra of the form (X, J), whereJ has an order type . The first result of this paper is a characterization of those -valued ukasiewicz-Moisil algebras which are isomorphic to an algebra of the form (X, J) (Theorem 1). Then we prove that (X, J) is a Post algebra if and only if the setJ is dually well-ordered (Theorem 2) and we give a characterization of those -valued Post algebras with are isomorphic to an algebra of the form (X, J) (Theorem 3 and Proposition 2).     

Two-group classification in latent trait theory: Scores with monotone likelihood ratio

This paper deals with two-group classification when a unidimensional latent trait,, is appropriate for explaining the data,X. It is shown that ifX has monotone likelihood ratio then optimal allocation rules can be based on its magnitude when allocation must be made to one of two groups related to. These groups may relate to probabilistically via a non-decreasing functionp(), or may be defined by all subjects above or below a selected value on.In the case where the data arise from dichotomous items, then only the assumption that the items have nondecreasing item characteristic functions is enough to ensure that the unweighted sum of responses (the number-right score or raw score) possesses this fundamental monotone likelihood ratio property.     

A central limit theorem for families of stochastic processes indexed by a small average step size parameter,and some applications to learning models

Let > 0 be a measure of the average step size of a stochastic process {p _n ⁽⁾ } _n=1 ⁽⁾. Conditions are given under whichp _n ⁽⁾ is approximately normally distributed whenn is large and is small. This result is applied to a number of learning models where is a learning rate parameter andp _n ⁽⁾ is the probability that the subject makes a certain response on thenth experimental trial. Both linear and stimulus sampling models are considered.     

Iconic memory — an artifact of perceptual reconstruction processes?

Summary Two experiments, using a partial vs. whole report procedure to isolate iconic from short-term memory loss, are reported. In the first experiment 10 Ss had to judge the difference between two line lengths in a display of three pairs of lines (in rows). Results showed no significant variation in d' with cue delay in spite of a medium overall performance, and in contrast to preliminary partial/whole report experiments. To counter the possibility that the short-term memory load was too small in this experiment, a second experiment was performed with displays containing nine instead of three pairs, i.e., three pairs per row. Equivalence of performance for all conditions was about the same as before. This was true for both hit- and false-alarm rates. The results are interpreted as evidence against the view of iconic memory as a high capacity store containing a lot of information. An alternative reconstructive theory is put forward to explain both conventional iconic loss and our results. According to this account, partial report measures processed material rather than reflecting an iconic store of uninterpreted sensory events. Some consequences of this model are discussed in the context of some weak effects in our data; and suggestions are put forward for further investigation of visual processing.The experiments to be reported here were made possible by grant Schu 421/1–2 of the Deutsche Forschungsgemeinschaft. The main results of Experiment II have already been reported at the European Conference on Visual Perception at Nordwijkerhout, October 1979. I am indebted to Mrs. R. Ledebur, cand. phil, and Dipl.-Psych. G. Gros who collected the data. I also wish to thank Dr. A. Reeves (Dortmund) for helpful comments on an earlier version of this paper. Dr. P. Wolff (Osnabrück) and two anonymous reviewers contributed valuable suggestions concerning the final draft     

Function identification from noisy data with recursive error bounds

New success criteria of inductive inference in computational learning theory are introduced which model learning total (not necessarily recursive) functions with (possibly everywhere) imprecise theories from (possibly always) inaccurate data. It is proved that for any level of error allowable by the new success criteria, there exists a class of recursive functions such that not all f are identifiable via the criterion at that level of error. Also, necessary and sufficient conditions on the error level are given for when more classes of functions may be identified.     

Randomization-based inference about latent variables from complex samples

Standard procedures for drawing inferences from complex samples do not apply when the variable of interest cannot be observed directly, but must be inferred from the values of secondary random variables that depend on stochastically. Examples are proficiency variables in item response models and class memberships in latent class models. Rubin's multiple imputation techniques yield approximations of sample statistics that would have been obtained, had been observable, and associated variance estimates that account for uncertainty due to both the sampling of respondents and the latent nature of. The approach is illustrated with data from the National Assessment for Educational Progress.This research was supported by Grant No. NIE-G-83-0011 of the Office for Educational Research and Improvement, Center for Education Statistics, and Contract No. N00014-88-K-0304, R&T 4421552 from the Cognitive Sciences Program, Cognitive and Neural Sciences Division, Office of Naval Research. It does not necessarily reflect the views of either agency. I am grateful to R. Darrell Bock for calling my attention to the applicability of multiple imputation to the assessment setting; to Albert Beaton and Eugene Johnson for enlightening discussions on the topic; and to Henry Braun, Ben King, Debra Kline, Gary Phillips, Paul Rosenbaum, Don Rubin, John Tukey, Ming-Mei Wang, Kentaro Yamamoto, Rebecca Zwick, and two anonymous reviewers for comments on earlier drafts. Example 4 is based on the analysis of the 1984 National Assessment for Educational Progress reading survey, carried out at Educational Testing Service through the tireless efforts of too many people to mention by name, under the direction of Albert Beaton, Director of NAEP Data Analyses. David Freund, Bruce Kaplan, and Jennifer Nelson conducted additional analyses of the 1984 and 1988 data for the example.     

The relationship between perceived surface-lightness and perceived illumination

Summary An attempt was made to specify the relationship between perceived surface lightness and perceived illumination under the stimulus conditions where different combinations of albedo and illuminance gave 10 approximately equal-luminance levels of a test field (TF) on three different (black-, gray- and white-appearing) backgrounds. Two types of category judgments for TF-lightness and overall illumination were made on the total of 94 TFs by 5 Ss. The results indicated that under the condition where achromatic surface colors appear, the perceptual scission which produces two different perceptual dimensions (lightness and perceived illumination) from one sort of stimulation (luminance) was clearly observed. The relation between the two judgments was consistent with the lightness-illumination invariance hypothesis: As lightness judgments (A) changed from darker to lighter, illumination judgments (I) shifted form brighter to dimmer, the sum of A and I being kept nearly invariant for a given luminance of the TF; the psychological relationship between lightness and illumination, A+I, changed as a linear function of the photometric combination of albedo and illuminance, log A+log I. It was also found that the albedo of the background was an important factor determining the extent of perceptual scission between lightness and illumination.     

Stuffed Cabbage in the Old New School Cafeteria

The purpose of this lecture is to celebrate the memory of Aron Gurwitsch by examining and enlarging the domain of phenomenological clarification of some elements of what Gurwitsch called the logic of reality. Chief among those elements are the nature of the taken-for-grantedness of our existential belief, the difference between presentive and non-presentive indices of reality and the ground for the self-illumination of the world of working.     

Finitude and Hume’s Principle

The paper formulates and proves a strengthening of Freges Theorem, which states that axioms for second-order arithmetic are derivable in second-order logic from Humes Principle, which itself says that the number of Fs is the same as the number ofGs just in case the Fs and Gs are equinumerous. The improvement consists in restricting this claim to finite concepts, so that nothing is claimed about the circumstances under which infinite concepts have the same number. Finite Humes Principle also suffices for the derivation of axioms for arithmetic and, indeed, is equivalent to a version of them, in the presence of Freges definitions of the primitive expressions of the language of arithmetic. The philosophical significance of this result is also discussed.     

Gentzen-type formulation of the prepositional logic LQ

We give a Gentzen-type formulation GQ for the intermediate logic LQ and prove the cut-elimination theorem on it, where LQ is the propositional logic obtained from the intuitionistic propositional logic LI by adding the axioms of the form AV A.     

The logic of linear tolerance

A nonempty sequence T₁,...,T_n of theories is tolerant, if there are consistent theories T ₁ ⁺ ,..., T _n ⁺ such that for each 1 i n, T _i ⁺ is an extension of T_i in the same language and, if i n, T _i ⁺ interprets T _i+1 ⁺ . We consider a propositional language with the modality , the arity of which is not fixed, and axiomatically define in this language the decidable logics TOL and TOL. It is shown that TOL (resp. TOL) yields exactly the schemata of PA-provable (resp. true) arithmetical sentences, if (A₁,..., A_n) is understood as (a formalization of) PA+A₁, ..., PA+A_n is tolerant.     

A modification of kendall's tau for measuring association in contingency tables

A coefficient of association is described for a contingency table containing data classified into two sets of ordered categories. Within each of the two sets the number of categories or the number of cases in each category need not be the same.=+1 for perfect positive association and has an expectation of 0 for chance association. In many cases also has –1 as a lower limit. The limitations of Kendall's _a and _b and Stuart's _c are discussed, as is the identity of these coefficients to' under certain conditions. Computational procedure for is given.     

Maximization of sums of quotients of quadratic forms and some generalizations

Monotonically convergent algorithms are described for maximizing six (constrained) functions of vectors x, or matricesX with columns x₁, ..., x _r . These functions are h₁(x)= _k (xA _kx)(xC _kx)^–1, H₁(X)= _k tr (XA _k X)(XC _k X)^–1, h₁(X)= _{k l} (x _l A _kx _l ) (x _l C _kx _l )^–1 withX constrained to be columnwise orthonormal, h₂(x)= _k (xA _kx)²(xC _kx)^–1 subject to xx=1, H₂(X)= _k tr(XA _kX)(XA_kX)(XC_kX)^–1 subject toXX=I, and h₂(X)= _{k l} (x _l A _kx _l )² (x _l C _kX _l )^–1 subject toXX=I. In these functions the matricesC _k are assumed to be positive definite. The matricesA _k can be arbitrary square matrices. The general formulation of the functions and the algorithms allows for application of the algorithms in various problems that arise in multivariate analysis. Several applications of the general algorithms are given. Specifically, algorithms are given for reciprocal principal components analysis, binormamin rotation, generalized discriminant analysis, variants of generalized principal components analysis, simple structure rotation for one of the latter variants, and set component analysis. For most of these methods the algorithms appear to be new, for the others the existing algorithms turn out to be special cases of the newly derived general algorithms.This research has been made possible by a fellowship from the Royal Netherlands Academy of Arts and Sciences to the author. The author is obliged to Jos ten Berge for stimulating this research and for helpful comments on an earlier version of this paper.     

Supererogation in Deontic Logic: Metatheory for DWE and Some Close Neighbours

In "Doing Well Enough: Toward a Logic for Common Sense Morality", Paul McNamara sets out a semantics for a deontic logic which contains the operator It is supererogatory that. As well as having a binary accessibility relation on worlds, that semantics contains a relative ordering relation, . For worlds u, v and w, we say that u w v when v is at least as good as u according to the standards of w. In this paper we axiomatize logics complete over three versions of the semantics. We call the strongest of these logics DWE for Doing Well Enough.     

Philosophie der Arrieregarde

Bulgarian philosophical life is particularly poor and fruitless. As well as in all communist countries the development of Bulgarian Marxism-Leninism was marked by some very sharp controversies between dogmatics and revisionists. Bulgarian Orthodoxes are particularly militant and intolerant and on the contrary, revisionists are in reality very moderate and rather conservative. Therefore the deviations are insignificant and the degree of the destalinization is very small.     

Cut-free tableau calculi for some propositional normal modal logics

We give sound and complete tableau and sequent calculi for the prepositional normal modal logics S4.04, K4B and G ⁰(these logics are the smallest normal modal logics containing K and the schemata A A, A A and A ( A); A A and AA; A A and ((A A) A) A resp.) with the following properties: the calculi for S4.04 and G ⁰are cut-free and have the interpolation property, the calculus for K4B contains a restricted version of the cut-rule, the so-called analytical cut-rule.In addition we show that G ⁰is not compact (and therefore not canonical), and we proof with the tableau-method that G ⁰is characterised by the class of all finite, (transitive) trees of degenerate or simple clusters of worlds; therefore G ⁰is decidable and also characterised by the class of all frames for G ⁰.Research supported by Fonds zur Förderung der wissenschaftlichen Forschung, project number P8495-PHY.Presented by W. Rautenberg     

A reduction rule for Peirce formula

A reduction rule is introduced as a transformation of proof figures in implicational classical logic. Proof figures are represented as typed terms in a -calculus with a new constant P ⁽⁽⁾⁾. It is shown that all terms with the same type are equivalent with respect to -reduction augmented by this P-reduction rule. Hence all the proofs of the same implicational formula are equivalent. It is also shown that strong normalization fails for P-reduction. Weak normalization is shown for P-reduction with another reduction rule which simplifies of (( ) ) into an atomic type.This work was partially supported by a Grant-in-Aid for General Scientific Research No. 05680276 of the Ministry of Education, Science and Culture, Japan and by Japan Society for the Promotion of Science. Hiroakira Ono     

Third Men: The Logic of the Sophisms at Arist. SE 22, 178b36–170a10

This article aims at elucidating the logic of Arist. SE 22, 178b36–179a10 and, in particular, of the sophism labelled "Third Man" discussed in it. I suggest that neither the sophistic Walking Man argument, proposed by ancient commentators, nor the Aristotelian Third Man of the , suggested by modern interpreters, can be identified with the fallacious argument Aristotle presents and solves in the passage. I propose an alternative reconstruction of the Third Man sophism and argue that an explanation of the lines regarding the identity of Coriscus and Coriscus the musician (178b39–179a3) is indispensable for its correct understanding, since they hint at another sophism in some important aspects analogous. Finally, I show that two contradictions concerning spotted by scholars in the passage are only apparent and can be dissolved once the assumption that the anti-Platonic Third Man argument is at stake here is discarded, and once the passage is read in the light of its agonistic context.     

Kenneth Strike on Liberalism,Citizenship and the Private Interest in Schooling

After indicating a number of points of agreement with the argument 0eveloped by Kenneth Strike in his article Liberalism, Citizenship and the Private Interest in Schooling, this article identifies and explores a number of queries and criticisms which arise in relation to that argument. These queries and criticisms relate especially to the nature and extent of the expansiveness involved in Strike's conception of public or common educational influence, and to the implications and justification of the claim that private educational interests enjoy a greater salience and recognition on Strike's view of public or common educational influence than on some alternative views.     

Superintuitionistic Companions of Classical Modal Logics

This paper investigates partitions of lattices of modal logics based on superintuitionistic logics which are defined by forming, for each superintuitionistic logic L and classical modal logic , the set L[] of L-companions of . Here L[] consists of those modal logics whose non-modal fragments coincide with L and which axiomatize if the law of excluded middle p V p is added. Questions addressed are, for instance, whether there exist logics with the disjunction property in L[], whether L[] contains a smallest element, and whether L[] contains lower covers of . Positive solutions as concerns the last question show that there are (uncountably many) superclean modal logics based on intuitionistic logic in the sense of Vakarelov [28]. Thus a number of problems stated in [28] are solved. As a technical tool the paper develops the splitting technique for lattices of modal logics based on superintuitionistic logics and ap plies duality theory from [34].