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).     

A further note on freeman's measure of association

This note extends and elaborates Hubert's attempt to provide an interpretation of Freeman's measure of association,. The measure is used in a a contingency table when observations are ordered on one variable and unordered on the other. No attempt is made explore the distribution of.     

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.     

Letter Writing and the Performativity of Intimacy in Female Pedagogical Relations: Recuperating Derridean Amnesia,Writing Back to Madame de Maintenon

Performativity and performance of language are the subject of this re-writing of Derrida's position on the gift. Here the source of performativity is Althusser's while the source of the gift is not only Marcel Mauss, but also both the opening of Derrida's Given Time: I, Counterfeit Money and the signing through letters of Madame de Maintenon, wife of Louis XIV and founder of a school for girls. A third writing plays a role, that of a 1910 biography of Madame. The paper is a relay, a re-play of the positions of the central characters, -- Derrida and Maintenon -- and a semiology of their writings. Out of this a new gift of pedagogy is evoked in a conception of pedagogical retreat.     

Независимость одной системы аксиом и правила вывода пропозиционального исчисления

- Allatum est die 5 Martii 1970     

Partially-Ordered (Branching) Generalized Quantifiers: A General Definition

Following Henkins discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or cardinality quantifiers, e.g., most, few, finitely many, exactly , where is any cardinal, etc. The definition is obtained in a series of generalizations, extending the original, Henkin definition first to a general definition of monotone-increasing (M) POQ and then to a general definition of generalized POQ, regardless of monotonicity. The extension is based on (i) Barwises 1979 analysis of the basic case of M POQ and (ii) my 1990 analysis of the basic case of generalized POQ. POQ is a non-compositional 1st-order structure, hence the problem of extending the definition of the basic case to a general definition is not trivial. The paper concludes with a sample of applications to natural and mathematical languages.     

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.     

Intuitionistic uniformity principles for propositions and some applications

This note deals with the prepositional uniformity principlep-UP: p x N A (p, x) x N p A (p, x) ( species of all propositions) in intuitionistic mathematics.p-UP is implied by WC and KS. But there are interestingp-UP-cases which require weak KS resp. WC only. UP for number species follows fromp-UP by extended bar-induction (ranging over propositions) and suitable weak continuity. As corollaries we have the disjunction property and the existential definability w.r.t. concrete objects. Other consequences are: there is no non-trivial countable partition of;id is the only injective function from to; there are no many-place injective prepositional functions; card () is incomparable with the cardinality of all metric spaces containing at least three elements.     

Suppositions in argumentation

The atheist who begins to argue his case by saying, Suppose there is an omniscient Being of the sort in which Christians believe ... is employing a very familiar move in argumentation. However, most books on argumentation theory ignore suppositions completely. Searle omits suppositions entirely from his taxonomy of speech acts and this appears to lead to a similar omission in Speech Acts in Argumentative Discussions by van Eemeren and Grootendorst.This paper argues that suppositional argument is elegant, powerful and extremely common, that the correct way to understand it is based on Gottlob Frege's distinction between asserted and unasserted propositions and hence that suppositions are neither assertions nor (and this is more important) assertives. The paper discusses the connections between suppositions and conditionals; it argues that argumentation theory which ignores suppositions is systematically misleading; and it concludes by indicating some possible developments in argumentation theory.Revised version of a paper delivered at the University of Amsterdam, April 3, 1987.     

Three theories of nominalized predicates

By the term nominalization I mean any process which transforms a predicate or predicate phrase into a noun or noun phrase, e.g. feminine is transformed into feminity. I call these derivative nouns abstract singular terms. Our aim is to provide a model-theoretic interpretation for a formal language which admits the occurrence of such abstract singular terms.     

A note on the ω-incompleteness formalization

The paper studies two formal schemes related to -completeness.LetS be a suitable formal theory containing primitive recursive arithmetic and letT be a formal extension ofS. Denoted by (a), (b) and (c), respectively, are the following three propositions (where (x) is a formula with the only free variable x): (a) (for anyn) ( _T (n)), (b) _{T x} Pr _T (^–(x)^–) and (c) _T x(x) (the notational conventions are those of Smoryski [3]). The aim of this paper is to examine the meaning of the schemes which result from the formalizations, over the base theoryS, of the implications (b) (c) and (a) (b), where ranges over all formulae. The analysis yields two results overS : 1. the schema corresponding to (b) (c) is equivalent to ¬Cons _T and 2. the schema corresponding to (a) (b) is not consistent with 1-CON _T. The former result follows from a simple adaptation of the -incompleteness proof; the second is new and is based on a particular application of the diagonalization lemma.Presented byMelvin Fitting     

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).     

On Alan Turing's anticipation of connectionism

It is not widely realised that Turing was probably the first person to consider building computing machines out of simple, neuron-like elements connected together into networks in a largely random manner. Turing called his networks unorganised machines. By the application of what he described as appropriate interference, mimicking education an unorganised machine can be trained to perform any task that a Turing machine can carry out, provided the number of neurons is sufficient. Turing proposed simulating both the behaviour of the network and the training process by means of a computer program. We outline Turing's connectionist project of 1948.In Memory of Robin Gandy     

On the relation provable equivalence and on partitions in effectively inseparable sets

We generalize a well-knownSmullyan's result, by showing that any two sets of the kindC _a = {x/ xa} andC _b = {x/ xb} are effectively inseparable (if I b). Then we investigate logical and recursive consequences of this fact (see Introduction).     

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 story says that” operator in story semantics

In [2] a semantics for implication is offered that makes use of stories — sets of sentences assembled under various constraints. Sentences are evaluated at an actual world and in each member of a set of stories. A sentence B is true in a story s just when B s. A implies B iff for all stories and the actual world, whenever A is true, B is true. In this article the first-order language of [2] is extended by the addition of the operator the story ... says that ..., as in The story Flashman among the Redskins says that Flashman met Sitting Bull. The resulting language is shown to be sound and complete.     

Argumentative aspects of indirect proof

While direct proof is widely considered the paradigm of the acquisition of knowledge by deductive means, indirect proof has traditionally been criticized as showing merely that its conclusion is true and not why it is true. This paper accounts for the traditional objection by emphasizing the argumentative role in indirect proof of logical principles such as excluded middle and non-contradiction.     

Natural deduction rules for English

A system of natural deduction rules is proposed for an idealized form of English. The rules presuppose a sharp distinction between proper names and such expressions as the c, a (an) c, some c, any c, and every c, where c represents a common noun. These latter expressions are called quantifiers, and other expressions of the form that c or that c itself, are called quantified terms. Introduction and elimination rules are presented for any, every, some, a (an), and the, and also for any which, every which, and so on, as well as rules for some other concepts. One outcome of these rules is that Every man loves some woman is implied by, but does not imply, Some woman is loved by every man, since the latter is taken to mean the same as Some woman is loved by all men. Also, Jack knows which woman came is implied by Some woman is known by Jack to have come, but not by Jack knows that some woman came.     

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