American Academy of Pediatrics (AAP) and American College of Medical Genetics (ACMG) recently provided two recommendations about predictive genetic testing of children. The Clinical Sequencing Exploratory Research Consortium's Pediatrics Working Group compared these recommendations, focusing on operational and ethical issues specific to decision making for children. Content analysis of the statements addresses two issues: (1) how these recommendations characterize and analyze locus of decision making, as well as the risks and benefits of testing, and (2) whether the guidelines conflict (...) or come to different but compatible conclusions because they consider different testing scenarios. These statements differ in ethically significant ways. AAP/ACMG analyzes risks and benefits using best interests of the child and recommends that, absent ameliorative interventions available during childhood, clinicians should generally decline to order testing. Parents authorize focused tests. ACMG analyzes risks and benefits using the interests of the child and other family members and recommends that sequencing results be examined for additional variants that can lead to ameliorative interventions, regardless of age, which laboratories should report to clinicians who should contextualize the results. Parents must accept additional analysis. The ethical arguments in these statements appear to be in tension with each other. (shrink)

Following our [6], though with somewhat different methods here, further variants of Goodstein sequences are introduced in terms of parameterized Ackermann–Péter functions. Each of the sequences is shown to terminate, and the proof-theoretic strengths of these facts are calibrated by means of ordinal assignments, yielding independence results for a range of theories: PRA, PA,$\Sigma ^1_1$-DC$_0$, ATR$_0$, up to ID$_1$. The key is the so-called “Hardy hierarchy” of proof-theoretic bounding finctions, providing a uniform method for associating Goodstein-type sequences with parameterized normal (...) form representations of positive integers. (shrink)

The aim of this paper is to highlight an interdependence between procedural and agential norms that undermines their neat separation when appraising argumentation. Drawing on the munāẓara tradition, we carve a space for sequencing in argumentation scholarship. Focusing on the antagonist’s sequencing of critical moves, we identify each sequence’s corresponding values of argumentation: coalescence, reliability, and efficacy. These values arise through the mediation of virtues and simultaneously underpin procedural as well as agential norms. Consequently, an ambiguity between procedure (...) and agent becomes apparent. This ambiguity hints at the potential for a virtue theory of argumentation that draws on procedural norms. (shrink)

A bounded monotone sequence of reals without a limit is called a Specker sequence. In Russian constructive analysis, Church's Thesis permits the existence of a Specker sequence. In intuitionistic mathematics, Brouwer's Continuity Principle implies it is false that every bounded monotone sequence of real numbers has a limit. We claim that the existence of Specker sequences crucially depends on the properties of intuitionistic decidable sets. We propose a schema about intuitionistic decidability that asserts “there exists an intuitionistic enumerable set that (...) is not intuitionistic decidable” and show that the existence of a Specker sequence is equivalent to ED. We show that ED is consistent with some certain well known axioms of intuitionistic analysis as Weak Continuity Principle, bar induction, and Kripke Schema. Thus, the assumption of the existence of a Specker sequence is conceivable in intuitionistic analysis. We will also introduce the notion of double Specker sequence and study the existence of them. (shrink)

ABSTRACT The apparent consistency of Sobel sequences famously motivated David Lewis to defend a variably strict conditional semantics for counterfactuals. If Sophie had gone to the parade, she would have seen Pedro. If Sophie had gone to the parade and had been stuck behind someone tall, she would not have seen Pedro. But if the order of the counterfactuals in a Sobel sequence is reversed—in the example, if is asserted prior to —the second counterfactual asserted no longer rings true. This (...) is the Heim sequence problem. That the order of assertion makes this difference is surprising on the variably strict account. Some argue that this is reason to reject the Lewis-Stalnaker semantics outright. Others argue that the problem motivates a contextualist rendering of counterfactuals. Still others maintain that the explanation for the phenomenon is merely pragmatic. I argue that none of these is right, and I defend a novel way to understand the phenomenon. My proposal avoids the problems faced by the alternative analyses and enjoys independent support. There is, however, a difficulty for my view: it entails that many ordinarily accepted counterfactuals are not true. I argue that this cost is acceptable. (shrink)

Running head: Implicit sequence learning ABSTRACT Can we learn without awareness? Although this issue has been extensively explored through studies of implicit learning, there is currently no agreement about the extent to which knowledge can be acquired and projected onto performance in an unconscious way. The controversy, like that surrounding implicit memory, seems to be at least in part attributable to unquestioned acceptance of the unrealistic assumption that tasks are process-pure, that is, that a given task exclusively involves either implicit (...) or explicit knowledge. (shrink)

Specker sequences are constructive, increasing, bounded sequences of rationals that do not converge to any constructive real. A sequence is said to be a strong Specker sequence if it is Specker and eventually bounded away from every constructive real. Within Bishop's constructive mathematics we investigate non-decreasing, bounded sequences of rationals that eventually avoid sets that are unions of sequences of intervals with rational endpoints. This yields surprisingly straightforward proofs of certain basic results fromconstructive mathematics. Within Russian constructivism, we show how (...) to use this general method to generate Specker sequences. Furthermore, we show that any nonvoid subset of the constructive reals that has no isolated points contains a strictly increasing sequence that is eventually bounded away from every constructive real. If every neighborhood of every point in the subset contains a rational number different from that point, the subset contains a strong Specker sequence. (shrink)

With the advent of synthetic biology, scientists are increasingly relying on digital sequence information, instead of physical genetic resources. This article examines the potential impact of this shift on the access and benefit-sharing (ABS) regime of the Convention on Biological Diversity (CBD) and the Nagoya Protocol. These treaties require benefit-sharing with the owners of genetic resources. However, whether “genetic resources” include digital sequence information is unsettled. The CBD conceives genetic resources as genetic material containing functional units of heredity. “Material” implies (...) tangibility, and for some scholars, “functional units of heredity,” undefined in both treaties, mean full-coding sequences. This article argues that digital sequence information obtained from physical genetic resources, full-coding or not, should be treated as genetic resources. Literal construction of the CBD risks eroding its usefulness and the ABS regime. This is because through bioinformatics, sequence information can easily be obtained from genetic resources for utilization, without physically moving them or concluding ABS agreement with owners. The CBD must evolve with scientific progress also because sequence functionality depends on the state of knowledge. These arguments are vindicated by domestic ABS laws equating genetic information with genetic resources; Nagoya Protocol provisions deeming research exploiting the genetic composition of genetic resources as utilization of genetic resources; and CBD provisions requiring the sharing of benefits from the utilization of genetic resources. Moreover, treaty interpretation and case law demand that generic, scientific terms, such as “genetic resources” and “functional units of heredity” be interpreted in an evolutionary manner to capture scientific developments. (shrink)

A model of gestural sequencing in speech is proposed that aspires to producing biologically plausible fluent and efficient movement in generating an utterance. We have previously proposed a modification of the well-known task dynamic implementation of articulatory phonology such that any given articulatory movement can be associated with a quantification of effort (Simko & Cummins, 2010). To this we add a quantitative cost that decreases as speech gestures become more precise, and hence intelligible, and a third cost component that (...) places a premium on the duration of an utterance. Together, these three cost elements allow us to derive algorithmically optimal sequences of gestures and dynamical parameters for generating articulator movement. We show that the optimized movement displays many timing characteristics that are representative of real speech movement, capturing subtle details of relative timing between gestures. Optimal movement sequences also display invariances in timing that suggest syllable-level coordination for CV sequences. We explore the behavior of the model as prosodic context is manipulated in two dimensions: clarity of articulation and speech rate. Smooth, fluid, and efficient movements result. (shrink)

Fusion genes formed by chromosomal rearrangements are common drivers of cancer. Recent innovations in the field of next‐generation sequencing (NGS) have seen a dynamic shift from traditional fusion detection approaches, such as visual characterization by fluorescence, to more precise multiplexed methods. There are many different NGS‐based approaches to fusion gene detection and deciding on the most appropriate method can be difficult. Beyond the experimental approach, consideration needs to be given to factors such as the ease of implementation, processing time, (...) associated costs, and the level of expertise required for data analysis. Here, the different NGS‐based methods for fusion gene detection, the basic principles underlying the techniques, and the benefits and limitations of each approach are reviewed. This article concludes with a discussion of how NGS will impact fusion gene detection in a clinical context and from where the next innovations are evolving. (shrink)

ABSTRACT There are two tenets about free agency that have proven difficult to combine: free agency is grounded in an agent’s possession or exercise of their reasons-responsiveness, only actual sequence features can ground free agency. This paper argues that and can only be reconciled if we recognise that their clash is just the particular manifestation of a wider conflict between two approaches to the notion of non-accidentality. According to modalism, p is non-accidentally connected to q iff p modally tracks q. (...) According to explanationism, p is non-accidentally connected to q iff q explains p in the right way. The conflict between these two approaches becomes manifest in Frankfurt-like cases for many notions, in which p and q are intuitively non-accidentally connected even though there is no modal tracking between them. Thus, and can’t be combined because the Frankfurt-cases upon which rests track explanationist intuitions, while the non-accidentality requirement of reasons-responsiveness in is usually spelled out in modalist terms. Hence, the possibility of an actual sequence reasons-responsiveness account depends on finding an explanationist approach to the non-accidentality requirement of reasons-responsiveness. (shrink)

This paper uses the Process Dissociation Procedure to explore whether people can acquire unconscious knowledge in the serial reaction time task [Destrebecqz, A., & Cleeremans, A. . Can sequence learning be implicit? New evidence with the Process Dissociation Procedure. Psychonomic Bulletin & Review, 8, 343–350; Wilkinson, L., & Shanks, D. R. . Intentional control and implicit sequence learning. Journal of Experimental Psychology: Learning, Memory, and Cognition, 30, 354–369]. Experiment 1 showed that people generated legal sequences above baseline levels under exclusion (...) instructions. Reward moved exclusion performance towards baseline, indicating that the extent of motivation in the test phase influenced the expression of unconscious knowledge. Experiments 2 and 3 revealed that even with reward, adding noise to the sequences or shortening training led to above-baseline exclusion performance, suggesting that task difficulty and the amount of training also affected the expression of unconscious knowledge. The results help resolve some current debates about the role of conscious awareness in sequence learning. (shrink)

The Hungarian Nominal Functional Sequence combines the methods of syntactic cartography with evidence from compositional semantics in a comprehensive exploration of the structure of Noun Phrases. Proceeding from the lexical core to the top of DP, it uses Hungarian as a window on the underlying universal functional hierarchy of Noun Phrases, but it also regularly complements and supports the analysis with cross-linguistic evidence. The book works out a minimal map of the extended NP in the sense that the proposed hierarchy (...) only has projections which host overt material and it does not draw on semantically empty word order projections. Topics which receive special attention include the syntax of classifiers, demonstratives, proper names, possessive NPs and plural pronouns. (shrink)

This paper studies the metric structure of the space Hr of absolutely summable sequences of real numbers with at most r nonzero terms. Hr is complete, and is located and nowhere dense in the space of all absolutely summable sequences. Totally bounded and compact subspaces of Hr are characterized, and large classes of located, totally bounded, compact, and locally compact subspaces are constructed. The methods used are constructive in the strict sense. MSC: 03F65, 54E50.

Human language is a salient example of a neurocognitive system that is specialized to process complex dependencies between sensory events distributed in time, yet how this system evolved and specialized remains unclear. Artificial Grammar Learning (AGL) studies have generated a wealth of insights into how human adults and infants process different types of sequencing dependencies of varying complexity. The AGL paradigm has also been adopted to examine the sequence processing abilities of nonhuman animals. We critically evaluate this growing literature (...) in species ranging from mammals (primates and rats) to birds (pigeons, songbirds, and parrots) considering also cross‐species comparisons. The findings are contrasted with seminal studies in human infants that motivated the work in nonhuman animals. This synopsis identifies advances in knowledge and where uncertainty remains regarding the various strategies that nonhuman animals can adopt for processing sequencing dependencies. The paucity of evidence in the few species studied to date and the need for follow‐up experiments indicate that we do not yet understand the limits of animal sequence processing capacities and thereby the evolutionary pattern. This vibrant, yet still budding, field of research carries substantial promise for advancing knowledge on animal abilities, cognitive substrates, and language evolution. (shrink)

This title introduces the concepts of algorithms and sequencing in coding by using relatable real-world examples in the reader's everyday life. Vivid photographs and easy-to-read text aid comprehension for early readers. Features include a table of contents, an infographic, fun facts, Making Connections questions, a glossary, and an index. QR Codes in the book give readers access to book-specific resources to further their learning. Aligned to Common Core Standards and correlated to state standards. Cody Koala is an imprint of (...) Pop!, a division of ABDO. (shrink)

Versions of Laver sequences are known to exist for supercompact and strong cardinals. Assuming very strong axioms of infinity, Laver sequences can be constructed for virtually any globally defined large cardinal not weaker than a strong cardinal; indeed, under strong hypotheses, Laver sequences can be constructed for virtually any regular class of embeddings. We show here that if there is a regular class of embeddings with critical point κ, and there is an inaccessible above κ, then it is consistent for (...) there to be a regular class that admits no Laver sequence. We also show that extendible cardinals are Laver-generating, i.e., that assuming only that κ is extendible, there is an extendible Laver sequence at κ. We use the method of proof to answer a question about Laver-closure of extendible cardinals at inaccessibles. Finally, we consider Laver sequences for super-almost-huge cardinals. Assuming slightly more than super-almost-hugeness, we show that there are super-almost-huge Laver sequences, improving the previously known upper bound for such Laver sequences. We also describe conditions under which the canonical construction of a Laver sequence fails for super-almost-huge cardinals. (shrink)

We investigate maximal free sequences in the Boolean algebra \ {/}\text {fin}\), as defined by Monk :593–610, 2011). We provide some information on the general structure of these objects and we are particularly interested in the minimal cardinality of a free sequence, a cardinal characteristic of the continuum denoted \. Answering a question of Monk, we demonstrate the consistency of \. In fact, this consistency is demonstrated in the model of Shelah for \ :433–443, 1992). Our paper provides a streamlined (...) and mostly self contained presentation of this construction. (shrink)

Sibley, Kello, Plaut, and Elman (2008) proposed the sequence encoder as a model that learns fixed‐width distributed representations of variable‐length sequences. In doing so, the sequence encoder overcomes problems that have restricted models of word reading and recognition to processing only monosyllabic words. Bowers and Davis (2009) recently claimed that the sequence encoder does not actually overcome the relevant problems, and hence it is not a useful component of large‐scale word‐reading models. In this reply, it is noted that the sequence (...) encoder has facilitated the creation of large‐scale word‐reading models. The reasons for this success are explained and stand as counterarguments to claims made by Bowers and Davis. (shrink)

According to L.E.J. Brouwer, there is room for non-definable real numbers within the intuitionistic ontology of mental constructions. That room is allegedly provided by freely proceeding choice sequences, i.e., sequences created by repeated free choices of elements by a creating subject in a potentially infinite process. Through an analysis of the constitution of choice sequences, this paper argues against Brouwer’s claim.

Over the past decade, sequence learning has gradually become a central paradigm through which to study implicit learning. In this chapter, we start by briefly summarizing the results obtained with different variants of the sequence learning paradigm. We distinguish three subparadigms in terms of whether the stimulus material is generated either by following a fixed and repeating sequence (e.g., Nissen & Bullemer, 1987), by relying on a complex set of rules from which one can produce several alternative deterministic sequences (e.g., (...) Lewicki, Hill & Bizot, 1988; Stadler, 1989), or by following the output of a probabilistic set of rules such as instantiated by noisy finite-state grammars (Cleeremans & McClelland, 1991; Jiménez, Mendéz & Cleeremans, 1996). Next, we focus on the processes involved in sequence representation and acquisition. We suggest that the sensitivity to the sequential structure observed in the probabilistic subparadigm can only be a result of the acquisition of a representation of the statistical constraints of the material, and that this sensitivity emerges through the operation of mechanisms that are well instantiated by connectionist models such as the Simple Recurrent Network (Elman, 1990; Cleeremans, 1993b). We present new simulation work meant to explore to what extent the model can also account for specific data obtained in a paradigmatic instance of deterministic, rule-based sequence learning task: Lewicki et al. (1988)'s situation. Finally, we report on the results of an experiment that compares learning on otherwise similar deterministic and probabilistic structures, and we show that learning of both types of structures is equivalent only under conditions that maximally hinder explicit acquisition. Taken together, these simulation and experimental data lend support to the claim that implicit learning in all three sequence learning subparadigms can amount to a form of statistical sequence learning. They also suggest that distinguishing among several theories of sequence representation and acquisition may require us to analize the data in great detail. Hopefully, however, some truth can be found in such details.. (shrink)

We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem. Suppose κ is a singular strong limit cardinal and 2κ λ where λ is not the successor of a cardinal of cofinality at most κ. If cf > ω then it follows that o λ, and if cf = ωthen either o λ or {α: K o α+n} is confinal in κ for (...) each n ε ω.We also prove several results which extend or are related to this result, notably Theorem. If 2ω ω1 then there is a sharp for a model with a strong cardinal.In order to prove these theorems we give a detailed analysis of the sequences of indiscernibles which come from applying the covering lemma to nonoverlapping sequences of extenders. (shrink)

"Cover"--"Title" -- "Copyright" -- "Dedication" -- "Contents" -- "List of Figures" -- "Acknowledgements" -- "1 Introduction" -- "Limina" -- "Anticipation and Recapitulation" -- "Problems of Cinematic Paratext" -- "2 Narrative Exposition" -- "Pseudo-independence" -- "Intratextuality" -- "3 Expositional Modes" -- "The Allegory Mode" -- "Lexical Expertise" -- "4 The Comment Mode" -- "Narrative Futurity" -- "Intertextuality and Quotation" -- "5 The Summary Mode" -- "Complex Summary" -- "Narrative Restatement" -- "6 The Prologue Mode" -- "Realist Integration" -- "Expository Texts" -- (...) "7 Conclusions" -- "The Paradoxes of Cinematic Paratext" -- "Typography and Pseudo-independence" -- "The Ideology of Naturalism::Stylization. (shrink)

In a Common Law system, legal practitioners need frequent access to prior case documents that discuss relevant legal issues. Case documents are generally very lengthy, containing complex sentence structures, and reading them fully is a strenuous task even for legal practitioners. Having a concise overview of these documents can relieve legal practitioners from the task of reading the complete case statements. Legal catchphrases are (multi-word) phrases that provide a concise overview of the contents of a case document, and automated generation (...) of catchphrases is a challenging problem in legal analytics. In this paper, we propose a novel supervised neural sequence tagging model for the extraction of catchphrases from legal case documents. Specifically, we show that incorporating document-specific information along with a sequence tagging model can enhance the performance of catchphrase extraction. We perform experiments over a set of Indian Supreme Court case documents, for which the gold-standard catchphrases (annotated by legal practitioners) are obtained from a popular legal information system. The performance of our proposed method is compared with that of several existing supervised and unsupervised methods, and our proposed method is empirically shown to be superior to all baselines. (shrink)

In this paper a semantics for dynamic predicate logic is developed that uses sequence valued assignments. This semantics is compared with the usual relational semantics for dynamic predicate logic: it is shown that the most important intuitions of the usual semantics are preserved. Then it is shown that the refined semantics reflects out intuitions about information growth. Some other issues in dynamic semantics are formulated and discussed in terms of the new sequence semantics.

Five recursively axiomatizable theories extending Kleene's intuitionistic theory FIM of numbers and numbertheoretic sequences are introduced and shown to be consistent, by a modified relative realizability interpretation which verifies that every sequence classically defined by a Π11 formula is unavoidable and that no sequence can fail to be classically Δ11. The analytical form of Markov's Principle fails under the interpretation. The notion of strongly inadmissible rule of inference is introduced, with examples.

In sequence-space synaesthesia, members of linguistic sequences such as numbers, days of the week and letters of the alphabet are perceived to occupy spatial positions, either in the mind's eye or as locations in space around the body. In this chapter, we begin by considering the possible sequences that can induce this type of synaesthesia, with the focus on numbers, time-units and letters. We evaluate the various methods used to test the genuineness of self-reports of this type of synaesthesia, and (...) we make suggestions for novel techniques that could address the shortcomings of the current methods. Lastly, we briefly outline the current theories on the neural basis of this type of synaesthesia, including the recent reification hypothesis. We conclude by discussing how scientific findings with sequence-space synaesthetes can be beneficial for the study of cognitive psychology more generally. (shrink)

For given Boolean algebras$\mathbb {A}$and$\mathbb {B}$we endow the space$\mathcal {H}(\mathbb {A},\mathbb {B})$of all Boolean homomorphisms from$\mathbb {A}$to$\mathbb {B}$with various topologies and study convergence properties of sequences in$\mathcal {H}(\mathbb {A},\mathbb {B})$. We are in particular interested in the situation when$\mathbb {B}$is a measure algebra as in this case we obtain a natural tool for studying topological convergence properties of sequences of ultrafilters on$\mathbb {A}$in random extensions of the set-theoretical universe. This appears to have strong connections with Dow and Fremlin’s result stating (...) that there are Efimov spaces in the random model. We also investigate relations between topologies on$\mathcal {H}(\mathbb {A},\mathbb {B})$for a Boolean algebra$\mathbb {B}$carrying a strictly positive measure and convergence properties of sequences of measures on$\mathbb {A}$. (shrink)

A Martin-Löf random sequence is an infinite binary sequence with the property that every initial segment $\sigma$ has prefix-free Kolmogorov complexity $K$ at least $|\sigma| - c$, for some constant $c \in \omega$. Informally, initial segments of Martin-Löf randoms are highly complex in the sense that they are not compressible by more than a constant number of bits. However, all Martin-Löf randoms necessarily have contiguous substrings of arbitrarily low complexity. If we demand that all substrings of a sequence be uniformly (...) complex, then we arrive at the notion of shift-complex sequences. In this paper, we collect some of the existing results on these sequences and contribute two new ones. Rumyantsev showed that the measure of oracles that compute shift-complex sequences is zero. We strengthen this result by proving that the Martin-Löf random sequences that do not compute shift-complex sequences are exactly the incomplete ones, in other words, the ones that do not compute the halting problem. In order to do so, we make use of the characterization by Franklin and Ng of the class of incomplete Martin-Löf randoms via a notion of randomness called difference randomness. Turning to the power of shift-complex sequences as oracles, we show that there are shift-complex sequences that do not compute Martin-Löf random sequences. (shrink)

Let T 1 , T 2 be countable first-order theories, M i ⊨ T i , and ������ any regular ultrafilter on λ ≥ $\aleph_{0}$ . A longstanding open problem of Keisler asks when T 2 is more complex than T 1 , as measured by the fact that for any such λ, ������, if the ultrapower (M 2 ) λ /������ realizes all types over sets of size ≤ λ, then so must the ultrapower (M 1 ) λ /������. (...) In this paper, building on the author's prior work [12] [13] [14], we show that the relative complexity of first-order theories in Keisler's sense is reflected in the relative graph-theoretic complexity of sequences of hypergraphs associated to formulas of the theory. After reviewing prior work on Keisler's order, we present the new construction in the context of ultrapowers, give various applications to the open question of the unstable classification, and investigate the interaction between theories and regularizing sets. We show that there is a minimum unstable theory, a minimum TP 2 theory, and that maximality is implied by the density of certain graph edges (between components arising from Szemerédi-regular decompositions) remaining bounded away from 0, 1. We also introduce and discuss flexible ultrafilters, a relevant class of regular ultrafilters which reflect the sensitivity of certain unstable (non low) theories to the sizes of regularizing sets, and prove that any ultrafilter which saturates the minimal TP 2 theory is flexible. (shrink)

The procreation asymmetry is a widely held view in ethics, claiming that one should make existing people happy but has no reason to make happy people. Here, I shall present a new objection demonstrating from modest premises that one has a reason to take a sequence of actions that simply creates a happy person; yet this judgment in combination with plausible principles about sequences of actions entails that one has some reason to simply create a happy person. Additionally, I will (...) argue that one's reasons to create a happy person are quite strong. (shrink)

One of the earliest applications of transfinite numbers is in the construction of derived sequences by Cantor [2]. In [6], the existence of derived sequences for countable closed sets is proved in ATR0. This existence theorem is an intermediate step in a proof that a statement concerning topological comparability is equivalent to ATR0. In actuality, the full strength of ATR0 is used in proving the existence theorem. To show this, we will derive a statement known to be equivalent to ATR0, (...) using only RCA0 and the assertion that every countable closed set has a derived sequence. We will use three of the subsystems of second order arithmetic defined by H. Friedman , which can be roughly characterized by the strength of their set comprehension axioms. RCA0 includes comprehension for Δmath image definable sets, ACA0 includes comprehension for arithmetical sets, and ATR0 appends to ACA0 a comprehension scheme for sets defined by transfinite recursion on arithmetical formulas. MSC: 03F35, 54B99. (shrink)

We give an overview of the role of equicontinuity of sequences of real-valued functions on [0,1] and related notions in classical mathematics, intuitionistic mathematics, Bishop’s constructive mathematics, and Russian recursive mathematics. We then study the logical strength of theorems concerning these notions within the programme of Constructive Reverse Mathematics. It appears that many of these theorems, like a version of Ascoli’s Lemma, are equivalent to fan-theoretic principles.

Analysis of two key ways of characterizing genes—as causes of phenotypic effects and as genomic DNA sequences—has yielded widespread pessimism that they can be united in a coherent gene concept. This raises important questions about the epistemology of genomic research: If analysis of a genome sequence cannot yield information about genes defined both in terms of their products and their DNA sequence, then what could we learn from it? I investigate basic tools of genomic analysis, argue that they do not (...) reflect the application of either gene concept, and clarify how we learn from genomic research. (shrink)

Revision sequences are a kind of transfinite sequences which were introduced by Herzberger and Gupta in 1982 as the main mathematical tool for developing their respective revision theories of truth. We generalise revision sequences to the notion of cofinally invariant sequences, showing that several known facts about Herzberger’s and Gupta’s theories also hold for this more abstract kind of sequences and providing new and more informative proofs of the old results.

In recent years, some scholars have claimed that humans are unique in their capacity and motivation to engage in cooperative communication and extensive, fast-paced social interactions. While research on gestural communication in great apes has offered important findings concerning the gestural repertoires of different species, very little is known about the sequential organization of primates’ communicative behavior during interactions. Drawing on a conversation analytic framework, this paper addresses this gap by investigating the sequential organization of bonobo mother-infant interactions, and more (...) specifically, how individuals solicit carries from one another. It shows how bonobos establish participation frameworks before producing a carry request gesture and how the ensuing communicative actions can be organized in adjacency-pair sequences. Moreover, the timing between the initiation of an action and its response is similar to what has been documented in adult human interaction. Finally, it outlines some of the orderly practices bonobos use to deal with the absence of response from the addressed participants in carry sequences. Keywords: adjacency pair; pan paniscus ; conversation analysis; gestures; interactional time; sequence organization. (shrink)

Implementing whole genome sequencing (WGS) in paediatric settings demands sensitive and nuanced examination. Critical reflection as to how and when to use this technology is particularly important. This commentary on Anderson et al's (2017) evaluation of the Genome Clinic study, which involved paediatric clinical WGS, provides an opportunity for such reflection. I scrutinise three issues raised in the study: (1) the non-separation of the choice over agreeing to diagnostic WGS and whether to receive adult-onset SVs; (2) the value of (...) deliberation regarding paediatric WGS and (3) the place of best interests in debates over returning adult-onset SVs. (shrink)

In the course of proving a tenability result about the probabilities of conditionals, van Fraassen (1976) introduced a semantics for conditionals based on ω-sequences of worlds, which amounts to a particularly simple special case of ordering semantics for conditionals. On that semantics, ‘If p, then q’ is true at an ω-sequence just in case q is true at the first tail of the sequence where p is true (if such a tail exists). This approach has become increasingly popular in recent (...) years. However, its logic has never been explored. We axiomatize the logic of ω-sequence semantics, showing that it is the result of adding two new axioms to Stalnaker’s logic C2: one, Flattening, which is prima facie attractive, and, and a second, Sequentiality, which is complex and difficult to assess, but, we argue, likely invalid. But we also show that when sequence semantics is generalized from ω-sequences to arbitrary (transfinite) ordinal sequences, the result is a more attractive logic that adds only Flattening to C2. We also explore the logics of a few other interesting restrictions of ordinal sequence semantics. Finally, we address the question of whether sequence semantics is motivated by probabilistic considerations, answering, pace van Fraassen, in the negative. (shrink)

Time–space synesthetes report that they experience the months of the year as having a spatial layout. In Study 1, we characterize the phenomenology of calendar sequences produced by synesthetes and non-synesthetes, and show a conservative estimate of time–space synesthesia at 2.2% of the population. We demonstrate that synesthetes most commonly experience the months in a circular path, while non-synesthetes default to linear rows or rectangles. Study 2 compared synesthetes’ and non-synesthetes’ ability to memorize a novel spatial calendar, and revealed better (...) performance in synesthetes. The capacity to learn mappings between arbitrary spatial forms and temporal sequences is present in all individuals, and time–space synesthetes’ enhanced visuo-spatial memory abilities may underlie their creation of idiosyncratic spatial calendar forms. (shrink)

In order processing, consecutive sequences (e.g., 1‐2‐3) are generally processed faster than nonconsecutive sequences (e.g., 1‐3‐5) (also referred to as the reverse distance effect). A common explanation for this effect is that order processing operates via a memory‐based associative mechanism whereby consecutive sequences are processed faster because they are more familiar and thus more easily retrieved from memory. Conflicting with this proposal, however, is the finding that this effect is often absent. A possible explanation for these absences is that familiarity (...) may vary both within and across sequence types; therefore, not all consecutive sequences are necessarily more familiar than all nonconsecutive sequences. Accordingly, under this familiarity perspective, familiar sequences should always be processed faster than unfamiliar sequences, but consecutive sequences may not always be processed faster than nonconsecutive sequences. To test this hypothesis in an adult population, we used a comparative judgment approach to measure familiarity at the individual sequence level. Using this measure, we found that although not all participants showed a reverse distance effect, all participants displayed a familiarity effect. Notably, this familiarity effect appeared stronger than the reverse distance effect at both the group and individual level; thus, suggesting the reverse distance effect may be better conceptualized as a specific instance of a more general familiarity effect. (shrink)

Collecting, comparing, and computing molecular sequences are among the most prevalent practices in contemporary biological research. They represent a specific way of producing knowledge. This paper explores the historical development of these practices, focusing on the work of Margaret O. Dayhoff, Richard V. Eck, and Robert S. Ledley, who produced the first computer-based collection of protein sequences, published in book format in 1965 as the Atlas of Protein Sequence and Structure. While these practices are generally associated with the rise of (...) molecular evolution in the 1960s, this paper shows that they grew out of research agendas from the previous decade, including the biochemical investigation of the relations between the structures and function of proteins and the theoretical attempt to decipher the genetic code. It also shows how computers became essential for the handling and analysis of sequence data. Finally, this paper reflects on the relationships between experimenting and collecting as two distinct “ways of knowing” that were essential for the transformation of the life sciences in the twentieth century. (shrink)

The purpose of this paper is to present some results instit theory, a theory of agency proposed by N. Belnap and M. Perloff. We will establish a correspondence between the numbers ofstit modalities and the complexity degrees ofbusy choice sequences in semantic structures, and consequently, a correspondence between the number of modes of actions/inactions instit theory and the complexity degrees ofbusy choice sequences in semantic structures.