According to T. M. Scanlon’s anti-aggregation principle, it is wrong to save a larger number of people from minor harms rather than a smaller number from much more serious harms. This principle is a central part of many influential and anti-utilitarian ethical theories. According to the sequential-dominance principle, one does something wrong if one knowingly performs a sequence of acts whose outcome would be worse for everyone than the outcome of an alternative sequence of acts. The intuitive appeal of the (...) sequential-dominance principle should be obvious; everyone is knowingly made worse off if it is violated. In this paper, I present a number of cases where one is forced to violate either the anti-aggregation principle or the sequential-dominance principle. I show that these principles conflict regardless of whether one accepts a counterfactual or a temporal, worsening view of harm. Moreover, I show that this result holds regardless of how much worse a harm has to be in order to count as a much more serious harm. (shrink)

The effect of recent experience on current behavior has been studied extensively in simple laboratory tasks. We explore the nature of sequential effects in the more naturalistic setting of automobile driving. Driving is a safety-critical task in which delayed response times may have severe consequences. Using a realistic driving simulator, we find significant sequential effects in pedal-press response times that depend on the history of recent stimuli and responses. Response times are slowed up to 100 ms in particular cases, a (...) delay that has dangerous practical consequences. Further, we observe a significant number of history-related pedal misapplications, which have recently been noted as a cause for concern in the automotive safety community. By anticipating these consequences of sequential context, driver assistance systems could mitigate the effects of performance degradations and thus critically improve driver safety. (shrink)

Text classification involves deciding whether or not a document is about a given topic. It is an important problem in machine learning, because automated text classifiers have enormous potential for application in information retrieval systems. It is also an interesting problem for cognitive science, because it involves real world human decision making with complicated stimuli. This paper develops two models of human text document classification based on random walk and accumulator sequential sampling processes. The models are evaluated using data from (...) an experiment where participants classify text documents presented one word at a time under task instructions that emphasize either speed or accuracy, and rate their confidence in their decisions. Fitting the random walk and accumulator models to these data shows that the accumulator provides a better account of the decisions made, and a “balance of evidence” measure provides the best account of confidence. Both models are also evaluated in the applied information retrieval context, by comparing their performance to established machine learning techniques on the standard Reuters‐21578 corpus. It is found that they are almost as accurate as the benchmarks, and make decisions much more quickly because they only need to examine a small proportion of the words in the document. In addition, the ability of the accumulator model to produce useful confidence measures is shown to have application in prioritizing the results of classification decisions. (shrink)

Prediction‐based processes appear to play an important role in language. Few studies, however, have sought to test the relationship within individuals between prediction learning and natural language processing. This paper builds upon existing statistical learning work using a novel paradigm for studying the on‐line learning of predictive dependencies. Within this paradigm, a new “prediction task” is introduced that provides a sensitive index of individual differences for developing probabilistic sequential expectations. Across three interrelated experiments, the prediction task and results thereof are (...) used to bridge knowledge of the empirical relation between statistical learning and language within the context of nonadjacency processing. We first chart the trajectory for learning nonadjacencies, documenting individual differences in prediction learning. Subsequent simple recurrent network simulations then closely capture human performance patterns in the new paradigm. Finally, individual differences in prediction performances are shown to strongly correlate with participants’ sentence processing of complex, long‐distance dependencies in natural language. (shrink)

We relate two sequential models of PCF: the sequential algorithm model due to Berry and Curien and the strongly stable model due to Bucciarelli and the author. More precisely, we show that all the morphisms araising in the strongly stable model of PCF are sequential in the sense that they are the “extensional projections” of some sequential algorithms. We define a model of PCF where morphisms are “extensional” sequential algorithms and prove that any equation between PCF terms which holds in (...) this model also holds in the strongly stable model. (shrink)

In this paper we suggest a model of sequential auctions with endogenous participation where each bidder conjectures about the number of participants at each round. Then, after learning his value, each bidder decides whether or not to participate in the auction. In the calculation of his expected value, each bidder uses his conjectures about the number of participants for each possible subgroup. In equilibrium, the conjectured probability is compatible with the probability of staying in the auction. In our model, players (...) face participation costs, bidders may buy as many objects as they wish and they are allowed to drop out at any round. Bidders can drop out at any time, but they cannot come back to the auction. In particular we can determine the number of participants and expected prices in equilibrium. We show that for any bidding strategy, there exists such a probability of staying in the auction. For the case of stochastically independent objects, we show that in equilibrium every bidder who decides to continue submits a bid that is equal to his value at each round. When objects are stochastically identical, we are able to show that expected prices are decreasing. (shrink)

It will be shown that the Peres–Mermin square admits value-definite noncontextual hidden-variable models if the observables associated with the operators can be measured only sequentially but not simultaneously. Namely, sequential measurements allow for noncontextual models in which hidden states update between consecutive measurements. Two recent experiments realizing the Peres–Mermin square by sequential measurements will also be analyzed along with other hidden-variable models accounting for these experiments.

In _The Sequential Imperative_ William Edmondson describes the functional specification of the brain. This new approach to Cognitive Science depends on detailed understanding of speech, but the outcome is an understanding of the functionality of the brain in any species.

By examining the activity of direction-giving and asking we can discover some of the sequential and other structures which characterize the activity. The insertion sequence, as a sequential structure, can be found to be used by interactants in more than one way to accomplish different results. We can therefore consider the insertion sequence as a sequential structure and, by attending to the activity in which the interactants are engaged, discover the relation between sequential and activity system structures. In this way (...) we can relate what persons are doing and how they are doing it (i.e. the activity being accomplished in and through their talk) to some of the basic structures of conversational interaction (e.g. insertion sequences). (shrink)

We respond to recent comments on our proposal to improve justice in ventilator triage, in which we used as an example New Jersey’s publicly available and legally binding Directive Number 2020-03. We agree with Bernard Lo and Doug White that equity implications of triage frameworks should be continually reassessed, which is why we offered six concrete options for improvement, and called for monitoring the consequences of adopted triage models. We disagree with their assessment that we mis-characterised their Model Guidance, as (...) included in the NJ Directive, in ways that undermine our conclusions. They suggest we erroneously described their model as a two-criterion allocation framework; that recognising other operant criterion reveals it ‘likely mitigate[s] rather than exacerbate[s] racial disparities during triage’, and allege that concerns about inequitable outcomes are ‘without evidence’. We highlight two major studies robustly demonstrating why concerns about disparate outcomes are justified. We also show that White and Lo seek to retrospectively—and counterfactually—correct the version of the Model Guideline included in the NJ Directive. However, as our facsimile reproductions show, neither the alleged four-criteria form, nor other key changes, such as dropping the Sequential Organ Failure Assessment score, are found in the Directive. These points matter because our conclusions hence stand, because the public version of the Model Guidance had not been updated to reduce the risk of inequitable outcomes until June 2021 and NJ’s Directive still does not reflect these revisions, and, hence, represents a less equitable version, as acknowledged by its authors. We comment on broader policy implications and call for ways of ensuring accurate, transparent and timely updates for users of high-stakes guidelines. (shrink)

We consider a notion of sequential functional of finite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the “full” and “effective” partial type structures arising from this notion of sequentiality. The full type structure coincides with that given by the strongly stable model of Bucciarelli and Ehrhard; it has also been characterized by van Oosten in terms of realizability over a certain combinatory algebra. We survey and relate several known characterizations of these (...) type structures, and obtain some new ones. We show that every finite type can be obtained as a retract of the pure type , and hence that all elements of the effective type structure are definable in PCF extended by a certain universal functional H. We also consider the relationship between our notion of sequentially computable functional and other known notions of higher-type computability. (shrink)

The main result of this paper is a weak constructive version of the uniform continuity theorem for pointwise continuous, real-valued functions on a convex subset of a normed linear space. Recursive examples are given to show that the hypotheses of this theorem are necessary. The remainder of the paper discusses conditions which ensure that a sequentially continuous function is continuous. MSC: 03F60, 26E40, 46S30.

We show that a given data ow language l has the property that for any program P and any demand for outputs D (which can be satis ed) there exists a least partial computation of P which satis es D, i all the operators of l are stable. This minimal computation is the demand-driven evaluation of P. We also argue that in order to actually implement this mode of evaluation, the operators of l should be further restricted to be e (...) ectively sequential ones. (shrink)

It is shown that in any model of constructive mathematics in which a certain omniscience principle is false, for strongly extensional functions on an interval the distinction between sequentially continuous and regulated disappears. It follows, without the use of Markov's Principle, that any recursive function of bounded variation on a bounded closed interval is recursively sequentially continuous.

We introduce a new allocation rule, called the sequential equal surplus division for rooted forest TU-games. We provide two axiomatic characterizations for this allocation rule. The first one uses the classical property of component efficiency plus an edge deletion property. The second characterization uses standardness, an edge deletion property applied to specific rooted trees, a consistency property, and an amalgamation property. We also provide an extension of the sequential equal surplus division applied to the problem of sharing a river with (...) bifurcations. (shrink)

The constructions of sequential calculi are based on the idea of application to the deduction process not only single logical constants but complexes of them as well. Surely, making use of this idea is not obligatory in paraconsistent logic. Nevertheless, using it in this field gives us a convenient tool for seeking proofs in formulation of many paraconsistent logics. Each of sequential propositional logics discussed in this paper is obtained as a result of a transformation of a starting calculus GCL (...) – one of sequential formalizations of classical propositional logic. Let α be a standard propositional language with a vocabulary {p1, p2, p3, . . . , −,∨, &, ⊃,¬,), we shall denote any formulas of α and by the letters Γ,∆, Σ, Θ finite sets of α-formulas. (shrink)

The coronavirus-19 (COVD-19) pandemic has resulted in strains on critical care resources throughout the world. Existing and newly developed guidelines for the allocation of scarce resources, including ventilators, frequently use the Sequential Organ Failure Assessment (SOFA) score for prognostic determination. This article will outline how SOFA scores were neither designed nor tested for this purpose and why guidelines based upon SOFA score groupings do not conform to ethical principles and community values.

Two recent conversation analytical studies draw contrary conclusions from seemingly very similar materials. Hutchby and Barnett ‘show that, far from revolutionizing the organization of telephone conversation, mobile phone talk retains many of the norms associated with landline phone talk’. Arminen and Leinonen, however, state that landline and mobile calls differ systematically from each other. These incommensurate findings raise the question of why the comparisons between landline and mobile call openings have not been able to determine whether social and communicative practices (...) are changing. It is suggested that auxiliary elements in CA allow the emergence of incompatible findings. The auxiliary assumptions enable authors to construct the phenomenon examined from their chosen perspective. Further, it will be shown that unquestioned assumptions materialize into theoretical notions that guide the research. CA studies seem to conceptualize the relationship between sequential order and sequence structure in different ways, which leads to different findings and results. (shrink)

Working within Bishop-style constructive mathematics, we derive a number of results relating the nonconstructive LPO and sequential compactness property on the one hand, and the intuitionistically reasonable anti-Specker property on the other.

This article analyses the sequential ordering of multi-modal discussions in real-time online classes in postgraduate education contexts. The article explores the ways that text and verbal talk are organized by the participants as inter-connecting modes of interaction. Focusing on Initiation, Response and Feedback sequences as an example of a form of exchange, the article shows that the interaction was comparatively disorderly where conducted across talk and text modes. For instance, written responses to questions or to encouragement turns often overlapped with (...) verbal answers from other students or with encouragement turns from the tutor. However, through the withholding of speech turns, the close latching of speech to written talk, and the ceasing of written turns at points where the topics or speakers changed, the participants showed a concern with re-establishing sequential order across the modalities. (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.

Previous studies of Hebrew nu investigate this discourse marker in casual conversation. The current study explores nu on Israeli political phone-in radio programs and broadens our knowledge both about the functions and grammaticization processes of discourse markers and about some particularities of Israeli political talk radio. The comparison to casual talk reveals both qualitative and quantitative differences. In casual talk, the main function of nu is a sequential one – urging further development of an ongoing topic. In the radiophonic data, (...) the most common role of nu is as a keying token, functioning in the affective realm. Furthermore, the talk-radio data show a wider variety of keys constructed by nu – which range from joking to sheer contempt – clustering closer towards the latter, in contrast to the case of casual talk, manifesting mostly the joking key. Structurally, whereas sequential functions are generally accomplished by stand-alone nu, affective tokens are accompanied by same-speaker talk. The analysis sheds new light on how a sequential token might come to function in the affective realm. (shrink)

This paper develops a deontic logic based on dynamic logic for reasoning about permission and prohibition of sequential actions. Our approach is characterized by two main features. First, permission and prohibition of sequential actions are not necessarily reduced to permission and prohibition of the actions’ constituent parts. Second, we incorporate the idea that actions may be permitted or prohibited conditional on another action being performed first. The logic interprets actions in terms of sequences of states, and the deontic component of (...) the logic is introduced by relating sequences of states to their legal and illegal future continuations. We consider various different logics obtained by imposing natural constraints on models, and formulate complete axiom systems for several of these logics. (shrink)

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)

We show that the property of sequential compactness for subspaces of.

Uniform sequential continuity, a property classically equivalent to sequential continuity on compact sets, is shown, constructively, to be a consequence of strong continuity on a metric space. It is then shown that in the case of a separable metric space, uniform sequential continuity implies strong continuity if and only if one adopts a certain boundedness principle that, although valid in the classical, recursive and intuitionistic setting, is independent of Heyting arithmetic.

Independence is the condition that, if X is preferred to Y, then a lottery between X and Z is preferred to a lottery between Y and Z given the same probability of Z. Is it rationally required that one’s preferences conform to Independence? The main objection to this requirement is that it would rule out the alleged rationality of Allais and Ellsberg Preferences. In this paper, I put forward a sequential dominance argument with fairly weak assumptions for a variant of (...) Independence (called Independence for Constant Prospects), which shows that Allais and Ellsberg Preferences are irrational. Hence this influential objection (that is, the alleged rationality of Allais and Ellsberg Preferences) can be rebutted. I also put forward a number of sequential dominance arguments that various versions of Independence are requirements of rationality. One of these arguments is based on very minimal assumptions, but the arguments for the versions of Independence which are strong enough to serve in the standard axiomatization of Expected Utility Theory need notably stronger assumptions. (shrink)

Rational individuals who perceive information sequentially are confronted to cognitive dissonance and dynamic uncertainty in a way that sets a natural limit to the ex post efficiency of their choices. From the normative perspective which ignores this dynamic uncertainty, their rationality seems limited. Sequential perception is assumed in a model of Bayesian revision of the contingent preference in a repeated choice. This model predicts both the cognitive dissonance phenomenon studied by Festinger and the formation of stable habits. It also shows (...) how an ordinary man can be rational with bounded informational and computational abilities and, for the same reasons, give a disproportionate weight to impressions without any normative value in his own choices and judgments. Sequential perception and cognitive consistency offer a credible alternative to the cognitive bias paradigm for predicting anomalies in choice and game behavior.Des individus logiques percevant l’information de manière séquentielle sont soumis à une dissonance cognitive et une incertitude dynamique qui limitent naturellement l’efficacité ex post de leurs choix. Du point de vue normatif, qui ignore cette incertitude dynamique, leur rationalité apparaît limitée. L’hypothèse de perception séquentielle est introduite dans un modèle de révision bayésienne de la préférence contingente lors d’un choix répété. Ce modèle prédit à la fois le phénomène de dissonance cognitive étudié par Festinger et la formation d’une habitude stable. Il montre aussi comment un homme ordinaire peut être rationnel sans disposer de capacités d’information et de calcul démesurées et, pour les mêmes raisons, subir l’influence disproportionnée d’impressions dénuées de valeur normative dans les choix ou les jugements qu’il porte. La perception séquentielle et la cohérence cognitive offrent une alternative crédible au paradigme des biais cognitifs pour expliquer tous les comportements humains qui réfutent la théorie normative des choix et des jeux. (shrink)

Considerable evidence supports the sequential two-system model of moral judgement, as proposed by Greene and others. We tested whether judgement speed and/or personal/impersonal moral dilemmas can predict the kind of moral judgements subjects make for each dilemma, and whether personal dilemmas create difficulty in moral judgements. Our results showed that neither personal/impersonal conditions nor spontaneous/thoughtful-reflection conditions were reliable predictors of utilitarian or deontological moral judgements. Yet, we found support for an alternative view, in which, when the two types of responses (...) are in conflict; the resolution of this conflict depends on both the subject and the dilemma. While thinking about this conflict, subjects sometimes change their minds in both directions, as suggested by the data from a mouse-tracking task. (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)

It is consistent with ZF $\mathsf {ZF}$ set theory that the Euclidean topology on R $\mathbb {R}$ is not sequential, yet every infinite set of reals contains a countably infinite subset. This answers a question of Gutierres.

Sequential recommendation algorithm can predict the next action of a user by modeling the user’s interaction sequence with an item. However, most sequential recommendation models only consider the absolute positions of items in the sequence, ignoring the time interval information between items, and cannot effectively mine user preference changes. In addition, existing models perform poorly on sparse data sets, which make a poor prediction effect for short sequences. To address the above problems, an improved sequential recommendation algorithm based on short-sequence (...) enhancement and temporal self-attention mechanism is proposed in this paper. In the proposed algorithm, a backward prediction model is trained first, to predict the prior items in the user sequence. Then, the reverse prediction model is used to generate a batch of pseudo-historical items before the initial items of the short sequence, to achieve the goal of enhancing the short sequence. Finally, the absolute position information and time interval information of the user sequence are modeled, and a time-aware self-attention model is adopted to predict the user’s next action and generate a recommendation list. Various experiments are conducted on two public data sets. The experimental results show that the method proposed in this paper has excellent performance on both dense and sparse data sets, and its effect is better than that of the state of the art. (shrink)