The Embodied Penman: Effector‐Specific Motor–Language Integration During Handwriting

Several studies have illuminated how processing manual action verbs (MaVs) affects the programming or execution of concurrent hand movements. Here, to circumvent key confounds in extant designs, we conducted the first assessment of motor–language integration during handwriting—a task in which linguistic and motoric processes are co‐substantiated. Participants copied MaVs, non‐manual action verbs, and non‐action verbs as we collected measures of motor programming and motor execution. Programming latencies were similar across conditions, but execution was faster for MaVs than for the other categories, regardless of whether word meanings were accessed implicitly or explicitly. In line with the Hand‐Action‐Network Dynamic Language Embodiment (HANDLE) model, such findings suggest that effector‐congruent verbs can prime manual movements even during highly automatized tasks in which motoric and verbal processes are naturally intertwined. Our paradigm opens new avenues for fine‐grained explorations of embodied language processes.     

Gender-Role Attitudes in University Students in the United States, Slovenia, and Croatia

Determinants of gender-role attitudes were examined in samples of university students from Pittsburgh in the United States, Ljubljana in Slovenia, and Osijek in Croatia. Surveys including items from the Attitudes Toward Women Scale and the Neosexism Scale were administered to a total of 1,544 U.S. students, 912 Slovene students, and 996 Croatian students between the years of 1991 and 2000. As predicted, men held less egalitarian or more sexist attitudes about the appropriate roles for women and men, and those with more frequent attendance at religious services held more sexist attitudes. No changes in attitudes were found for women over time, but Slovene males were found to become more traditional over time.     

Formalization of functionally complete propositional calculus with the functor of implication as the only primitive term

The most difficult problem that Leniewski came across in constructing his system of the foundations of mathematics was the problem of defining definitions, as he used to put it. He solved it to his satisfaction only when he had completed the formalization of his protothetic and ontology. By formalization of a deductive system one ought to understand in this context the statement, as precise and unambiguous as possible, of the conditions an expression has to satisfy if it is added to the system as a new thesis. Now, some protothetical theses, and some ontological ones, included in the respective systems, happen to be definitions. In the present essay I employ Leniewski's method of terminological explanations for the purpose of formalizing ukasiewicz's system of implicational calculus of propositions, which system, without having recourse to quantification, I first extended some time ago into a functionally complete system. This I achieved by allowing for a rule of implicational definitions, which enabled me to define any propositionforming functor for any finite number of propositional arguments.To the memory of Jerzy Supecki     

Categorical and algebraic aspects of Martin-Löf Type Theory

In the paper there are introduced and discussed the concepts of an indexed category with quantifications and a higher level indexed category to present an algebraic characterization of some version of Martin-Löf Type Theory. This characterization is given by specifying an additional equational structure of those indexed categories which are models of Martin-Löf Type Theory. One can consider the presented characterization as an essentially algebraic theory of categorical models of Martin-Löf Type Theory. The paper contains a construction of an indexed category with quantifications from terms and types of the language of Martin-Löf Type Theory given in the manner of Troelstra [11]. The paper contains also an inductive definition of a valuation of these terms and types in an indexed category with quantifications.     

Aggressive behavior inhibition by serotonin and quipazine injected into the amygdala in the rat

The effects on aggressive behavior, open-field activity, and pain threshold of bilateral microinjections of serotonin (20 micrograms) and quipazine (20 micrograms), the direct serotonergic receptor agonist, into the cortico-medial amygdala were investigated in Wistar rats. Both drugs significantly prolonged the attack latency in isolated killer rats (predatory aggression model), and suppressed the incidence of aggressive postures/attacks in shock-induced fighting test (affective aggression). The only difference in the open-field behavior was the lower number of central square entries in drug-treated compared to saline-injected rats. None of the substances produced any significant change in jump threshold. It is concluded that stimulation of serotonin receptors within the amygdala produces inhibition of affective and muricidal behavior in isolated rats. The effect does not seem to be dependent on changes in general activity and pain sensitivity.     

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.     

On decidable consequence operators

The main theorem says that a consequence operator is an effective part of the consequence operator for the classical prepositional calculus iff it is a consequence operator for a logic satisfying the compactness theorem, and in which every finitely axiomatizable theory is decidable.