The Distance Function in Commutative ℓ-semigroups and the Equivalence in Łukasiewicz Logic

The equivalence connective in ukasiewicz logic has its algebraic counterpart which is the distance function d(x,y) =|x–y| of a positive cone of a commutative -group. We make some observations on logically motivated algebraic structures involving the distance function.     

On the dynamics of institutional agreements

In this paper we investigate a logic for modelling individual and collective acceptances that is called acceptance logic. The logic has formulae of the form A_G:x j{\rm A}_{G:x} \varphi reading ‘if the agents in the set of agents G identify themselves with institution x then they together accept that j{\varphi} ’. We extend acceptance logic by two kinds of dynamic modal operators. The first kind are public announcements of the form x!y{x!\psi}, meaning that the agents learn that y{\psi} is the case in context x. Formulae of the form [x!y]j{[x!\psi]\varphi} mean that j{\varphi} is the case after every possible occurrence of the event x!ψ. Semantically, public announcements diminish the space of possible worlds accepted by agents and sets of agents. The announcement of ψ in context x makes all \lnoty{\lnot\psi} -worlds inaccessible to the agents in such context. In this logic, if the set of accessible worlds of G in context x is empty, then the agents in G are not functioning as members of x, they do not identify themselves with x. In such a situation the agents in G may have the possibility to join x. To model this we introduce here a second kind of dynamic modal operator of acceptance shifting of the form G:x-y{G:x\uparrow\psi}. The latter means that the agents in G shift (change) their acceptances in order to accept ψ in context x. Semantically, they make ψ-worlds accessible to G in the context x, which means that, after such operation, G is functioning as member of x (unless there are no ψ-worlds). We show that the resulting logic has a complete axiomatization in terms of reduction axioms for both dynamic operators. In the paper we also show how the logic of acceptance and its dynamic extension can be used to model some interesting aspects of judgement aggregation. In particular, we apply our logic of acceptance to a classical scenario in judgment aggregation, the so-called ‘doctrinal paradox’ or ‘discursive dilemma’ (Pettit, Philosophical Issues 11:268–299, 2001; Kornhauser and Sager, Yale Law Journal 96:82–117, 1986).     

Conditions under which thurstone case III representations for binary choice probabilities are also Fechnerian

By a Thurstone Case III representation for binary symmetric choice probabilities P_x,y we mean that there exist functions F, μ, σ > 0 such that $\text{P}{}_{\mathrm{x,y}}\text{= F[}\text{(μ(x) ? μ(y))}\text{(σ}{}^2\text{(x) + σ}{}^2\text{(y))}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{]}$. We show that the constraint σ = constant, or μ = ασ + β, α ≠ 0, is both necessary and sufficient for a Thurstone Case III representation to be Fechnerian, i.e., to be reexpressable as as P_x,y = G(u(x) ? u(y)) for some suitably chosen functions G, u.     

Similarity of rectangles

Krantz and Tversky found that neither (log-) height (y) and width (x), nor area (x + y) and shape (x ? y) qualify as “subjective dimensions of rectangles” because both pairs violate the decomposability condition for their dissimilarity data. However, the data suggest a nonlinear transformation of x, y into a pair of subjective dimensions u(x, y), v(x, y) for which decomposability should be approximately satisfied. An explicit statement of this mapping is given.     

Real Interval Representations

This paper presents several necessary and sufficient conditions for real interval representability of biorders, interval orders, and semiorders. Let A and X be nonempty sets. We consider two types of interval representations for P⊂A×X. The first concerns the existence of two mappings, F: A→J_↓ and F: X→J_↑, such that, for all (a, x)∈A×X, (a, x)∈P⇔F(a)∩F (x)= ∅, where J_↓ and J_↑ respectively denote the set of all real intervals that are unbounded below and the set of all real intervals that are unbounded above. The second yields two mappings, F: A→J_↓ and G: X→J_↓, such that, for all (a, x)∈A×X, (a, x)∈P⇔F(a)⊂G(x). Specializations of those representations include the cases of A=X for interval orders and semiorders.     

Nondecomposable conjoint measurement for bisymmetric structures

This paper discusses two “nondecomposable” conjoint measurement representations for an asymmetric binary relation ? on a product set A × X, namely (a, x) ? (b, y) iff f₁(a) + g₁(a)g₂(x) > f₁(b) + g₁(b)g₂(y), and (a, x) ? (b, y) iff f₁(a) + f₂(x) + g₁(a)g₂(x) > f₁(b) + f₂(y) + g₁(b)g₂(y). Difficulties in developing axioms for ? on A × X which imply these representations in a general formulation have led to their examination from the standpoint of bisymmetric structures based on applications of a binary operation to A × X. Depending on context, the binary operation may refer to concatenation, extensive or intensive averaging, gambles based on an uncertain chance event, or to some other interpretable process. Independence axioms which are necessary and sufficient for the special representations within the context of bisymmetric structures are presented.     

On a property of BCK-identities

A BCK-algebra is an algebra in which the terms are generated by a set of variables, 1, and an arrow. We mean by aBCK-identity an equation valid in all BCK-algebras. In this paper using a syntactic method we show that for two termss andt, if neithers=1 nort=1 is a BCK-identity, ands=t is a BCK-identity, then the rightmost variables of the two terms are identical.This theorem was conjectured firstly in [5], and then in [3]. As a corollary of this theorem, we derive that the BCK-algebras do not form a variety, which was originally proved algebraically by Wroski ([4]).To prove the main theorem, we use a Gentzen-type logical system for the BCK-algebras, introduced by Komori, which consists of the identity axiom, the right and the left introduction rules of the implication, the exchange rule, the weakening rule and the cut. As noted in [2], the cut-elimination theorem holds for this system.Presented byJan Zygmunt     

Completeness theorem for dummett's LC quantified and some of its extensions

Dummett's logic LC quantified, Q-LC, is shown to be characterized by the extended frame Q⁺, ,D, where Q⁺ is the set of non-negative rational numbers, is the numerical relation less or equal then and D is the domain function such that for all v, w Q⁺, D_v and if v w, then D _v . D _v D _w . Moreover, simple completeness proofs of extensions of Q-LC are given.     

Multilinear representations for ordinal utility functions

An ordinal utility function u over two attributes X₁, X₂ is additive if there exists a strictly monotonic function ϕ such that ϕ(u) = v₁(x₂) + v₂(x₂) for some functions v₁, v₂. Here we consider the class of ordinal utility functions over n attributes for which each pair of attributes is additive, but not necessarily separable, for any fixed levels of the remaining attributes. We show that while this class is more general than those that are ordinally additive, the assessment task is of the same order of difficulty, and involves a hierarchy of multilinear rather than additive decompositions.     

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.     

Assessing sensitivity in a multidimensional space: some problems and a definition of a general d'

This article provides a formal definition for a sensivity measure,d′ _g , between two multivariate stimuli. In recent attempts to assess perceptual representations using qualitative tests on response probabilities, the concept of ad′ between two multidimensional stimuli has played a central role. For example, Kadlec and Townsend (1992a, 1992b) proposed several tests based on multidimensional signal detection theory that allow conclusions concerning the perceptual and/or decisional interactions of stimulus dimensions. One proposition, referred to as thediagonal d′test, relies on specific stimulus subsets of a feature-complete factorial identification task to infer perceptual separability. Also, Ashby and Townsend (1986), in a similar manner, attempted to relate perceptual independence to dimensional orthogonality in Tanner’s (1956) model, which also involvesd′ between two multivariate signals. An analysis of the proposedd′ _g reveals shortcomings in the diagonald′ test and also demonstrates that the assumptions behind equating perceptual independence to dimensional orthogonality are too weak. Thisd′ _g can be related to a common measure of statistical distance, Mahalanobis distance, in the special case of equal covariance matrices.     

A semantical investigation into Leśniewski's axiom of his ontology

A structure A for the language L, which is the first-order language (without equality) whose only nonlogical symbol is the binary predicate symbol , is called a quasi -struoture iff (a) the universe A of A consists of sets and (b) a b is true in A ([p) a = {p } & p b] for every a and b in A, where a(b) is the name of a (b). A quasi -structure A is called an -structure iff (c) {p } A whenever p a A. Then a closed formula in L is derivable from Leniewski's axiom x, y[x y u (u x) u; v(u, v x u v) u(u x u y)] (from the axiom x, y(x y x x) x, y, z(x y z y x z)) iff is true in every -structure (in every quasi -structure).     

Testing for selectivity in the dependence of random variables on external factors

Random variables A and B, whose joint distribution depends on factors (x,y), are selectively influenced by x and y, respectively, if A and B can be represented as functions of, respectively, (x,S_A,C) and (y,S_B,C), where S_A,S_B,C are stochastically independent and do not depend on (x,y). Selective influence implies selective dependence of marginal distributions on the respective factors: thus no parameter of A may depend on y. But parameters characterizing stochastic interdependence of A and B, such as their mixed moments, are generally functions of both x and y. We derive two simple necessary conditions for selective dependence of (A,B) on (x,y), which can be used to conduct a potential infinity of selectiveness tests. One condition is that, for any factor values x,x^′ and y,y^′,

s_xy≤s_xy^′+s_x^′y^′+s_x^′y,     

Might “unique” factors be “common”? On the possibility of indeterminate common–unique covariances

The present paper shows that the usual factor analytic structured data dispersion matrix Λ Ψ Λ′ + Δ can readily arise from a set of scores y = Λ η + ε, where the “common” (η) and “unique” (ε) factors have nonzero covariance: Γ = Covε,η) ≠ 0. Implications of this finding are discussed for the indeterminacy of factor scores, and for the issue of invariance of factor analytic covariance models. The size of the problem is explored with numerical examples. I would like to acknowledge the large amount of effort and stimulating input supplied on the previous drafts of this paper from the reviewers, Associate Editor, and Editors of Psychometrika. Particular thanks go to William Meredith for his assistance with the final draft. Requests for reprints should be sent to Dave Grayson, 14 Poplar Grove, Lawson, NSW 2783, Australia     

Lexicographic additive differences

Several authors have identified sets of axioms for a preference relation ? on a two-factor set A × X which imply that ? can be represented by specific types of numerical structures. Perhaps the two best-known of these are the additive representation, for which there are real valued functions f_A on A and f_X on X such that (a, x) ? (b, y) if and only if f_A(a) + f_X(x) > f_A(b) + f_X(y), and the lexicographic representation which, with A as the dominant factor, has (a, x) ? (b, y) if and only if f_A(a) > f_A(b) or {f_A(a) = f_A(b) and f_X(x) > f_X(y)}. Recently, Duncan Luce has combined the additive and lexicographic notions in a model for which A is the dominant factor if the difference between a and b is sufficiently large but which adheres to the additive representation when the difference between a and b lies within what might be referred to as a lexicographic threshold. The present paper specifies axioms for ? which lead to a numerical model which also has a lexicographic component but whose local tradeoff structure is governed by the additive-difference model instead of the additive model. Although the additive-difference model includes the additive model as a special case, the new lexicographic additive-difference model is not more general than Luce's model since the former has a “constant” lexicographic threshold whereas Luce's model has a “variable” lexicographic threshold. Realizations of the new model range from the completely lexicographic representation to the regular additive-difference model with no genuine lexicographic component. Axioms for the latter model are obtained from the general axioms with one slight modification.     

Some counterexamples in multidimensional scaling

Given a set X with elements x, y,… which has a partial order < on the pairs of the Cartesian product X², one may seek a distance function ? on such pairs (x, y) which satisfies ?(x₁, y₁) < ?(x₂, y₂) precisely when (x₁, y₁) < (x₂, y₂), and even demand a metric space (X, ?) with some such compatible ? which has an isometric imbedding into a finite-dimensional Euclidean space or a separable Hilbert space. We exhibit here systems (X, <) which cannot meet the latter demand. The space of real m-tuples (ξ₁,…,ξ_m) with either the “city-block” norm Σ_i ∥ξ_i∥ or the “dominance” norm max_i, ∥ξ_i∥ cannot possibly become a subset of any finite-dimensional Euclidean space. The set of real sequences (ξ₁, ξ₂,…) with finitely many nonzero elements and the supremum norm sup_i, ∥ξ_i∥ cannot even become a subset of any separable Hilbert space.     

Triadic judgment models and Weber's law

Let a, b, c, with a?b?c, be positive real numbers indicating the intensities of physical stimuli in a psychophysical experiment; let P_abc be the probability that b is judged to be more similar to a (“closer to”) a than to c. This paper investigates the following representation and its subcases for triadic judgments

P_abc=F[u(a)-u(b),u(b)-u(c)],