Neuter is not Common in Dutch: Eye Movements Reveal Asymmetrical Gender Processing

Native speakers of languages with transparent gender systems can use gender cues to anticipate upcoming words. To examine whether this also holds true for a non-transparent two-way gender system, i.e. Dutch, eye movements were monitored as participants followed spoken instructions to click on one of four displayed items on a screen (e.g., Klik op $de_{COM}$ rode appel $_{COM}$ , ‘Click on the $_\mathrm{COM}$ red apple $_\mathrm{COM}$ ’). The items contained the target, a colour- and/or gender-matching competitor, and two unrelated distractors. A mixed-effects regression analysis revealed that the presence of a colour-matching and/or gender-matching competitor significantly slowed the process of finding the target. The gender effect, however, was only observed for common nouns, reflecting the fact that neuter gender-marking cannot disambiguate as all Dutch nouns become neuter when used as diminutives. The gender effect for common nouns occurred before noun onset, suggesting that gender information is, at least partially, activated automatically before encountering the noun.     

Dependence and Independence

We introduce an atomic formula ${\vec{y} \bot_{\vec{x}}\vec{z}}$ intuitively saying that the variables ${\vec{y}}$ are independent from the variables ${\vec{z}}$ if the variables ${\vec{x}}$ are kept constant. We contrast this with dependence logic ${\mathcal{D}}$ based on the atomic formula = ${(\vec{x}, \vec{y})}$ , actually equivalent to ${\vec{y} \bot_{\vec{x}}\vec{y}}$ , saying that the variables ${\vec{y}}$ are totally determined by the variables ${\vec{x}}$ . We show that ${\vec{y} \bot_{\vec{x}}\vec{z}}$ gives rise to a natural logic capable of formalizing basic intuitions about independence and dependence. We show that ${\vec{y} \bot_{\vec{x}}\vec{z}}$ can be used to give partially ordered quantifiers and IF-logic an alternative interpretation without some of the shortcomings related to so called signaling that interpretations using = ${(\vec{x}, \vec{y})}$ have.     

Decidability of the Equational Theory of the Continuous Geometry CG(\Bbb {F})

For $\Bbb {F}$ the field of real or complex numbers, let $CG(\Bbb {F})$ be the continuous geometry constructed by von Neumann as a limit of finite dimensional projective geometries over $\Bbb {F}$ . Our purpose here is to show the equational theory of $CG(\Bbb {F})$ is decidable.     

Reconstructing an Open Order from Its Closure, with Applications to Space-Time Physics and to Logic

In his logical papers, Leo Esakia studied corresponding ordered topological spaces and order-preserving mappings. Similar spaces and mappings appear in many other application areas such the analysis of causality in space-time. It is known that under reasonable conditions, both the topology and the original order relation ${\preccurlyeq}$ can be uniquely reconstructed if we know the “interior” ${\prec}$ of the order relation. It is also known that in some cases, we can uniquely reconstruct ${\prec}$ (and hence, topology) from ${\preccurlyeq}$ . In this paper, we show that, in general, under reasonable conditions, the open order ${\prec}$ (and hence, the corresponding topology) can be uniquely determined from its closure ${\preccurlyeq}$ .     

The variance of d′ estimates obtained in yes—no and two-interval forced choice procedures

In studies of detection and discrimination, data are often obtained in the form of a 2 × 2 matrix and then converted to an estimate of d′, based on the assumptions that the underlying decision distributions are Gaussian and equal in variance. The statistical properties of the estimate of d′, $\hat d'$ , are well understood for data obtained using the yes—no procedure, but less effort has been devoted to the more commonly used two-interval forced choice (2IFC) procedure. The variance associated with $\hat d'$ is a function of trued′ in both procedures, but for small values of trued′, the variance of $\hat d'$ obtained using the 2IFC procedure is predicted to be less than the variance of $\hat d'$ obtained using yes—no; for large values of trued′, the variance of $\hat d'$ obtained using the 2IFC procedure is predicted to be greater than the variance of $\hat d'$ from yes—no. These results follow from standard assumptions about the relationship between the two procedures. The present paper reviews the statistical properties of $\hat d'$ obtained using the two standard procedures and compares estimates of the variance of $\hat d'$ as a function of trued′ with the variance observed in values of $\hat d'$ obtained with a 2IFC procedure.     

The epistemology of absence-based inference

Our main aim in this paper is to contribute towards a better understanding of the epistemology of absence-based inferences. Many absence-based inferences are classified as fallacies. There are exceptions, however. We investigate what features make absence-based inferences epistemically good or reliable. In Section 2 we present Sanford Goldberg’s account of the reliability of absence-based inference, introducing the central notion of epistemic coverage. In Section 3 we approach the idea of epistemic coverage through a comparison of alethic and evidential principles. The Equivalence Schema–a well-known alethic principle–says that it is true that $p$ if and only if $p$ . We take epistemic coverage to underwrite a suitably qualified evidential analogue of the Equivalence Schema: for a high proportion of values of $p$ , subject $S$ has evidence that $p$ due to her reliance on source $S^{*}$ if and only if $p$ . We show how this evidential version of the Equivalence Schema suffices for the reliability of certain absence-based inferences. Section 4 is dedicated to exploring consequences of the Evidential Equivalence Schema. The slogan ‘absence of evidence is evidence of absence’ has received a lot of bad press. More elaborately, what has received a lot of bad press is something like the following idea: absence of evidence sufficiently good to justify belief in $p$ is evidence sufficiently good to justify belief in $\sim p$ . A striking consequence of the Evidential Equivalence Schema is that absence of evidence sufficiently good to justify belief in p is evidence sufficiently good to justify belief in $\sim p$ . We establish this claim in Section 4 and show how this supports the reliability of an additional type of absence-based inference. Section 4 immediately raises the following question: how can we make philosophically good sense of the idea that absence of evidence is evidence of absence? We address this question in Section 5. Section 6 contains some summary remarks.     

Completeness in Hybrid Type Theory

We show that basic hybridization (adding nominals and @ operators) makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are to add nominals as expressions of type t, and to extend to arbitrary types the way we interpret \(@_i\) in propositional and first-order hybrid logic. This means: interpret \(@_i\alpha _a\) , where \(\alpha _a\) is an expression of any type \(a\) , as an expression of type \(a\) that rigidly returns the value that \(\alpha_a\) receives at the i-world. The axiomatization and completeness proofs are generalizations of those found in propositional and first-order hybrid logic, and (as is usual inhybrid logic) we automatically obtain a wide range of completeness results for stronger logics and languages. Our approach is deliberately low-tech. We don’t, for example, make use of Montague’s intensional type s, or Fitting-style intensional models; we build, as simply as we can, hybrid logicover Henkin’s logic.     

On Endomorphisms of Ockham Algebras with Pseudocomplementation

A pO-algebra ${(L; f, \, ^{\star})}$ is an algebra in which (L; f) is an Ockham algebra, ${(L; \, ^{\star})}$ is a p-algebra, and the unary operations f and ${^{\star}}$ commute. Here we consider the endomorphism monoid of such an algebra. If ${(L; f, \, ^{\star})}$ is a subdirectly irreducible pK _1,1- algebra then every endomorphism ${\vartheta}$ is a monomorphism or ${\vartheta^3 = \vartheta}$ . When L is finite the endomorphism monoid of L is regular, and we determine precisely when it is a Clifford monoid.     

Dynamic Modalities

A new modal logic containing four dynamic modalities with the following informal reading is introduced: ${\square^\forall}$ – always necessary, ${\square^\exists}$ – sometimes necessary, and their duals – ${\diamondsuit^\forall}$ – always possibly, and ${\diamondsuit^\exists}$ – sometimes possibly. We present a complete axiomatization with respect to the intended formal semantics and prove decidability via fmp.     

Inverse Images of Box Formulas in Modal Logic

We investigate, for several modal logics but concentrating on KT, KD45, S4 and S5, the set of formulas B for which ${\square B}$ is provably equivalent to ${\square A}$ for a selected formula A (such as p, a sentence letter). In the exceptional case in which a modal logic is closed under the (‘cancellation’) rule taking us from ${\square C \leftrightarrow \square D}$ to ${C \leftrightarrow D}$ , there is only one formula B, to within equivalence, in this inverse image, as we shall call it, of ${\square A}$ (relative to the logic concerned); for logics for which the intended reading of “ ${\square}$ ” is epistemic or doxastic, failure to be closed under this rule indicates that from the proposition expressed by a knowledge- or belief-attribution, the propositional object of the attitude in question cannot be recovered: arguably, a somewhat disconcerting situation. More generally, the inverse image of ${\square A}$ may comprise a range of non-equivalent formulas, all those provably implied by one fixed formula and provably implying another—though we shall see that for several choices of logic and of the formula A, there is not even such an ‘interval characterization’ of the inverse image (of ${\square A}$ ) to be found.     

On Birkhoff’s Common Abstraction Problem

In his milestone textbook Lattice Theory, Garrett Birkhoff challenged his readers to develop a ??common abstraction?? that includes Boolean algebras and latticeordered groups as special cases. In this paper, after reviewing the past attempts to solve the problem, we provide our own answer by selecting as common generalization of ${\mathcal{B} \mathcal{A}}$ and ${\mathcal{L} \mathcal{G}}$ their join ${\mathcal{B} \mathcal{A} \vee \mathcal{L} \mathcal{G}}$ in the lattice of subvarieties of ${\mathcal{F} \mathcal{L}}$ (the variety of FL-algebras); we argue that such a solution is optimal under several respects and we give an explicit equational basis for ${\mathcal{B} \mathcal{A} \vee \mathcal{L} \mathcal{G}}$ relative to ${\mathcal{F} \mathcal{L}}$ . Finally, we prove a Holland-type representation theorem for a variety of FL-algebras containing ${\mathcal{B} \mathcal{A} \vee \mathcal{L} \mathcal{G}}$ .     

Relation Formulas for Protoalgebraic Equality Free Quasivarieties; Pałasińska’s Theorem Revisited

We provide a new proof of the following Pa?asińska's theorem: Every finitely generated protoalgebraic relation distributive equality free quasivariety is finitely axiomatizable. The main tool we use are ${\mathcal{Q}}$ Q -relation formulas for a protoalgebraic equality free quasivariety ${\mathcal{Q}}$ Q . They are the counterparts of the congruence formulas used for describing the generation of congruences in algebras. Having this tool in hand, we prove a finite axiomatization theorem for ${\mathcal{Q}}$ Q when it has definable principal ${\mathcal{Q}}$ Q -subrelations. This is a property obtained by carrying over the definability of principal subcongruences, invented by Baker and Wang for varieties, and which holds for finitely generated protoalgebraic relation distributive equality free quasivarieties.     

Semi-intuitionistic Logic

The purpose of this paper is to define a new logic ${\mathcal {SI}}$ called semi-intuitionistic logic such that the semi-Heyting algebras introduced in [4] by Sankappanavar are the semantics for ${\mathcal {SI}}$ . Besides, the intuitionistic logic will be an axiomatic extension of ${\mathcal {SI}}$ .     

Information closure and the sceptical objection

In this article, I define and then defend the principle of information closure (pic) against a sceptical objection similar to the one discussed by Dretske in relation to the principle of epistemic closure. If I am successful, given that pic is equivalent to the axiom of distribution and that the latter is one of the conditions that discriminate between normal and non-normal modal logics, a main result of such a defence is that one potentially good reason to look for a formalization of the logic of “ $S$ is informed that $p$ ” among the non-normal modal logics, which reject the axiom, is also removed. This is not to argue that the logic of “ $S$ is informed that $p$ ” should be a normal modal logic, but that it could still be insofar as the objection that it could not be, based on the sceptical objection against pic, has been removed. In other word, I shall argue that the sceptical objection against pic fails, so such an objection provides no ground to abandon the normal modal logic B (also known as KTB) as a formalization of “ $S$ is informed that $p$ ”, which remains plausible insofar as this specific obstacle is concerned.     

What is Nominalistic Mereology?

Hybrid languages are introduced in order to evaluate the strength of “minimal” mereologies with relatively strong frame definability properties. Appealing to a robust form of nominalism, I claim that one investigated language $\mathcal {H}_{\textsf {m}}$ is maximally acceptable for nominalistic mereology. In an extension $\mathcal {H}_{\textsf {gem}}$ of $\mathcal {H}_{\textsf {m}}$ , a modal analog for the classical systems of Leonard and Goodman (J Symb Log 5:45–55, 1940) and Le?niewski (1916) is introduced and shown to be complete with respect to 0-deleted Boolean algebras. We characterize the formulas of first-order logic invariant for $\mathcal {H}_{\textsf {gem}}$ -bisimulations.     

How schoolchildren’s acceptance of self and others relate to their attitudes to victims of bullying

Previous research has indicated that harm to the mental health of children who are repeatedly victimised by their peers at school can be ameliorated through social or emotional support provided by other students. In this study we examined whether student provictim attitudes are related to more basic attitudes to self and attitudes to others. Measures of these attitudes were developed for use with children, and shown to be internally consistent and possess concurrent validity. Relations between these variables were then examined with a sample of Australian school children ( $N = 212$ ) aged between 9 and 14 years. Provictim attitudes correlated significantly ( $r = .55$ ) with acceptance of others, but not with acceptance of self ( $r = -.04$ ). Controlling for age and gender, multiple regression analyses confirmed these findings. Attitudes to victims were less positive for older students ( $r = -.22$ ). Gender differences, however, were not significant. These findings suggest that among schoolchildren self-acceptance is unrelated to positive attitudes towards victims, whereas acceptance of others has a moderately strong relation with provictim attitude. Implications for improving attitudes to victims among school children were examined.     

Acquisition and decision in visual same-different search of letter displays

From 2 to 23 capital As, Bs, and Cs were positioned randomly over visual displays varying in sizefrom5 to 10deg square and in luminance from7 to 250cd/m², The task was to decide whether all letters were the same or one was different from the rest. Instructions stressed accuracy, and responses were 97% correct. Three experiments with 50 observers varied amount of practice, number of letters (N), and size and luminance of the display. All experiments produced a linear invariance between mean “same” \((\bar S)\) and mean “different” \((\bar D)\) response times in seconds with N as the parameter: \(\bar D\) ? \(\bar S\) /2+4. The data are consistent with Krueger’s same-different decision theory, and with the separation of acquisition from decision processes.     

Pre- and Post-head Processing for Single- and Double-Scrambled Sentences of a Head-Final Language as Measured by the Eye Tracking Method

Using the eye-tracking method, the present study depicted pre- and post-head processing for simple scrambled sentences of head-final languages. Three versions of simple Japanese active sentences with ditransitive verbs were used: namely, (1) $\text{ SO }_{\!1\!}\text{ O }_{\!2\!}\text{ V }$ canonical, (2) $\text{ SO }_{\!2\!}\text{ O }_{\!1\!}\text{ V }$ single-scrambled, and (3) $\text{ O }_{\!1\!}\text{ O }_{\!2\!}\text{ SV }$ double-scrambled order. First pass reading times indicated that the third noun phrase just before the verb in both single- and double-scrambled sentences required longer reading times compared to canonical sentences. Re-reading times (the sum of all fixations minus the first pass reading) showed that all noun phrases including the crucial phrase before the verb in double-scrambled sentences required longer re-reading times than those required for single-scrambled sentences; single-scrambled sentences had no difference from canonical ones. Therefore, a single filler-gap dependency can be resolved in pre-head anticipatory processing whereas two filler-gap dependencies require much greater cognitive loading than a single case. These two dependencies can be resolved in post-head processing using verb agreement information.     

Actuality in Propositional Modal Logic

We show that the actuality operator A is redundant in any propositional modal logic characterized by a class of Kripke models (respectively, neighborhood models). Specifically, we prove that for every formula ${\phi}$ in the propositional modal language with A, there is a formula ${\psi}$ not containing A such that ${\phi}$ and ${\psi}$ are materially equivalent at the actual world in every Kripke model (respectively, neighborhood model). Inspection of the proofs leads to corresponding proof-theoretic results concerning the eliminability of the actuality operator in the actuality extension of any normal propositional modal logic and of any “classical” modal logic. As an application, we provide an alternative proof of a result of Williamson’s to the effect that the compound operator A□ behaves, in any normal logic between T and S5, like the simple necessity operator □ in S5.