A sequence x=xn:nω of elements of a complete Boolean algebra converges to a priori if lim infx=lim supx=b. The sequential topology τs on is the maximal topology on such that x→b implies x→τsb, where →τs denotes the convergence in the space — the a posteriori convergence. These two forms of convergence, as well as the properties of the sequential topology related to forcing, are investigated. So, the a posteriori convergence is described in terms of killing of tall ideals (...) on ω, and it is shown that the a posteriori convergence is equivalent to the a priori convergence iff forcing by does not produce new reals. A property of c.B.a.’s, satisfying -cc -cc and providing an explicit definition of the a posteriori convergence, is isolated. Finally, it is shown that, for an arbitrary c.B.a. , the space is sequentially compact iff the algebra has the property and does not produce independent reals by forcing, and that implies P is the unique sequentially compact c.B.a. in the class of Suslin forcing notions. (shrink)

Causal Decision Theory reckons the choice-worthiness of an option to be completely independent of its evidential bearing on its non-effects. But after one has made a choice this bearing is relevant to future decisions. Therefore it is possible to construct problems of sequential choice in which Causal Decision Theory makes a guaranteed loss. So Causal Decision Theory is wrong. The source of the problem is the idea that agents have a special perspective on their own contemplated actions, from which (...) evidential connections that observers can see are either irrelevant or invisible. (shrink)

In the first author's thesis [10], a sequential language, LRT, for real number computation is investigated. That thesis includes a proof that all polynomials are programmable, but that work comes short of giving a complete characterization of the expressive power of the language even for first-order functions. The technical problem is that LRT is non-deterministic. So a natural characterization of its expressive power should be in terms of relations rather than in terms of functions. In [2], Brattka examines a (...) formalization of recursive relations in the style of Kleene's recursive functions on the natural numbers. This paper is an expanded version of [13] which establishes the expressive power of LRTp, a variant of LRT, in terms of Brattka's recursive relations. Because Brattka already did the work of establishing the precise connection between his recursive relations and Type 2 Theory of Effectivity, we thus obtain a complete characterization of first-order definability in LRTp. (shrink)

We deal with situations incongruent with our automatic response tendencies much better right after having done so on a previous trial than after having reacted to a congruent trial. The nature of the mechanisms responsible for these sequential congruency effects is currently a hot topic of debate. According to the conflict monitoring model these effects depend on the adjustment of control triggered by the detection of conflict on the preceding situation. We tested whether these conflict monitoring processes can operate (...) implicitly in an implicit learning procedure, modulating the expression of knowledge of which participants are not aware. We reanalyze recently published data, and present an experiment with a probabilistic sequence learning procedure, both showing consistent effects of implicit sequence learning. Despite being implicit, the expression of learning was reduced or completely eliminated right after trials incongruent with the learned sequence, thus showing that sequential congruency effects can be obtained even when the source of congruency itself remains implicit. (shrink)

In this paper we study 12 four-valued logics arisen from Belnap's truth and/or knowledge four-valued lattices, with or without constants, by adding one or both or none of two new non-regular operations—classical negation and natural implication. We prove that the secondary connectives of the bilattice four-valued logic with bilattice constants are exactly the regular four-valued operations. Moreover, we prove that its expansion by any non-regular connective (such as, e.g., classical negation or natural implication) is strictly functionally complete. Further, finding axiomatizations (...) of the quasi varieties generated by the 12 logics involved (that prove to be varieties), we find naturell equational axiomatizations of these logics. Finally, applying Pynko's general theory of algebraizable sequential consequence operations, we also find equivalent natural sequentiell axiomatizations of the logics under consideration that expand either of two Pynko's sequential calculi for the constant-free truth-lattice four-valued logic. (shrink)

We introduce a substructural propositional calculus of Sequential Dynamic Logic that subsumes a propositional part of dynamic predicate logic, and is shown to be expressively equivalent to propositional dynamic logic. Completeness of the calculus with respect to the intended relational semantics is established.

Eichenbaum et al. (1994a) hypothesized that perceptually distinct items and the relations among them are processed sequentially by the parahippocampal region and the hippocampal formation, respectively. Predictions based solely on their model's sequential-processing feature might prove easier to disconfirm than those based on its representational features. Two such predictions are discussed: (1) double dissociations should be impossible following hippocampal vs. parahippocampal lesions, and (2) hippocampal lesions should not exacerbate impairments that follow complete parahippocampal lesions.

We show: iff every countable product of sequential metric spaces (sequentially closed subsets are closed) is a sequential metric space iff every complete metric space is Cantor complete. Every infinite subset X of has a countably infinite subset iff every infinite sequentially closed subset of includes an infinite closed subset. The statement “ is sequential” is equivalent to each one of the following propositions: Every sequentially closed subset A of includes a countable cofinal subset C, for every (...) sequentially closed subset A of, is a meager subset of, for every sequentially closed subset A of,, every sequentially closed subset of is separable, every sequentially closed subset of is Cantor complete, every complete subspace of is Cantor complete. (shrink)

Under the axiom of choice, every first countable space is a Fréchet-Urysohn space. Although, in its absence even ℝ may fail to be a sequential space.Our goal in this paper is to discuss under which set-theoretic conditions some topological classes, such as the first countable spaces, the metric spaces, or the subspaces of ℝ, are classes of Fréchet-Urysohn or sequential spaces.In this context, it is seen that there are metric spaces which are not sequential spaces. This fact (...) raises the question of knowing if the completion of a metric space exists and it is unique. The answer depends on the definition of completion.Among other results it is shown that: every first countable space is a sequential space if and only if the axiom of countable choice holds, the sequential closure is idempotent in ℝ if and only if the axiom of countable choice holds for families of subsets of ℝ, and every metric space has a unique equation image-completion. (shrink)

This report concerns the fragmented visual percepts in a woman, TR, following a right entorhinal–perirhinal infarct. In a previous report, Weddell [Weddell, R. A. . A visual disorder producing highly selective deletion of recurring letters. Cortex, 41, 471–485] linked TR’s highly selective tendency to delete recurrent letters with her fragmented percepts. The conflation of same-identity form elements was attributed to anterior extrastriate damage, which reduced the amount of information sustainable in fully resolved visual percepts, and the present experimental investigation of (...) her subjective account of segment formation and resolution completes the story. She said that complex objects and long words first appeared as blurred regions, which sometimes included form elements. It is argued that figure-centred attentional mechanisms subdivided this blurred region into up to 3–4 parts. String length, lexical status , and background colour and/or luminance determined fragment length. Two rules described the fragment resolution sequence: largest segments usually resolved first, left-to-right resolution accounting for a few sequences. This resolution sequence occurred when stimuli were exposed too briefly for saccadic exploration, implicating endogenous attentional shifts. Experiment 4 confirmed TR’s assertion that spatial, orthographic, and phonological information were stored during the fragment resolution process. Moreover, TR exerted considerable voluntarily control over the fragment resolution sequence and some influence over fragment length. Finally, these findings were interpreted in terms of an extended version of a neural network model of vision largely derived from nonhuman primate studies. (shrink)

We prove in the framework of Bishop's constructive mathematics that the sequential completion equation image of the space [MATHEMATICAL SCRIPT CAPITAL D] is filter-complete. Then it follows as a corollary that the filter-completeness of [MATHEMATICAL SCRIPT CAPITAL D] is equivalent to the principle BD-ℕ, which can be proved in classical mathematics, Brouwer's intuitionistic mathematics and constructive recursive mathematics of Markov's school, but does not in Bishop's constructive mathematics. We also show that equation image is identical with the filter-completion (...) which was provided by Bishop. (shrink)

Rice Combinational and Sequential Logic This text provides a guide to combinational and sequential logic, introducing students to the basic concepts then progressing to HND/first year undergraduate level. It has a highly practical emphasis, enabling the reader to simulate, build and test the circuits discussed in the text. Electronics Workbench files are provided for simulation, while easy-to-use XPLA software and specially designed hardware encourage the reader to build and test the circuits using programmable logic. The text itself contains (...) many self-assessment questions, complete with detailed answers, allowing students to test themselves as they learn. No previous experience of the topic is required and an abundance of practical examples helps students to apply the basic principles. The accompanying CD-ROM provides the XPLA development system software and Electronics Workbench files, as well as the Xilinx Webpack development system and 'walkthrough'. Hardware for Programmable Logic experiments can either be purchased or built following instructions from the text. Altogether, the text, software and hardware provide an interactive and stimulating teaching and learning resource. F. (shrink)

When we learn how to throw darts we adjust how we throw based on where the darts stick. Much of skill learning is computationally similar in that we learn using feedback obtained after the completion of individual actions. We can formalize such tasks as a search problem; among the set of all possible actions, find the action that leads to the highest reward. In such cases our actions have two objectives: we want to best utilize what we already know (exploitation), (...) but we also want to learn to be more successful in the future (exploration). Here we tested how participants learn movement trajectories where feedback is provided as a monetary reward that depends on the chosen trajectory. We mathematically derived the optimal search policy for our experiment using decision theory. The search behavior of participants is well predicted by an ideal searcher model that optimally combines exploration and exploitation. (shrink)

The results of a hypothetical experiment requiring a sequence of quantum measurements are obtained retrospectively, after the experiment has been completed, from a single reading of an “apparatus register.” The experiment is carried out reversibly and Schrödinger's equation is satisfied until the terminal reading of the register. The technique is illustrated using a feasible method of measuring photon spin as the quantum “object” observable and using the photon energy as the “apparatus register.” The technique is used to discuss the “watchdog” (...) effect, the effect of repeated measurements inhibiting quantum jumps. (shrink)

Once assessments and continuers are focussed on as distinguishable phenomena it becomes clear that they differ from each other not just in the details of their sequential placement within an extended turn, but in other significant ways as well.First, though assessments can take the form of talk with clear lexical content (for example `Oh wow' and assessment adjectives such as ‘beautiful’), they can also be done with sounds such as ‘Ah:::’ whose main function seems to be the carrying of (...) an appropriate intonation contour, as well as gesturally (cf. M. Goodwin, 1980). In this they resemble continuers, which can be performed both with talk whose lexical status is not always granted, and with appropriate gestures such as nods. In view of the way in which both continuers and brief assessments are characteristically situated within a rather specialized environment, the ongoing talk of another, it is not surprising that they share these characteristics. Indeed in so far as these features provide minimal lexical and auditory interference with the other talk already in progress, they are precisely some of the adaptations that would be expected of action able to function in such an environment. Given such structural similarity in action that is also quite brief, the clarity with which assessments can be distinguished from continuers becomes interesting. If in fact these objects are doing different work in the same environment, the salience of their distinctness from each other becomes an important feature of the structure of each. In view of the economy and clarity that brief assessments require, it is all the more remarkable that many of them, through the details of the way in which they are pronounced and their intonation contour, are able to convey quite detailed, even intricate, information about their speaker's involvement in both the assessment and the talk of the moment.Second, while ‘uh huh’ seems to be restricted to placement in the midst of extended talk by another, assessments can occur at the completion of such extended turns as well. Indeed assessments are one of the prototypical ways of bringing an extended turn such as a story to completion. Such differential placement is quite compatible with what has already been noted about the organization of these phenomena. For example, insofar as a continuer treats the talk just heard as preliminary to further talk it would be quite inappropriate as a technique for marking completion of an extended turn. On the other hand by virtue of the way in which they appreciate the details of what has just been said without marking that talk as a prelude to something else, assessments are apt structures for doing terminal work on an extended sequence.Third, ‘uh huh’ seems to be an exclusively recipient action — indeed its work as a continuer is accomplished precisely through placement relative to more extended talk by another speaker. Assessments, however, can be done by speaker as well as recipient.Fourth, though analysis in the present paper has focussed on brief assessments (the type of assessment most similar in form to continuers), assessments unlike continuers can in fact take many shapes, some of them quite elaborate with, for example, extended sentences and even sequences of turns being devoted exclusively to the activity of doing an assessment.In sum, alternative types of action are available to recipients for constructing responses in the midst of another's extended talk. Though the responses themselves are typically brief, the presence of alternatives that can be placed in a variety of sequential positions provides recipients with resources that enable them to participate in speaker's emerging talk in a differentiated fashion, something which has consequences for speaker's actions as well. (shrink)

We define a complete measurement of a quantum observable (POVM) as a measurement of the maximally refined (rank-1) version of the POVM. Complete measurements give information on the multiplicities of the measurement outcomes and can be viewed as state preparation procedures. We show that any POVM can be measured completely by using sequential measurements or maximally refinable instruments. Moreover, the ancillary space of a complete measurement can be chosen to be minimal.

A weak constructive sequential compactness property of metric spaces is introduced. It is proved that for complete, totally bounded metric spaces this property is equivalent to Brouwer's fan theorem for detachable bars. Our results form a part of constructive reverse mathematics.

The ability to sequence thoughts and actions is impaired in Parkinson’s disease. In PD, a distinct error pattern has been found in the offline performance of sequential working memory. This study examined how PD’s performance of sequential working memory unfolds over time using mouse tracking techniques. Non-demented patients with mild PD and healthy controls completed a computerized digit ordering task with a computer mouse. We measured response dynamics in terms of the initiation time, ordering time, movement time, and (...) area under the movement trajectory curve. This approach allowed us to distinguish between the cognitive processes related to sequence processing before the actual movement and the execution processes of the actual movement. PD patients showed longer initiation times, longer movement times, and more constrained movement trajectories than healthy controls. The initiation time and ordering time negatively correlated with the daily exposure to levodopa and D2/3 receptor agonists, respectively. The movement time positively correlated with the severity of motor symptoms. We demonstrated an altered temporal profile of sequential working memory in PD. Stimulating D1 and D2/3 receptors might speed up the maintenance and manipulation of sequences, respectively. (shrink)

Quasi-Boolean modal algebras are quasi-Boolean algebras with a modal operator satisfying the interaction axiom. Sequential quasi-Boolean modal logics and the relational semantics are introduced. Kripke-completeness for some quasi-Boolean modal logics is shown by the canonical model method. We show that every descriptive persistent quasi-Boolean modal logic is canonical. The finite model property of some quasi-Boolean modal logics is proved. A cut-free Gentzen sequent calculus for the minimal quasi-Boolean logic is developed and we show that it has the Craig (...) interpolation property. (shrink)

The paper offers a logical characterisation of multi-step actions in the context of deontic notions of obligation, permission and prohibition. Deontic notions for sequentially composed actions are founded on deontic notions for one-step actions. The present work includes a formal study of situations where execution of a multi-step action has been unsuccessful and provides normative analysis of such actions.

For a countable complete o-minimal theory T, we introduce the notion of a sequentially complete model of T. We show that a model M of T is sequentially complete if and only if $\mathscr{M} \prec \mathscr{N}$ for some Dedekind complete model N. We also prove that if T has a Dedekind complete model of power greater than 2 ℵ 0 , then T has Dedekind complete models of arbitrarily large powers. Lastly, we show that a dyadic theory--namely, a theory relative (...) to which every formula is equivalent to a Boolean combination of formulas in two variables--that has some Dedekind complete model has Dedekind complete models in arbitrarily large powers. (shrink)

We introduce quantificational modal operators as dynamic modalities with (extensions of) Henkin quantifiers as indices. The adoption of matrices of indices (with action identifiers, variables and/or quantified variables as entries) gives an expressive formalism which is here motivated with examples from the area of multi-agent systems. We study the formal properties of the resulting logic which, formally speaking, does not satisfy the normality condition. However, the logic admits a semantics in terms of (an extension of) Kripke structures. As a consequence, (...) standard techniques for normal modal logic become available. We apply these to prove completeness and decidability, and to extend some standard frame results to this logic. (shrink)

A sequential, hierarchical stage model of empathy can account for a comprehensive range of empathic behaviors. We provide an illustrative table, “Stages of Empathy,” to demonstrate how increasingly complex empathic behaviors emerge at each stage, beginning with the infant's “automatic empathy” and ending with the advanced adult's “coconstruction of empathetic reality.”.

Feynman's sum-over-histories formulation of quantum mechanics has been considered a useful calculational tool in which virtual Feynman histories entering into a coherent quantum superposition cannot be individually measured. Here we show that sequential weak values, inferred by consecutive weak measurements of projectors, allow direct experimental probing of individual virtual Feynman histories, thereby revealing the exact nature of quantum interference of coherently superposed histories. Because the total sum of sequential weak values of multitime projection operators for a complete set (...) of orthogonal quantum histories is unity, complete sets of weak values could be interpreted in agreement with the standard quantum mechanical picture. We also elucidate the relationship between sequential weak values of quantum histories with different coarse graining in time and establish the incompatibility of weak values for nonorthogonal quantum histories in history Hilbert space. Bridging theory and experiment, the presented results may enhance our understanding of both weak values and quantum histories. (shrink)

Past studies have reported emotional intelligence as a relevant factor in development and maintenance of eating disorders, as well as in increasing self-esteem and reducing anxiety. Similarly, research has showed that anxiety and self-esteem are positively and negatively associated to ED criteria, respectively. However, no prior studies have yet tested the multiple intervening roles of both self-esteem and anxiety as potential mediators of the association between EI and ED symptomatology. The present study aims to bridge these gaps by testing a (...) sequential path model. Specifically, we examine the potential sequential mediation effects of self-esteem-anxiety on the link between EI and ED. A sample composed of 516 Spanish undergraduate students and community adults completed measures of EI, self-esteem, anxiety, and ED symptomatology. The results show that high levels of EI were positively associated with self-esteem and negatively associated with anxiety and ED symptoms. Anxiety was positively associated to ED symptoms, while self-esteem levels were negatively linked to ED symptoms. Moreover, path analyses showed that self-esteem and anxiety fully mediated the relationship between EI and ED symptoms in sequence. These findings suggest that EI plays a key role in reducing symptomatology of ED through increased self-esteem and reduced anxiety symptoms, providing novel evidence regarding psychological mechanisms through which EI contributes to a reduction of ED symptomatology. Implications for assessing and improving these psychological resources in ED preventive programs are discussed. (shrink)

Mental fatigue can be studied by using either the time-on-task protocol or the sequential task protocol. In the time-on-task protocol, participants perform a long and effortful task and a decrease in performance in this task is generally observed over time. In the sequential task protocol, a first effortful or control task is followed by a second effortful task. The performance in the second task is generally worse after the effortful task than after the control task. The principal aim (...) of the present experiment is to examine the relationship between these two decrements in performance while concomitantly using a sequential task protocol and assessing the performance of the first effortful task as a function of time-on-task. We expect a positive correlation between these two decrements in performance. A total of 83 participants performed a 30-min fatiguing mental task or a control task followed by a time-to-exhaustion handgrip task. As expected, this protocol combining the time-on-task and sequential task protocols allowed us to observe a decrease in performance over time during the Stroop task, a worst performance in the handgrip task after the Stroop task by comparison to the control task, a positive correlation between these two effects. The decrease in performance during the Stroop task also correlated with the subjective measures of boredom and fatigue, whereas the detrimental effect observed in the handgrip task did not. Our findings suggest that the two fatigue-related phenomena share a common mechanism but are not completely equivalent. (shrink)

Important strides have been made toward understanding the relationship between self-efficacy and life satisfaction. However, existing studies have largely focused on work and academic domains, leaving self-efficacy in the finance domain less frequently investigated. The present study applied the self-efficacy construct to the finance domain, namely “financial self-efficacy”, and tested the sequential mediating roles of high standards tendency and investment satisfaction in the relationship between FSE and general life satisfaction. A total of 323 employees from finance-related businesses completed anonymous (...) questionnaires regarding FSE, high standards tendency, investment satisfaction, and general life satisfaction. Results indicated that FSE influenced general life satisfaction through investment satisfaction, and sequentially through high standards tendency and investment satisfaction. These results provide contributions to the current literature on life satisfaction, and positive psychology literature by shedding light on the roles of high standards tendency and investment satisfaction in the relation between FSE and general life satisfaction. (shrink)

We show, within the framework of Bishop's constructive mathematics, that (sequential) completeness of the locally convex space $\mathcal{D} (\mathbb{R})$ of test functions is equivalent to the principle BD-N which holds in classical mathemtatics, Brouwer's intuitionism and Markov's constructive recursive mathematics, but does not hold in Bishop's constructivism.

We show, within the framework of Bishop's constructive mathematics, that (sequential) completeness of the locally convex space $\mathcal{D} (\mathbb{R})$ of test functions is equivalent to the principle BD-N which holds in classical mathemtatics, Brouwer's intuitionism and Markov's constructive recursive mathematics, but does not hold in Bishop's constructivism.

Game logics describe general games through powers of players for forcing outcomes. In particular, they encode an algebra of sequential game operations such as choice, dual and composition. Logic games are special games for specific purposes such as proof or semantical evaluation for first-order or modal languages. We show that the general algebra of game operations coincides with that over just logical evaluation games, whence the latter are quite general after all. The main tool in proving this is a (...) representation of arbitrary games as modal or first-order evaluation games. We probe how far our analysis extends to product operations on games. We also discuss some more general consequences of this new perspective for standard logic. (shrink)

In order to improve our understanding of whether and how spiritual leadership promotes positive work-family outcomes from a resource perspective, this study proposed and tested for the first time a conceptual model incorporating job resources and psychological capital as the mediating factors between spiritual leadership and facilitation. We tested a theoretical model with date obtained from 529 Chinese workers who completed questionnaires in a four-wave survey. The results showed that the relationship between spiritual leadership and work-to-family facilitation was mediated by (...) job resources alone, as well as job resources and psychological capital in sequence. Thus, this research may also pave the way for future spiritual leadership research on follower outcomes in other domains by shifting the present spiritual leadership research focus from work outcomes to personal life. Implications for theory, managerial practices, limitation, and future research were discussed. (shrink)

System image is an extension of multiplicative linear logic with the rules mix, nullary mix, and a self-dual, noncommutative logical operator, called seq. While the rules mix and nullary mix extend the deductive system, the operator seq extends the language of image. Due to the operator seq, system image extends the applications of image to those where the sequential composition is crucial, e.g., concurrency theory. System image is an extension of image with the rules mix and nullary mix. In (...) this paper, by relying on the fact that system image is a conservative extension of system image, I show that system image is NP-complete by encoding the 3-Partition problem in image. I provide a simple completeness proof of this encoding by resorting to a novel proof theoretical method for reducing nondeterminism in proof search, which is also of independent interest. (shrink)

A complete Boolean algebra ${\mathbb{B}}$ satisfies property ${(\hbar)}$ iff each sequence x in ${\mathbb{B}}$ has a subsequence y such that the equality lim sup z n = lim sup y n holds for each subsequence z of y. This property, providing an explicit definition of the a posteriori convergence in complete Boolean algebras with the sequential topology and a characterization of sequential compactness of such spaces, is closely related to the cellularity of Boolean algebras. Here we determine the (...) position of property ${(\hbar)}$ with respect to the hierarchy of conditions of the form κ-cc. So, answering a question from Kurilić and Pavlović (Ann Pure Appl Logic 148(1–3):49–62, 2007), we show that ${``\mathfrak{h}{\rm -cc}\Rightarrow (\hbar)"}$ is not a theorem of ZFC and that there is no cardinal ${\mathfrak{k}}$ , definable in ZFC, such that ${``\mathfrak{k} {\rm -cc} \Leftrightarrow (\hbar)"}$ is a theorem of ZFC. Also, we show that the set ${\{ \kappa : {\rm each}\, \kappa{\rm -cc\, c.B.a.\, has}\, (\hbar ) \}}$ is equal to ${[0, \mathfrak{h})}$ or ${[0, {\mathfrak h}]}$ and that both values are consistent, which, with the known equality ${{\{\kappa : {\rm each\, c.B.a.\, having }\, (\hbar )\, {\rm has\, the}\, \kappa {\rm -cc } \} =[{\mathfrak s}, \infty )}}$ completes the picture. (shrink)

In this paper, we address the larger notion of cooperation in interaction and its underlying dimensions as defined in Conversation Analysis: alignment and affiliation. Focusing on three cases from three different languages we investigate a specific practice, that of anticipatory completions, in a particular context, that of storytelling, and show that the practice of completing another speaker’s turn in an anticipatory manner is not de facto definable as either an aligning or non-aligning action, nor can it be said to be (...) either affiliating or non-affiliating. Through our analyses, we aim to distinguish and illustrate the manifold layers of and perspectives to alignment and affiliation and argue for their relevance for studies of interactional phenomena. We conclude that the notion of cooperation and its implementation through affiliating and/or aligning actions is a multi-layered and complex issue, the intricacies of which are best understood and captured through detailed sequential analyses. (shrink)

The purpose of this paper is an axiomatic study of the interrelations between certain continuity properties. We deal with principles which are equivalent to the statements "every mapping is sequentially nondiscontinuous", "every sequentially nondiscontinuous mapping is sequentially continuous", and "every sequentially continuous mapping is continuous". As corollaries, we show that every mapping of a complete separable space is continuous in constructive recursive mathematics (the Kreisel-Lacombe-Schoenfield-Tsejtin theorem) and in intuitionism.

Some spatio-temporal structures are easier to transfer implicitly in sequential learning. In this study, we investigated whether the consistent reversal of triads of learned components would support the implicit transfer of their temporal structure in visuomotor sequence learning. A triad comprised three sequential button presses ([1][2][3]) and seven consecutive triads comprised a sequence. Participants learned sequences by trial and error, until they could complete it 20 times without error. Then, they learned another sequence, in which each triad was (...) reversed ([3][2][1]), partially reversed ([2][1][3]), or switched so as not to overlap with the other conditions ([2][3][1] or [3][1][2]). Even when the participants did not notice the alternation rule, the consistent reversal of the temporal structure of each triad led to better implicit transfer; this was confirmed in a subsequent experiment. These results suggest that the implicit transfer of the temporal structure of a learned sequence can be influenced by both the structure and consistency of the change. (shrink)

Research on escalation of commitment has predominantly been studied in the context of a single decision without consideration for the psychological consequences of escalating. This study sought to examine a) the extent to which people escalate their commitment to a failing course of action in a sequential decision-making task, b) confidence and anger as psychological consequences of escalation of commitment, and c) the reciprocal relationship between escalation of commitment and confidence and anger. Participants were 110 undergraduate students who completed (...) a series of investment decisions regarding a failing endeavor. Results revealed that although a high proportion of individuals escalate through all decisions, the extent to which they escalated decreased with each decision as they were less willing to invest money in the project. Furthermore, as participants escalated, confidence in one’s decision decreased and anger increased. Lastly, the analyses revealed that the relationship between escalation and confidence is reciprocal. Escalation was negatively associated with confidence, and confidence predicted escalation in the subsequent decision. These results highlight the importance of considering both the determinants and psychological consequences of escalation of commitment. (shrink)

Sequential von Neumann–Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. We show that sequential VM games with countably many actions and continuous utility functions have a sound and complete axiomatization in the situation calculus. This axiomatization allows us to represent game-theoretic reasoning and solution concepts such as Nash equilibrium. We discuss the application of various concepts from VM game theory to the theory of planning (...) and multi-agent interactions, such as representing concurrent actions and using the Baire topology to define continuous payoff functions. (shrink)

This paper examines an aspect of the grammar-interaction interface with respect to how participants orient to intra-turn phrasal unit boundaries as a locus that has interactional import for turn and sequence organization in Korean conversation. Phrasal unit boundaries in Korean serve as a space within a turn in which the speaker of the turn in-progress invites the recipient to acknowledge the speaker's point expressed up-to-that-point and collaboratively display his/her understanding thereof. In a sequentially and topically 'ripe' context, such unit boundaries (...) often constitute places where more active participation on the part of the recipient is invited in the form of collaborative completion in which the recipient co-constructs the primary speaker's on-going turn. Phrasal unit boundaries also provide interactional resources which the speaker may exploit to sequentially delete out a problem in talk, e.g., by a sort of tying operation in which a subsequently added phrasal unit ties back to the speaker's previous utterance to the effect that the intervening talk containing a problem is canceled out by way of being shown to have been an interruption of the speaker's turn in-progress. This practice points to an aspect of the way in which the 'agglutinative' grammatical process involving the use of phrasal units shapes interactional patterns as observed in the course of organizing turns/sequences and managing problems in talk. (shrink)

This paper, being a companion to the book [2] elaborates the deontology of sequential and compound actions based on relational models and formal constructs borrowed from formal linguistics. The semantic constructions presented in this paper emulate to some extent the content of [3] but are more involved. Although the present work should be regarded as a sequel of [3] it is self-contained and may be read independently. The issue of permission and obligation of actions is presented in the form (...) of a logical system. This system is semantically defined by providing its intended models in which the role of actions of various types is accentuated. Since the consequence relation is not finitary, other semantically defined variants of are defined. The focus is on the finitary system in which only finite compound actions are admissible. An adequate axiom system for it is defined. The strong completeness theorem is the central result. The role of the canonical model in the proof of the completeness theorem is emphasized. (shrink)