Hybrids of the -translation for

In [W. Burr, Functional interpretation of Aczel's constructive set theory, Annals of Pure and Applied Logic 104 (2000) 31–73] Wolfgang Burr presents a functional interpretation of constructive set theory in all finite types, , in a theory of constructive set functionals. is a subtheory of , containing bounded quantifiers only. His interpretation theorem reduces the consistency problem of (and certain extensions thereof) to the consistency problem of .We want to study admissible rules in , i.e. rules under which is closed. To do so, we study a Troelstra-style q-hybrid of, in fact, a modification ^× of Burr's translation. We introduce this modification in order to close a minor gap in Burr's proof of the functional interpretation of the schema of (Strong Collection).First of all, but surely after a short introduction, we analyse the less complex translation of modified realisation ^mr and its hybrids ^mq and ^mrt.     

Sources of variability in working memory in early childhood: A consideration of age, temperament, language, and brain electrical activity

This study investigated age-related differences in working memory and inhibitory control (WMIC) in -, 4-, and -year-olds and how these differences were associated with differences in regulatory aspects of temperament, language comprehension, and brain electrical activity. A series of cognitive control tasks was administered to measure WMIC ability, including the Stroop-like day–night and the yes–no tasks. Baseline and task electroencephalographic data were collected. The Children's Behavior Questionnaire was used to assess caregiver perceptions of temperament with a particular interest in the effortful control and surgency factors, and language comprehension was measured with the Peabody-Picture Vocabulary Test-III. The results of this study demonstrated differential temperament-cognition relations for the three age groups, as positive associations were found between WMIC and effortful control for the - and 4-year-olds and negative associations were found between WMIC and surgency for the -year-olds. An increasingly robust relation between WMIC and language comprehension was demonstrated across the three age groups, as well as differential patterns of task-related brain electrical activity.     

A kinematic and dynamic comparison of surface and underwater displacement in high level monofin swimming

Fin swimming performance can be divided into underwater and surface water races. World records are about 10% faster for underwater swimming vs. surface swimming, but little is known about the advantage of underwater swimming for monofin swimming. Some authors reported that the air–water interface influences the kinematics and leads to a narrow vertical amplitude of the fin. On the one hand, surface swimming is expected to affect drag parameters (cross-sectional area (S) and active drag (AD)) when compared to underwater swimming. On the other hand, the surface swimming technique may also affect efficiency (η_F). The aim of this study is therefore to evaluate and compare drag parameters and efficiency during underwater and surface swimming. To this end, 12 international level monofin swimmers were measured during both underwater and surface swimming. Kinematic parameters (both dimensional and non-dimensional), η_F (calculated according to the Elongated-Body Theory), and AD (computed with Velocity Perturbation Method) were calculated for an underwater and a surface fin swimming trial, performed at maximal speed. As expected, results showed significantly lower velocities during surface swimming vs. underwater  = 2.5 m s⁻¹ vs.  = 2.36 m s⁻¹, p < .01). Velocities during underwater and surface swimming were strongly correlated (r = .97, p < .01). Underwater swimming was also associated with higher vertical amplitudes of the fin compared to surface swimming ( = 0.55 m vs. ) = 0.46 m, p < .01). Length-specific amplitudes (A_under/L_b) were in the order of 20% during underwater swimming as for undulating fish, and significantly higher than during surface swimming (A_surf/L_b = 17%, p < .01). Efficiency for surface swimming was about 6% lower than for underwater swimming ( = 0.79 vs.  = 0.74, p < .01). This decrease could be associated with an increase in swimming frequency for surface swimming ( = 2.15 Hz vs.  = 2.08 Hz, p < .01). Active drag during surface swimming was about 7% higher than for underwater swimming ( = 78.9 N vs.  = 84.7 N, p < .01). A significantly smaller cross-sectional area for surface swimming ( = 0.053 m² vs.  = 0.044 m², p < .01) and higher drag coefficient for surface swimming ( = 0.47 vs.  = 0.69, p < .01) were measured. Finally, correlation between cross-sectional area and vertical amplitude of the fin was reported for both underwater and surface swimming. These results suggest that the performance improvement during underwater swimming is not only linked to a wave drag reduction effect but also to a specific swimming technique due to the free surface.     

On the consistency problem for the calculus

In this paper, we further investigate the consistency problem for the qualitative temporal calculus introduced by Pujari et al. [A.K. Pujari, G.V. Kumari, A. Sattar, INDU: An interval and duration network, in: Australian Joint Conference on Artificial Intelligence, 1999, pp. 291–303]. We prove the intractability of the consistency problem for the subset of pre-convex relations, and the tractability of strongly pre-convex relations. Furthermore, we also define another interesting set of relations for which the consistency problem can be decided by the -closure method, a method similar to the usual path-consistency method. Finally, we prove that the -closure method is also complete for the set of atomic relations of implying that the intervals have the same duration.     

-Cycloserine: Effects on Long-Term Retention of a Conditioned Response and on Memory for Contextual Attributes

-Cycloserine (DCS), a partial agonist of the glycine recognition site of the N-methyl -aspartate receptor, has beneficial effects on learning and memory. In order to investigate its potential to influence learning and memory of both the response and the stimulus attributes of training, male Sprague-Dawley albino rats were trained in a one-trial inhibitory avoidance task following an acute intraperitoneal injection of DCS (3 mg/kg) or an equal volume of saline. In order to measure memory for stimulus attributes, testing involved a context shift paradigm, in which subjects are tested in either the environment of training or a different one. Good memory for the contextual attributes of training is indicated by poor performance in the alternate context. Retention was assessed either 1, 7, or 14 days after training. At 1 day, Saline subjects were affected by a change in context, while DCS subjects were not. In subjects tested 1 week following training, Saline subjects were no longer affected by a change in context, in that they performed the avoidance response in both contexts. This indicates the forgetting of stimulus attributes in Saline subjects. DCS subjects did show the context shift effect at 1 week, indicating the retention of stimulus attributes. Finally, Saline subjects demonstrated the context shift rebound at 14 days, while DCS subjects performed equivalently in both contexts. Taken together, these data suggest that DCS may enhance retention of fear and slow the forgetting of stimulus attributes.     

On the provenance of judgments of conditional probability

In standard treatments of probability, is defined as the ratio of to , provided that . This account of conditional probability suggests a psychological question, namely, whether estimates of arise in the mind via implicit calculation of . We tested this hypothesis (Experiment 1) by presenting brief visual scenes composed of forms, and collecting estimates of relevant probabilities. Direct estimates of conditional probability were not well predicted by . Direct estimates were also closer to the objective probabilities defined by the stimuli, compared to estimates computed from the foregoing ratio. The hypothesis that arises from the ratio fared better (Experiment 2). In a third experiment, the same hypotheses were evaluated in the context of subjective estimates of the chance of future events.     

Social networks and web minorities

The conception of appropriate models of information retrieval is a crucial step for the actual growth and development of the web. In addition to traditional information retrieval techniques, nowadays search engines have adopted methods for taking into account the social network deriving from the pattern of interconnections. Using different arguments, it has been shown that this is very effective in practice. In this paper we subscribe that point of view, but state also that social networks based ranking schemes operating on the whole web, like Google’s , prevent small communities to become visible on the Web, regardless of the quality of the information. Hence, we strongly advocate the development of new cognitive models of the whole process of information retrieval which are capable of facing this problem. We give a picture of distributed architectures which incorporates topic-based intelligent agents and personal agents for capturing the user’s profile.     

Tableaux for Łukasiewicz Infinite-valued Logic

In this work we propose a labelled tableau method for ukasiewicz infinite-valued logic L . The method is based on the Kripke semantics of this logic developed by Urquhart [25] and Scott [24]. On the one hand, our method falls under the general paradigm of labelled deduction [8] and it is rather close to the tableau systems for sub-structural logics proposed in [4]. On the other hand, it provides a CoNP decision procedure for L validity by reducing the check of branch closure to linear programming     

Predicate Logics on Display

The paper provides a uniform Gentzen-style proof-theoretic framework for various subsystems of classical predicate logic. In particular, predicate logics obtained by adopting van Behthem's modal perspective on first-order logic are considered. The Gentzen systems for these logics augment Belnap's display logic by introduction rules for the existential and the universal quantifier. These rules for x and x are analogous to the display introduction rules for the modal operators and and do not themselves allow the Barcan formula or its converse to be derived. En route from the minimal modal predicate logic to full first-order logic, axiomatic extensions are captured by purely structural sequent rules.     

Axioms for Deliberative Stit

Based on a notion of companions to stit formulas applied in other papers dealing with astit logics, we introduce choice formulas and nested choice formulas to prove the completeness theorems for dstit logics in a language with the dstit operator as the only non-truth-functional operator. The main logic discussed in this paper is the basic logic of dstit with multiple agents, other logics discussed include the basic logic of dstit with a single agent and some logics of dstit with multiple agents each of which corresponds to a semantic condition concerning the number of possible choices for agents.     

Using information criteria to determine the number of regimes in threshold autoregressive models

Threshold autoregressive models can be used to study processes that are characterized by recurrent switches between two or more regimes, where switching is triggered by a manifest threshold variable. In this paper the performance of diverse information criteria for selecting the number of regimes in small to moderate sample sizes (i.e., n=50,100,200) is investigated. In addition it is investigated whether these information criteria can be used to determine whether the residual variances are identical across the regimes. It is concluded that for small sample sizes should be preferred, while for larger sample sizes either BIC or should be considered: The latter is the only information criterion that includes a penalty for the unknown threshold parameters.     

Cut-free sequent and tableau systems for propositional Diodorean modal logics

We present sound, (weakly) complete and cut-free tableau systems for the propositional normal modal logicsS4.3, S4.3.1 andS4.14. When the modality is given a temporal interpretation, these logics respectively model time as a linear dense sequence of points; as a linear discrete sequence of points; and as a branching tree where each branch is a linear discrete sequence of points.Although cut-free, the last two systems do not possess the subformula property. But for any given finite set of formulaeX the superformulae involved are always bounded by a finite set of formulaeX* _L depending only onX and the logicL. Thus each system gives a nondeterministic decision procedure for the logic in question. The completeness proofs yield deterministic decision procedures for each logic because each proof is constructive.Each tableau system has a cut-free sequent analogue proving that Gentzen's cut-elimination theorem holds for these latter systems. The techniques are due to Hintikka and Rautenberg.Presented byDov M. Gabbay     

ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse

Grammar logics were introduced by Fariñas del Cerro and Penttonen in 1988 and have been widely studied. In this paper we consider regular grammar logics with converse (REG ^c logics) and present sound and complete tableau calculi for the general satisfiability problem of REG ^c logics and the problem of checking consistency of an ABox w.r.t. a TBox in a REG ^c logic. Using our calculi we develop ExpTime (optimal) tableau decision procedures for the mentioned problems, to which various optimization techniques can be applied. We also prove a new result that the data complexity of the instance checking problem in REG ^c logics is coNP-complete.     

Dissimilarity cumulation theory in arc-connected spaces

This paper continues the development of the Dissimilarity Cumulation theory and its main psychological application, Universal Fechnerian Scaling [Dzhafarov, E.N and Colonius, H. (2007). Dissimilarity Cumulation theory and subjective metrics. Journal of Mathematical Psychology, 51, 290-304]. In arc-connected spaces the notion of a chain length (the sum of the dissimilarities between the chain’s successive elements) can be used to define the notion of a path length, as the limit inferior of the lengths of chains converging to the path in some well-defined sense. The class of converging chains is broader than that of converging inscribed chains. Most of the fundamental results of the metric-based path length theory (additivity, lower semicontinuity, etc.) turn out to hold in the general dissimilarity-based path length theory. This shows that the triangle inequality and symmetry are not essential for these results, provided one goes beyond the traditional scheme of approximating paths by inscribed chains. We introduce the notion of a space with intermediate points which generalizes (and specializes to when the dissimilarity is a metric) the notion of a convex space in the sense of Menger. A space is with intermediate points if for any distinct there is a different point such that (where D is dissimilarity). In such spaces the metric G induced by D is intrinsic: coincides with the infimum of lengths of all arcs connecting to In Universal Fechnerian Scaling D stands for either of the two canonical psychometric increments and (ψ denoting discrimination probability). The choice between the two makes no difference for the notions of arc-connectedness, convergence of chains and paths, intermediate points, and other notions of the Dissimilarity Cumulation theory.     

LSD response in Eysenckian trait types identified by polypredictive CFA

The four personality type combinations derived from high and low extraversion () and high and low neuroticism () have been related to response patterns composed of three symptoms (affective disturbances, thinking disturbances, and blackouts) scored as present (+) or absent (−) after a single oral dose of the hallucinogenic drug LSD-25. Hypotheses for expected response patterns for each personality group were derived from a data set obtained by Kohnen and Lienert (1987). Significance of associations was tested by two strategies of polyprediction configural frequency analysis (CFA): multiple uniprediction and biprediction CFA. Both strategies yielded a significant hyperpresentation of all three symptoms present in E+N+ (hysterics), merely thinking disorders in dysthymics (E−N+), merely affective symptoms in E+N− (stable extraverts), and merely blackouts in N−E− (stable introverts). Authors tried to relate these symptoms to Kretschmer's temperament types and could afterwards show by a chessboard modification of prediction CFA, that by applying two combined hypotheses for two personality types each, the significance of the predicted associations could be increased.     

Superintuitionistic Companions of Classical Modal Logics

This paper investigates partitions of lattices of modal logics based on superintuitionistic logics which are defined by forming, for each superintuitionistic logic L and classical modal logic , the set L[] of L-companions of . Here L[] consists of those modal logics whose non-modal fragments coincide with L and which axiomatize if the law of excluded middle p V p is added. Questions addressed are, for instance, whether there exist logics with the disjunction property in L[], whether L[] contains a smallest element, and whether L[] contains lower covers of . Positive solutions as concerns the last question show that there are (uncountably many) superclean modal logics based on intuitionistic logic in the sense of Vakarelov [28]. Thus a number of problems stated in [28] are solved. As a technical tool the paper develops the splitting technique for lattices of modal logics based on superintuitionistic logics and ap plies duality theory from [34].     

Decidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤ω

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers p, p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure. If the permitted accessibility relations are arbitrary partial orders, the resulting logic is known to be recursively isomorphic to full second-order logic (Kremer, 1997). It is shown that if the Kripke structures are restricted to trees of at height and width at most , the resulting logics are decidable. This provides a partial answer to a question by Kremer. The result also transfers to modal S4 and some Gödel–Dummett logics with quantifiers over propositions.     

AN INTUITIONISTIC CHARACTERIZATION OF CLASSICAL LOGIC

By introducing the intensional mappings and their properties, we establish a new semantical approach of characterizing intermediate logics. First prove that this new approach provides a general method of characterizing and comparing logics without changing the semantical interpretation of implication connective. Then show that it is adequate to characterize all Kripke_complete intermediate logics by showing that each of these logics is sound and complete with respect to its (unique) ‘weakest characterization property’ of intensional mappings. In particular, we show that classical logic has the weakest characterization property , which is the strongest among all possible weakest characterization properties of intermediate logics. Finally, it follows from this result that a translation is an embedding of classical logic into intuitionistic logic, iff. its semantical counterpart has the property .      

Sequential learning using temporal context

The temporal context model (TCM) has been extensively applied to recall phenomena from episodic memory. Here we use the same formulation of temporal context to construct a sequential learning model called the predictive temporal context model (pTCM) to extract the generating function of a language from sequentially-presented words. In pTCM, temporal context is used to generate a prediction vector at each step of learning and these prediction vectors are in turn used to construct semantic representations of words on the fly. The semantic representation of a word is defined as the superposition of prediction vectors that occur prior to the presentation of the word in the sequence. Here we create a formal framework for pTCM and prove several useful results. We explore the effect of manipulating the parameters of the model on learning a sequence of words generated by a bi-gram generating function. In this simple case, we demonstrate that feeding back the constructed semantic representation into the temporal context during learning improves the performance of the model when trained with a finite training sequence from a language with equivalence classes among some words. We also describe , a variant of the model that is identical to pTCM at steady state. has significant computational advantages over pTCM and can improve the quality of its prediction for some training sequences.