Analysis of the components of disparity in Wilde's dot-row phenomenon

Summary In this study on Wilde's phenomenon (Wilde 1950) the two components of disparity, one of them processing displacement, and the other one apparent rotation, are analysed in terms of dependence on the disparity of the end-lines of the pattern (), and on the percentage of magnification (M) of one of the monocular patterns in relation to the other one. It was found that the component of disparity for displacement ' can be expressed as a linear regression equation '=–a+b.The component of disparity for rotation, expressed as a percentage of magnification effective for rotation (M) can be expressed as M=a–b₁+b₂M.It was concluded that the two components of disparity are processed through independent parallel channels, the processing of the component of disparity for displacement being the faster process, accounting for the larger part of the total disparity.     

Some modifications of Scott's theorem on injective spaces

D. Scott in his paper [5] on the mathematical models for the Church-Curry -calculus proved the following theorem.A topological space X. is an absolute extensor for the category of all topological spaces iff a contraction of X. is a topological space of Scott's open sets in a continuous lattice.In this paper we prove a generalization of this theorem for the category of , -closure spaces. The main theorem says that, for some cardinal numbers , , absolute extensors for the category of , -closure spaces are exactly , -closure spaces of , -filters in , >-semidistributive lattices (Theorem 3.5).If = and = we obtain Scott's Theorem (Corollary 2.1). If = 0 and = we obtain a characterization of closure spaces of filters in a complete Heyting lattice (Corollary 3.4). If = 0 and = we obtain a characterization of closure space of all principial filters in a completely distributive complete lattice (Corollary 3.3).     

On a problem of P(α, δ, π) concerning generalized Alexandroff s cube

Universality of generalized Alexandroff's cube plays essential role in theory of absolute retracts for the category of , -closure spaces. Alexandroff's cube. is an , -closure space generated by the family of all complete filters. in a lattice of all subsets of a set of power .Condition P(, , ) says that is a closure space of all , -filters in the lattice ( ), .Assuming that P (, , ) holds, in the paper [2], there are given sufficient conditions saying when an , -closure space is an absolute retract for the category of , -closure spaces (see Theorems 2.1 and 3.4 in [2]).It seems that, under assumption that P (, , ) holds, it will be possible to givean uniform characterization of absolute retracts for the category of , -closure-spaces.Except Lemma 3.1 from [1], there is no information when the condition P (, , ) holds or when it does not hold.The main result of this paper says, that there are examples of cardinal numbers, , , such that P (, , ) is not satisfied.Namely it is proved, using elementary properties of Lebesgue measure on the real line, that the condition P (, ₁, 2 ) is not satisfied.Moreover it is shown that fulfillment of the condition is essential assumption in, Theorems 2.1 and 3.4 from [1] i.e. it cannot be eliminated.     

Least-squares approximation of an improper correlation matrix by a proper one

An algorithm is presented for the best least-squares fitting correlation matrix approximating a given missing value or improper correlation matrix. The proposed algorithm is based upon a solution for Mosier's oblique Procrustes rotation problem offered by ten Berge and Nevels. A necessary and sufficient condition is given for a solution to yield the unique global minimum of the least-squares function. Empirical verification of the condition indicates that the occurrence of non-optimal solutions with the proposed algorithm is very unlikely. A possible drawback of the optimal solution is that it is a singular matrix of necessity. In cases where singularity is undesirable, one may impose the additional nonsingularity constraint that the smallest eigenvalue of the solution be , where is an arbitrary small positive constant. Finally, it may be desirable to weight the squared errors of estimation differentially. A generalized solution is derived which satisfies the additional nonsingularity constraint and also allows for weighting. The generalized solution can readily be obtained from the standard unweighted singular solution by transforming the observed improper correlation matrix in a suitable way.     

Item information and discrimination functions for trinary pcm items

For trinary partial credit items the shape of the item information and the item discrimination function is examined in relation to the item parameters. In particular, it is shown that these functions are unimodal if ₂ – ₁ < 4 ln 2 and bimodal otherwi The locations and values of the maxima are derived. Furthermore, it is demonstrated that the value of the maximum is decreasing in ₂ – ₁. Consequently, the maximum of a unimodal item information function is always larger than the maximum of a bimodal one, and similarly for the item discrimination function.The work reported herein was partially supported under the National Assessment of Educational Progress (Grant No. R999G30002; CFDA No. 84.999G) as administered by the Office of Educational Research and Improvement, US Department of Education.     

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.     

A note on the equivalence of the graded response model and the sequential model

This paper concerns items that consist of several item steps to be responded to sequentially. The item scoreX is defined as the number of correct responses until the first failure. Samejima's graded response model states that each steph=1,...,m is characterized by a parameterb _h , and, for a subject with ability, Pr(Xh; )=F(–b _h ). Tutz's general sequential model associates with each step a parameterdh, and it states that Pr(Xh;)= _r ^=1h G(–d _r ). Tutz's (1991, 1997) conjectures that the models are equivalent if and only ifF(x)=G(x) is an extreme value distribution. This paper presents a proof for this conjecture.     

A quasi-nonmetric method for multidimensional scaling VIA an extended euclidean model

An Extended Two-Way Euclidean Multidimensional Scaling (MDS) model which assumes both common and specific dimensions is described and contrasted with the standard (Two-Way) MDS model. In this Extended Two-Way Euclidean model then stimuli (or other objects) are assumed to be characterized by coordinates onR common dimensions. In addition each stimulus is assumed to have a dimension (or dimensions) specific to it alone. The overall distance between objecti and objectj then is defined as the square root of the ordinary squared Euclidean distance plus terms denoting the specificity of each object. The specificity,s _j , can be thought of as the sum of squares of coordinates on those dimensions specific to objecti, all of which have nonzero coordinatesonly for objecti. (In practice, we may think of there being just one such specific dimension for each object, as this situation is mathematically indistinguishable from the case in which there are more than one.)We further assume that _ij =F(d _ij ) +e _ij where _ij is the proximity value (e.g., similarity or dissimilarity) of objectsi andj,d _ij is the extended Euclidean distance defined above, whilee _ij is an error term assumed i.i.d.N(0, ²).F is assumed either a linear function (in the metric case) or a monotone spline of specified form (in the quasi-nonmetric case). A numerical procedure alternating a modified Newton-Raphson algorithm with an algorithm for fitting an optimal monotone spline (or linear function) is used to secure maximum likelihood estimates of the paramstatistics) can be used to test hypotheses about the number of common dimensions, and/or the existence of specific (in addition toR common) dimensions.This approach is illustrated with applications to both artificial data and real data on judged similarity of nations.     

On a certain class ofm-address machines

Conclusion It follows from the proved theorems that ifM =Q, (whereQ={0,q ₁,q ₂,...,q }) is a machine of the classM _F then there exist machinesM _i such thatM _i(1,c)=M (q _i,c) andQ _i={0, 1, 2, ..., +1} (i=1, 2, ..., ).And thus, if the way in which to an initial function of content of memorycC a machine assigns a final onecC is regarded as the only essential property of the machine then we can deal with the machines of the formM ={0, 1, 2, ..., }, and processes (t) (wheret=1,c,cC) only.Such approach can simplify the problem of defining particular machines of the classM _F , composing and simplifying them.Allatum est die 19 Januarii 1970     

Nonmonotonicity in (the Metamathematics of) Arithmetic

This paper is an attempt to bring together two separated areas of research: classical mathematics and metamathematics on the one side, non-monotonic reasoning on the other. This is done by simulating nonmonotonic logic through antitonic theory extensions. In the first half, the specific extension procedure proposed here is motivated informally, partly in comparison with some well-known non-monotonic formalisms. Operators V and, more generally, U are obtained which have some plausibility when viewed as giving nonmonotonic theory extensions. In the second half, these operators are treated from a mathematical and metamathematical point of view. Here an important role is played by U -closed theories and U -fixed points. The last section contains results on V-closed theories which are specific for V.     

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.     

Model theoretic results for infinitely deep languages

We define a subhierarchy of the infinitely deep languagesN described by Jaakko Hintikka and Veikko Rantala. We shall show that some model theoretic results well-known in the model theory of the ordinary infinitary languages can be generalized for these new languages. Among these are the downward Löwenheim-Skolem and o's theorems as well as some compactness properties.     

Disparity-processing in Wilde's dot-row phenomenon

Summary In this investigation on Wilde's phenomenon vertical lines were used instead of dots. In three experiments it was found that for the occurrence of Wilde's phenomenon, it is a necessary condition that the distances between all lines including the monocular end-lines are equal. When this is not the case the Panum effect is observed. When the distance between the end-line and its adjacent line deviates slightly from the distance between the central lines, one observes apparent rotation and a Panum effect. The observed depth of the end-line is in accordance with its disparity. The observed rotation is less than can be expected from the position in depth of the end-line. The disparity of the end-line is fully processed. Part of its disparity is used for apparent rotation of the pattern, and part of it is used for a displacement of the whole pattern.     

On testing hypotheses regarding a class of covariance structures

Let x be ap-component random variable having a multivariate normal distribution with covariance matrix . In this paper, we consider the problem of testing hypotheses of the formH ₀: =b ₁₁ + +b _{m m} , whereb _i 's are unknown scalars, and _i 's are a set of known and simultaneously diagonalizable matrices. This problem has both psychometric and statistical interest, and its basic theory is developed here. Besides, the problem of obtaining likelihood-ratio statistic for testingH ₀ is studied, and the statistic obtained in a special case.     

On two arguments for the indeterminacy of personal identity

Both arguments are based on the breakdown of normal criteria of identity in certain science-fictional circumstances. In one case, normal criteria would support the identity of person A with each of two other persons, B and C; and it is argued that, in the imagined circumstances, A=B and A=C have no truth value. In the other, a series or spectrum of cases is tailored to a sorites argument. At one end of the spectrum, persons A and B are such that A=B is clearly true; at the other end, A and B are such that the identity is clearly false. In between, normal criteria of identity leave the truth or falsehood of A=B undecided, and it is argued that in these circumstances A=B has no truth value.These arguments are to be understood counterfactually. My claim is that, so understood, neither establishes its conclusion. The first involves a pair of counterfactual situations that are equally possible or tied. If A=B and A=C have no truth value, a counterfactual conditional with one of them as consequent and an antecedent that is true in circumstances in which either is true should have no truth value. Intuitively, however, any such counterfactual is false. The second argument can be seen to invite an analogous response. If this is right, however, there is an important disanalogy between this and the classical paradox of the heap. If the disanalogy is only apparent, the argument shows at most that the existence of persons can be indeterminate.     

Some results on the Kripke sheaf semantics for super-intuitionistic predicate logics

Some properties of Kripke-sheaf semantics for super-intuitionistic predicate logics are shown. The concept ofp-morphisms between Kripke sheaves is introduced. It is shown that if there exists ap-morphism from a Kripke sheaf ₁ into ₂ then the logic characterized by ₁ is contained in the logic characterized by ₂. Examples of Kripke-sheaf complete and finitely axiomatizable super-intuitionistic (and intermediate) predicate logics each of which is Kripke-frame incomplete are given. A correction to the author's previous paper Kripke bundles for intermediate predicate logics and Kripke frames for intuitionistic modal logics (Studia Logica, 49(1990), pp. 289–306 ) is stated.Dedicated to Professor Takeshi Kotake on his 60th birthdayThis research was partially supported by Grant-in-Aid for Encouragement of Young Scientists No. 03740107, Ministry of Educatin, Science and Culture, Japan.     

Interpolation and amalgamation properties in varieties of equivalential algebras

Important positive as well as negative results on interpolation property in fragments of the intuitionistic propositional logic (INT) were obtained by J. I. Zucker in [6]. He proved that the interpolation theorem holds in purely implicational fragment of INT. He also gave an example of a fragment of INT for which interpolation fails. This fragment is determined by the constant falsum (), well known connectives: implication () and conjunction (), and by a ternary connective defined as follows: (p, q, r)= ^df (pq)(pr).Extending this result of J. I. Zucker, G. R. Renardel de Lavalette proved in [5] that there are continuously many fragments of INT without the interpolation property.This paper is meant to continue the research mentioned above. To be more precise, its aim is to answer questions concerning interpolation and amalgamation properties in varieties of equivalential algebras, particularly in the variety determined by the purely equivalential fragment of INT.     

Embedding Logics into Product Logic

We construct a faithful interpretation of ukasiewicz's logic in product logic (both propositional and predicate). Using known facts it follows that the product predicate logic is not recursively axiomatizable.We prove a completeness theorem for product logic extended by a unary connective of Baaz [1]. We show that Gödel's logic is a sublogic of this extended product logic.We also prove NP-completeness of the set of propositional formulas satisfiable in product logic (resp. in Gödel's logic).     

Contextualism and the Skeptic: Comments on Engel

Mylan Engels paper (2004) is divided into two parts: a negative part, criticizing the costs of contextualism and a constructive part proposing a noncontextualist resolution of the skeptical problem. I will only address the constructive part here. The constructive part is composed of three elements: (i) a reconstruction or reformulation of the original skeptical argument, which draws on the notion of epistemic possibility (e-possibility), (ii) a distinction between two senses of knowledge (and two corresponding kinds of e-possibility): fallibilistic and infallibilistic, and (iii) an argument which tries to hoist the skeptic by their own petard, namely the closure principle (CP). As I will argue, there are two ways to understand Engels anti-skeptical argument. Only in one interpretation does the argument depend on the proposed reconstruction of the skeptical argument in terms of e-possibility. But this version of the argument is unsound. More importantly, the skeptic has a strong prima facie objection at her disposal, which applies to both interpretations of the argument. If this objection is valid, Engels argument does not hold. But once it is invalidated, his argument is superfluous.     

The relativity of perceptual knowledge

Since the most promising path to a solution to the problem of skepticism regarding perceptual knowledge seems to rest on a sharp distinction between perceiving and inferring, I begin by clarifying and defending that distinction. Next, I discuss the chief obstacle to success by this path, the difficulty in making the required distinction between merely logical possibilities that one is mistaken and the real (Austin) or relevant (Dretske) possibilities which would exclude knowledge. I argue that this distinction cannot be drawn in the ways Austin and Dretske suggest without begging the questions at issue. Finally, I sketch and defend a more radical way of identifying relevant possibilities that is inspired by Austin's controversial suggestion of a parallel between saying I know and saying I promise: a claim of knowledge of some particular matter is relative to a context in which questions about the matter have been raised.