There is a growing consensus that the elicitation and differentiation of emotions can best be understood as the result of the subjective appraisal of the significance of events for individuals. The present paper addresses the process of appraisal, hitherto neglected; particularly the postulate that appraisal consists of a fixed sequence of stimulus evaluation checks, as proposed by the component process model of emotion (Scherer, 1984, 1993b). It is suggested that indirect evidence pertinent to the order assumption, which is (...) an essential aspect of the sequence hypothesis, can be obtained via the study of recognition-of-emotion-situation scenarios that have been segmented according to individual appraisal criteria or dimensions. The hypothesis that the presentation of these segments in the predicted sequence (as compared to a random sequence) will result in a faster and more accurate identification of the respective emotions is supported by data from three experiments. Potential alternative explanations are discussed. (shrink)

This note examines when the worst shot should aim his first shot into the air in a game of the truel presented by Singh (Fermat's Enigma: the epic quest to solve the world's greatest mathematical problem. Walker and Company, New York, 1987) in his popular book on Fermat's Last Theorem. It also analyzes a variant of the game. Finally, it considers the possibility of the situation in which the worst and better shots are both willing to reverse the order (...) of their moves in the original game. (shrink)

An agent who violates independence can avoid dynamic inconsistency in sequential choice if he is sophisticated enough to make use of backward induction in planning. However, Seidenfeld has demonstrated that such a sophisticated agent with dependent preferences is bound to violate the principle of dynamic substitution, according to which admissibility of a plan is preserved under substitution of indifferent options at various choice nodes in the decision tree. Since Seidenfeld considers dynamic substitution to be a coherence condition on dynamic (...) choice, he concludes that sophistication cannot save a violator of independence from incoherence. In response to McClennen’s objection that relying on dynamic substitution when independence is at stake must be question-begging, Seidenfeld undertakes to prove that dynamic substitution follows from the principle of backward induction alone, provided we assume that the agent’s admissible choices from different sets of feasible plans are all based on a fixed underlying preference ordering of plans. This paper shows that Seidenfeld's proof fails: depending on the interpretation, it is either invalid or based on an unacceptable assumption. (shrink)

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)

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)

The belief to have fixed or malleable traits and help giving: implicit theories and sequential social influence techniques Two sequential social influence techniques, the foot-in-the-door and the door-in-the-face, seem to be symmetrical, but there are different moderators and quite different mechanisms underlying each of the strategies. What links both techniques is the social interaction between a person presenting a sequence of requests and an interlocutor. The techniques' effectiveness depends on the course and perception of the interaction and (...) the difficulty of requests in the sequence. The aim of the article was to verify various mechanisms of incremental and entity theorists compliance with the FITD and the DITF techniques. In a series of four studies it was shown that incremental theorists comply the FITD technique to a greater extend especially when a sequence of requests meets their mastery style of behavior thus means an interesting challenge to undertake or opportunity to deepen contact with a newly met person. Entity theorists are more prone to the DITF strategy as their helpless style of behavior and sense of guilt are triggered, thus a sequence of decreasing in magnitude demands is perceived as less threatening. (shrink)

For a fixed set A, the number of queries to A needed in order to decide a set S is a measure of S's complexity. We consider the complexity of certain sets defined in terms of A: $ODD^A_n = \{(x_1, \dots ,x_n): {\tt\#}^A_n(x_1, \dots, x_n) \text{is odd}\}$ and, for m ≥ 2, $\text{MOD}m^A_n = \{(x_1, \dots ,x_n):{\tt\#}^A_n(x_1, \dots ,x_n) \not\equiv 0 (\text{mod} m)\},$ where ${\tt\#}^A_n(x_1, \dots ,x_n) = A(x_1)+\cdots+A(x_n)$ . (We identify A(x) with χ A (x), where χ (...) A is the characteristic function of A.) If A is a nonrecursive semirecursive set or if A is a jump, we give tight bounds on the number of queries needed in order to decide ODD A n and $\text{MOD}m^A_n: \bullet\text{ODD}^A_n$ can be decided with n parallel queries to A, but not with n - 1. $\bullet \text{ODD}^A_n$ can be decided with $\lceil log(n + 1)\rceil$ sequential queries to A but not with $\lceil log(n + 1)\rceil - 1. \bullet\text{MOD}m^A_n$ can be decided with $\lceil n/m\rceil + \lfloor n/m\rfloor$ parallel queries to A but not with $\lceil n/m\rceil + \lfloor n/m\rfloor - 1. \bullet\text{MOD}m^A_n$ can be decided with $\lceil log(\lceil n/m\rceil + \lfloor n/m\rfloor + 1)\rceil$ sequential queries to A but not with $\lceil log(\lceil n/m\rceil + \lfloor n/m\rfloor + 1)\rceil - 1$ . The lower bounds above hold for nonrecursive recursively enumerable sets A as well. (Interestingly, the lower bounds for recursively enumerable sets follow by a general result from the lower bounds for semirecursive sets.) In particular, every nonzero truth-table degree contains a set A such that ODD A n cannot be decided with n - 1 parallel queries to A. Since every truth-table degree also contains a set B such that ODD B n can be decided with one query to B, a set's query complexity depends more on its structure than on its degree. For a fixed set A, $Q(n,A) = \{S: S \text{can be decided with n sequential queries to} A\},\\Q_\parallel(n, A) = \{S: S \text{can be decided with n parallel queries to} A\}.$ We show that if A is semirecursive or recursively enumerable, but is not recursive, then these classes form non-collapsing hierarchies: $\bullet Q(0,A) \subset Q(1,A) \subset Q(2,A) \subset\cdots\\ \bullet Q_\parallel(0, A) \subset Q_\parallel(1, A) \subset Q_\parallel(2,A) \subset\cdots$ The same is true if A is a jump. (shrink)

Recent years have seen a certain impatience with John Rawls's approach to political philosophy and calls for the discipline to move beyond it. One source of dissatisfaction is Rawls's idea of a well-ordered society. In a recent article, Alex Schaefer has tried to give further impetus to this movement away from Rawlsian theorizing by pursuing a question about well-ordered societies that he thinks other critics have not thought to ask. He poses that question in the title of his article: “Is (...) Justice a Fixed Point?.” Though Schaefer is critical of Rawlsian political theorizing, I shall contend that his arguments also suggest two paths forward for those who would follow the Rawlsian approach. First, the intellectual devices Schaefer deploys help those who would continue the Rawlsian project to see, and precisely to chart, the next step that that project needs to take—a step necessitated by a concession Rawls himself made late in the development of political liberalism. Second, the clarity and economy with which Schaefer lays out his alternative to the Rawlsian approach make it possible to state some fundamental Rawlsian challenges to a form of theorizing that has considerable appeal to many critics of that approach. (shrink)

What we call first‐order logic over fixed domain was initiated, in a certain guise, by Peirce around 1885 and championed, albeit in idiosyncratic form, by Zermelo in papers from the 1930s. We characterise such logics model‐ and proof‐theoretically and argue that they constitute exploration of a clearly circumscribed conception of domain‐dependent generality. Whereas a logic, or family of such, can be of interest for any of a variety of reasons, we suggest that one of those reasons might be (...) that said logic fosters some clarification regarding just what qualifies as a logical concept, a logical operation, or a logical law. (shrink)

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)

We show that an individual using a choice function is sequentially rational and the decisions he makes are independent of the order of implementation of the rationales if and only if he is rational with the union of the rationales as a base binary relation. When he makes his decisions following a choice correspondence, the sufficiency part of this claim still holds, the necessity part of it does not.

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)

In recent years, social workers have raised a new concern about the appearance of a new category among the working poor. Even employed, there are people so overburdened by the cost of living and so under compensated that they cannot afford a place to sleep. Contrary to popular opinion, according to the website for the Coalition for the Homeless, forty-four percent of the homeless in first world countries actually have jobs. In No Fixed Abode, Marc Augé's pathbreaking ethnofiction--a fictional (...) ethnography--a man named Henri narrates his strange existence in the margins of Paris. By day he walks the streets, lingers in conversation with the local shopkeepers, and sits writing in cafés, but at night he takes shelter in an abandoned house. From here, we see a progressive erosion of Henri's identity, a loss of bearings, and a slow degeneration of his ability to relate to others. But then he meets the artist Dominique, whose willingness to share her life with him raises questions about who he has become and about what a person needs in order to be a part of society. This is a book about how we live in geographical space and how work and patterns of domicile affect our status and our inner being. Despite the apparent simplicity of the fictional premise, Augé's book asks serious questions about the nature of our culture. (shrink)

The relation between least and diagonal fixed points is a well known and completely studied question for a large class of partially ordered models of the lambda calculus and combinatory logic. Here we consider this question in the context of algebraic recursion theory, whose close connection with combinatory logic recently become apparent. We find a comparatively simple and rather weak general condition which suffices to prove the equality of least fixed points with canonical (corresponding to those produced by (...) the Curry combinator in lambda calculus) diagonal fixed points in a class of partially ordered algebras which covers both combinatory spaces of Skordev and operative spaces of Ivanov. Especially, this yields an essential improvement of the axiomatization of recursion theory via combinatory spaces. (shrink)

Two key research issues in the field of causal learning are how people acquire causal knowledge when observing data that are presented sequentially, and the level of abstraction at which learning takes place. Does sequential causal learning solely involve the acquisition of specific cause-effect links, or do learners also acquire knowledge about abstract causal constraints? Recent empirical studies have revealed that experience with one set of causal cues can dramatically alter subsequent learning and performance with entirely different cues, suggesting (...) that learning involves abstract transfer, and such transfer effects involve sequential presentation of distinct sets of causal cues. It has been demonstrated that pre-training can modulate classic causal learning phenomena such as forward and backward blocking. To account for these effects, we propose a Bayesian theory of sequential causal learning. The theory assumes that humans are able to consider and use several alternative causal generative models, each instantiating a different causal integration rule. Model selection is used to decide which integration rule to use in a given learning environment in order to infer causal knowledge from sequential data. Detailed computer simulations demonstrate that humans rely on the abstract characteristics of outcome variables to select a causal integration rule, which in turn alters causal learning in a variety of blocking and overshadowing paradigms. When the nature of the outcome variable is ambiguous, humans select the model that yields the best fit with the recent environment, and then apply it to subsequent learning tasks. Based on sequential patterns of cue-outcome co-occurrence, the theory can account for a range of phenomena in sequential causal learning, including various blocking effects, primacy effects in some experimental conditions, and apparently abstract transfer of causal knowledge. (shrink)

Conversation analysis research on naturally occurring NS-NS talk-in-interaction has revealed that participants observably orient to shared expectations of the socio-interactional role of idiomatic expressions, particularly with regard to topic termination and transition. This study has analysed NS-NNS, as well as NS-NS, spontaneous conversation in order to evaluate and uncover recurrent features associated with the use of such expressions. Two main sequential patterns have been observed: one, occurring in both NS-NS and NS-NNS talk, is connected with topic termination and (...) transition, in some cases being extended to allow for the negotiation of interactional alignment between participants; the other, a `negotiative metatalk sequence', follows idiomatic expressions at points of possible topic conclusion and deals with NS-NNS trouble spots in which conversational participants' lack of shared understanding triggers coordinated negotiatory action that clears the way for the introduction of a new topic. (shrink)

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)

This article uses transcriptions from video recordings of airline pilots at work, on actual flights, to consider some locations and the interactional significance of a feature of routine talk in the airline cockpit: and-prefaced turns. As pilots’ work is formally organized for them as many discrete and ordered tasks, and-prefacing is a local means for maintaining an ongoing sense of their conduct of a flight as a whole. By and-prefacing their talk, pilots present some new talk or task as connected (...) and relevantly next in a larger macro-sequence of work for their flight. And-prefacing is evidence of pilots’ orientation to a sense of sequence that can extend well beyond pairs of turns at talk and/or non-talk activities, or even a series of such paired sequences. It allows pilots to make salient the sequentiality of their work where the officially prescribed wordings they must use can leave this implicit. (shrink)

In computer-mediated communication, users cannot ensure that responsive postings are placed in a directly adjacent position. Yet, paired actions are discernible in which a first pair part makes a second pair part conditionally relevant. While previous studies of short messaging service communication show that users usually send clusters of FPPs and that SPPs are ordered in the same chronology, little is known about sequential practices of dealing with multiple FPPs in text-based WhatsApp communication. This article shows that in German (...) WhatsApp dialogues, users apply a chronological as well as a reversed ordering of SPPs. It is argued that this result can only be partly attributed to the affordances of the mobile messenger. Rather, users arrange SPPs in order to foreground particular topics in extended, chat-like dialogues. (shrink)

One of the unconventional features of Wittgenstein’s _Tractatus Logico-Philosophicus_ is its use of an elaborated and detailed numbering system. Recently, Bazzocchi, Hacker und Kuusela have argued that the numbering system means that the _Tractatus_ must be read and interpreted not as a sequentially ordered book, but as a text with a two-dimensional, tree-like structure. Apart from being able to explain how the _Tractatus_ was composed, the tree reading allegedly solves exegetical issues both on the local and the global level. This (...) paper defends the sequential reading against the tree reading. After presenting the challenges generated by the numbering system and the two accounts as attempts to solve them, it is argued that Wittgenstein’s own explanation of the numbering system, anaphoric references within the _Tractatus_ and the exegetical issues mentioned above do not favour the tree reading, but a version of the sequential reading. This reading maintains that the remarks of the _Tractatus_ form a sequential chain: The role of the numbers is to indicate how remarks on different levels are interconnected to form a concise, surveyable and unified whole. (shrink)

It is widely assumed that language in some form or other originated by piggybacking on pre-existing learning mechanism not dedicated to language. Using evolutionary connectionist simulations, we explore the implications of such assumptions by determining the effect of constraints derived from an earlier evolved mechanism for sequential learning on the interaction between biological and linguistic adaptation across generations of language learners. Artificial neural networks were initially allowed to evolve “biologically” to improve their sequential learning abilities, after which language (...) was introduced into the population. We compared the relative contribution of biological and linguistic adaptation by allowing both networks and language to change over time. The simulation results support two main conclusions: First, over generations, a consistent head-ordering emerged due to linguistic adaptation. This is consistent with previous studies suggesting that some apparently arbitrary aspects of linguistic structure may arise from cognitive constraints on sequential learning. Second, when networks were selected to maintain a good level of performance on the sequential learning task, language learnability is significantly improved by linguistic adaptation but not by biological adaptation. Indeed, the pressure toward maintaining a high level of sequential learning performance prevented biological assimilation of linguistic-specific knowledge from occurring. (shrink)

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)

Truth-theoretic deflationism holds that truth is simple, and yet that it can fulfil many useful logico-linguistic roles. Deflationism focuses on axioms for truth: there is no reduction of the notion of truth to more fundamental ones such as sets or higher-order quantifiers. In this paper I argue that the fundamental properties of reasonable, primitive truth predicates are at odds with the core tenets of classical truth-theoretic deflationism that I call fix, express, and quantify. Truth may be regarded as a (...) broadly logical, sui generis notion. However, this has little to do with the original aims of the deflationary theory of truth. (shrink)

Learning the structure of event sequences is a ubiquitous problem in cognition and particularly in language. One possible solution is to learn a probabilistic generative model of sequences that allows making predictions about upcoming events. Though appealing from a neurobiological standpoint, this approach is typically not pursued in connectionist modeling. Here, we investigated a sequential version of the restricted Boltzmann machine, a stochastic recurrent neural network that extracts high-order structure from sensory data through unsupervised generative learning and can (...) encode contextual information in the form of internal, distributed representations. We assessed whether this type of network can extract the orthographic structure of English monosyllables by learning a generative model of the letter sequences forming a word training corpus. We show that the network learned an accurate probabilistic model of English graphotactics, which can be used to make predictions about the letter following a given context as well as to autonomously generate high-quality pseudowords. The model was compared to an extended version of simple recurrent networks, augmented with a stochastic process that allows autonomous generation of sequences, and to non-connectionist probabilistic models. We conclude that sequential RBMs and stochastic simple recurrent networks are promising candidates for modeling cognition in the temporal domain. (shrink)

In this paper I argue that it’s impossible for there to be a single universal theory of meaning for a language. First, I will consider some minimal expressiveness requirements a language must meet to be able to express semantic claims. Then I will argue that in order to have a single unified theory of meaning, these expressiveness requirements must be satisfied by a language which the semantic theory itself applies to. That is, we would need a language which can (...) express its own meaning. It has been well-known since Tarski that theories of meaning whose central notion is truth can’t be expressed in a language which they apply to. Here, I develop Quine’s formulation of the Liar Paradox in grammatical terms and use this to extend Tarski’s result to all theories of meaning. This general version of the paradox can be formalised as a special case of the Lawvere Fixed-Point Theorem applied to a categorial grammar. Taken together with the initial arguments, I infer that a universal theory of meaning is impossible and conclude the paper with a brief discussion on what alternatives are available. (shrink)

This paper presents a critical reflection on dynamic consistency as commonly used in economics and decision theory, and on the difficulty to test it experimentally. It distinguishes between the uses of the term dynamic consistency in order to characterize two different properties: the first accounts for the neutrality of individual preferences towards the timing of resolution of uncertainty whereas the second guarantees that a strategy chosen at the beginning of a sequential decision problem is immune to any reevaluation (...) and will effectively be implemented from then on in the decision problem. Although these two properties are equivalent under expected utility, this is not the case under non-EU. Building on the possible characteristics of individual dynamic preferences under risk, this paper proposes a conceptual categorization, that is experimentally testable, of possible sequential decision making behaviors of non-EU maximizers. (shrink)

Long presented as a universal policy-recipe for social prosperity and economic growth, the promise of innovation seems to be increasingly in question, giving way to a new vision of progress in which society is advanced as a central enabler of technoeconomic development. Frameworks such as “Responsible” or “Mission-oriented” Innovation, for example, have become commonplace parlance and practice in the governance of the innovation–society nexus. In this paper, we study the dynamics by which this “social fix” to technoscience has gained legitimacy (...) in institutions of global governance by investigating recent projects at two international organizations, the Organization for Economic Cooperation and Development and the European Commission, to mainstream “Responsible Innovation” frameworks and instruments across countries. Our analysis shows how the turn to societal participation in both organizations relies on a new deficit logic—a democratic deficit of innovation—that frames a lack of societal engagement in innovation governance as a major barrier to the uptake and dissemination of new technologies. These deficit politics enable global governance institutions to present “Responsible Innovation” frameworks as the solution and to claim authority over the coproduction of particular forms of democracy and innovation as intertwined pillars of a market-liberal international order. (shrink)

In this paper, we study when a set-continuous operator has a fixed-point that is the intersection of a directed family. The framework of our study is the Kelley-Morse theory KMC– and the Gödel-Bernays theory GBC–, both theories including an Axiom of Choice and excluding the Axiom of Foundation. On the one hand, we prove a result concerning monotone operators in KMC– that cannot be proved in GBC–. On the other hand, we study conditions on directed superclasses in GBC– in (...) order that their intersection is a fixed-point of a set-continuous operator. Finally, we illustrate our results with a solution to the liar paradox and a construction of maximal bisimulations. (shrink)

One of the problems in economics that economists have devoted a considerable amount of attention in prevalent years has been to ensure consistency in the models they employ. Assuming markets to be generally in some state of equilibrium, it is asked under what circumstances such equilibrium is possible. The fundamental mathematical tools used to address this concern are fixed point theorems: the conditions under which sets of assumptions have a solution. This book gives the reader access to the mathematical (...) techniques involved and goes on to apply fixed point theorems to proving the existence of equilibria for economics and for co-operative and noncooperative games. Special emphasis is given to economics and games in cases where the preferences of agents may not be transitive. The author presents topical proofs of old results in order to further clarify the results. He also proposes fresh results, notably in the last chapter, that refer to the core of a game without transitivity. This book will be useful as a text or reference work for mathematical economists and graduate and advanced undergraduate students. (shrink)

In the face of the Brexit vote and the election of Trump, there is serious worry about whether the liberal, democratic, and cosmopolitan values thought to underlie progressive immigration policies are in fact widely shared. In this article, I examine these worries and provide suggestions about how those who do favor just progressive immigration policies might best respond to the problems we currently face.

We consider fixed point logics, i.e., extensions of first order predicate logic with operators defining fixed points. A number of such operators, generalizing inductive definitions, have been studied in the context of finite model theory, including nondeterministic and alternating operators. We review results established in finite model theory, and also consider the expressive power of the resulting logics on infinite structures. In particular, we establish the relationship between inflationary and nondeterministic fixed point logics and second (...) class='Hi'>order logic, and we consider questions related to the determinacy of games associated with alternating fixed points. (shrink)

Reviewed Works:Dick de Jongh, Franco Montagna, Provable Fixed Points.Dick de Jongh, Franco Montagna, Much Shorter Proofs.Alessandra Carbone, Franco Montagna, Rosser Orderings in Bimodal Logics.Alessandra Carbone, Franco Montagna, Much Shorter Proofs: A Bimodal Investigation.

Epistemologies are overwhelmingly riddled with biases, influenced by ideologies and fixed ideas. Max Stirner and Louis Althusser argue at length regarding the negative impact of these on our way of thinking. This paper argues that the only escape from Stirner's fixed ideas or Althusser's ISAs (Ideological State Apparatuses) is through an apathetic disposition to the truth – something very unphilosophical in nature. In order to create parallactic shifts in thought, we must also develop a new epistemology, one (...) rooted in apathy. Through this, we can become true philosophers and thinkers moving towards a truth not solely determined by our pre-held assumptions. (shrink)

Jeffrey updating is a natural extension of Bayesian updating to cases where the evidence is uncertain. But, the resulting degrees of belief appear to be sensitive to the order in which the uncertain evidence is acquired, a rather un-Bayesian looking effect. This order dependence results from the way in which basic Jeffrey updating is usually extended to sequences of updates. The usual extension seems very natural, but there are other plausible ways to extend Bayesian updating that maintain (...) class='Hi'>order-independence. I will explore three models of sequential updating, the usual extension and two alternatives. I will show that the alternative updating schemes derive from extensions of the usual rigidity requirement, which is at the heart of Jeffrey updating. Finally, I will establish necessary and sufficient conditions for order-independent updating, and show that extended rigidity is closely related to these conditions. (shrink)

We show that any coherent complete partial order is obtainable as the fixed-point poset of the strong Kleene jump of a suitably chosen first-order ground model. This is a strengthening of Visser’s result that any finite ccpo is obtainable in this way. The same is true for the van Fraassen supervaluation jump, but not for the weak Kleene jump.