Time-course of hemispheric preference for processing contralateral relevant shapes: P1pc, N1pc, N2pc, N3pc

A most sensitive and specific electrophysiological indicator of selective processing of visual stimuli is the N2pc component. N2pc is a negative EEG potential peaking 250 ms after stimulus onset, recorded from posterior sites contralateral to relevant stimuli. Additional deflections preceding or following N2pc have been obtained in previous studies, possibly produced by specific stimulus features or specific prime-target sequences. To clarify the entire time-course of the contralateral- ipsilateral (C-I) difference recorded from the scalp above visual cortex in response to left-right pairs of targets and distracters, C-I differences were here compared between two types of stimuli and between stimuli that were or were not preceded by masked neutral primes. The C-I difference waveform consisted of several peaks, termed here P1pc (60-100 ms after target onset), N1pc (120-160 ms), N2pc (220-280 ms), and N3pc (360-400 ms). Being markedly enhanced when stimuli were preceded by the neutral primes, P1pc may indicate a response to stimulus change. Also, when stimuli were primed, N2pc reached its peak earlier, thereby tending to merge with N1pc. N3pc seemed to increase when target discrimination was difficult. N1pc, N2pc, and N3pc appear as three periods of one process. N3pc probably corresponds to L400 or SPCN as described in other studies. These observations suggest that the neurophysiological basis of stimulus-driven focusing of attention on target stimuli is a process that lasts for hundreds of milliseconds, with the relevant hemisphere being activated in an oscillating manner as long as required by the task.     

Towards a Rough Mereology-Based Logic for Approximate Solution Synthesis. Part 1

We are concerned with formal models of reasoning under uncertainty. Many approaches to this problem are known in the literature e.g. Dempster-Shafer theory [29], [42], bayesian-based reasoning [21], [29], belief networks [29], many-valued logics and fuzzy logics [6], non-monotonic logics [29], neural network logics [14]. We propose rough mereology developed by the last two authors [22-25] as a foundation for approximate reasoning about complex objects. Our notion of a complex object includes, among others, proofs understood as schemes constructed in order to support within our knowledge assertions/hypotheses about reality described by our knowledge incompletely.     

VEP latency and some properties of simple motor reaction-time distribution

Summary The median of simple motor reaction (RT) to a flash parallels the latencies of visually evoked potential (VEP) deflections if flash intensity is varied. However, mean and median reaction times are not equal because of the skewness of RT distribution. It therefore seemed plausible that the mean reaction time — intensity relationship would be steeper than that for VEP latency. Such divergence would account for the intensity-dependent motor component of RT revealed by other psychophysical studies. The latencies of VEP deflections were measured as a function of intensity and the results were compared with mean and median RTs. The difference between mean and median RT is constant and independent of flash intensity. Moreover, both values are parallel to VEP latency. The general pattern of results remains the same after a change in the distribution from which the foreperiod is sampled.     

Three contributions to the two-valued propositional calculus

Summary Three chapters contain the results independent of each other. In the first chapter I present a set of axioms for the propositional calculus which are shorter than the ones known so far, in the second one I give a method of defining all ternary connectives, in the third one, I prove that the probability of propositional functions is preserved under reversible substitutions. This paper appeard orginally under the title “Trois contributions an calcul des propositions bivalent” inStudia Societatis Scientiarum Torunensis, Toruń, Polonia, Sectio A, vol. I (1948), pp. 3–15.     

Sheaves over Heyting lattices

For a complete Heyting lattice , we define a category Etale (). We show that the category Etale () is equivalent to the category of the sheaves over , Sh(), hence also with -valued sets, see [2], [1]. The category Etale() is a generalization of the category Etale (X), see [1], where X is a topological space.