Recently, many historians of science have chosen to present their historical narratives from the ‘actors’-eye view’. Scientific knowledge not available within the actors’ culture is not permitted to do explanatory work. Proponents of the Sociology of Scientific Knowledge purport to ground this historiography on epistemological relativism. I argue that they are making an unnecessary mistake: unnecessary because the historiographical genre in question can be defended on aesthetic and didactic grounds; and a mistake because the argument from relativism is in any (...) case incoherent.The argument of the present article is self-contained, but steers clear of metaphysical debates in the philosophy of science. To allay fears of hidden assumptions, the sequel, to be published in the following issue, will consider SSK’s prospects of succour from scientific realism, instrumentalism, and a metaphysical system of Bruno Latour’s own devising. (shrink)

This paper investigates the historiographical utility of psychoanalysis, focussing in particular on retrospective explanations of demonic possession and exorcism. It is argued that while 'full-blown' psychoanalytic explanations-those that impose Oedipus complexes, anal eroticism or other sophisticated theoretical structures on the historical actors-may be vulnerable to the charge of anachronism, a weaker form of retrospective psychoanalysis can be defended as a legitimate historical lens. The paper concludes, however, by urging historians to look at psychoanalysis as well as trying to look through (...) it. Full-blown psychoanalysis is a bad historical lens but it may, in some cases, be an excellent explanatory template: a thorough understanding of how psychoanalytic therapy functions in the modern world is, for example, a good theoretical preparation for historians seeking to understand the sixteenth-century's demonological universe. (shrink)

In this paper, we discuss guidelines for a reward design problem that defines when and what amount of reward should be given to the agent/s, within the context of reinforcement learning approach. We would like to take keepaway soccer as a standard task of the multiagent domain which requires skilled teamwork. The difficulties of designing reward for this task are due to its features as follows: i) since it belongs to the continuing task which has no explicit goal to achieve, (...) it is hard to tell when reward should be given to the agent/s. ii) since it is a multiagent cooperative task, it is hard to decide what is a fair share of reward for each agent's contribution to achieve the goal. Through some experiments, we show that the reward design have a major effect on the agent's behavior, and introduce the successful reward function that makes agents perform keepaway better and more interesting than the conventional one does. Finally, we explore the relationship between `reward design' and `acquired behaviors' from the viewpoint of teamwork. (shrink)

No enterprise as laborious and long-drawn out as the writing of history can be pursued without deeply held convictions as to its purpose and significance. With this in mind, Historians on History addresses the nature of historical enquiry by bringing together in one volume the key writings of many of the best known 20th century historians including Braudel, Carr, Elton, Guha, Hobsbawm, Samuel, Scott, and Zeldin. This new edition begins with a substantial survey by John Tosh charting historiographical developments (...) over the past sixty years. Each section of readings that follow includes a brief scene-setting introduction and illuminates the political, social and personal assumptions which have governed and sustained historical practice and theory. The selection of readings has been carefully revised to reflect the latest trends. The anthology strikes a balance between the academic mainstream and recent, more radical voices within the discipline. Students thus have access to a wide range of themes and debates. (shrink)

The method of analytic tableaux is employed in many introductory texts and has also been used quite extensively as a basis for automated theorem proving. In this paper, we discuss the complexity of the system as a method for refuting contradictory sets of clauses, and resolve several open questions. We discuss the three forms of analytic tableaux: clausal tableaux, generalized clausal tableaux, and binary tableaux. We resolve the relative complexity of these three forms of tableaux proofs and also resolve the (...) relative complexity of analytic tableaux versus resolution. We show that there is a quasi-polynomial simulation of tree resolution by analytic tableaux; this simulation is close to optimal, since we give a matching lower bound that is tight to within a polynomial. (shrink)

Historians of science have frequently sought to exclude modern scientific knowledge from their narratives. Part I of this paper, published in the previous issue, cautioned against seeing more than a literary preference at work here. In particular, it was argued—contra advocates of the Sociology of Scientific Knowledge —that a commitment to epistemological relativism should not be seen as having straightforward historiographical consequences. Part II considers further SSK-inspired attempts to entangle the currently fashionable historiography with particular positions in the philosophy of (...) science. None, I argue, is promising. David Bloor’s proposed alliance with scientific realism relies upon a mistaken view of contrastive explanation; Andrew Pickering’s appeal to instrumentalism is persuasive for particle physics but much less so for science as a whole; and Bruno Latour’s home-grown metaphysics is so bizarre that its compatibility with SSK is, if anything, a further blow to the latter’s plausibility. (shrink)

This paper defends the right of historians to make use of their knowledge of the remote consequences of past actions. In particular, it is argued that the disciplinary cohesion of the history of science relies crucially upon our ability to target, for further investigation, those past activities ancestral to modern science. The history of science is not limited to the study of those activities but it is structured around them. In this sense, the discipline is inherently ‘present-centred’: its boundaries are (...) determined, in part, by judgements inaccessible to the historical actors. Present-centredness of this sort, it is urged, should not be regarded as a problem; its methodological consequences are minimal.Author Keywords: Anachronism; Diachronic history; Present-centred history; Actors’ categories; Historical causation; Retrospective explanation. (shrink)

In this paper we formulate epsilon substitution method for a theory $\Pi _{2}^{0}$-FIX for non-monotonic $\Pi _{2}^{0}$ inductive definitions. Then we give a termination proof of the H-processes based on Ackermann [1].

Introducing key themes including the role of sources, Marxism, radicalism, gender and race, this reader brings into focus recent historiographic trends to promote further debate across related disciplines including philosophy and literature.

Historians must be sensitive to the alienness of the past. Insofar as they are concerned with their actors’ reasoning, they must (through open-minded empirical investigation) find out how their actors thought, and not assume that they thought like us. This is familiar historiographical advice, but pushed too far it can be brought to conflict with rather weak assumptions about what historians must presuppose if they are to interpret their actors at all. The present paper sketches those assumptions, and argues that (...) the influential ‘Strong Program’ in the Sociology of Scientific Knowledge (SSK) falls foul of them. We do not argue from the correctness of the assumptions to the falsity of SSK. Rather, we note the incompatibility, and then show how SSK theorists’ tendency to take interpretation for granted blinds them—and perhaps their readers—to the existence of the conflict. (shrink)

The view that chances are relative frequencies of occurrence within actual, finite reference classes has long been written off. I argue that it ought to be reconsidered. Focusing on non-deterministic chance, I defend a version of finite frequentism in which reference classmates are required to have qualitatively identical pasts. While my analysis can evade or resist several standard objections, it has a counterintuitive consequence: non-trivial chances entail the existence of past light cones that are perfect intrinsic duplicates. In mitigation, I (...) argue that our scientific knowledge is consistent with the hypothesis that there are many such duplicates in the actual world. Moreover, my analysis has some striking advantages: it is simple, it is metaphysically undemanding, and it makes possible a satisfying explanation of the chance–credence connection. 1 Introduction2 Target3 Sketch and Skirmish4 Articulation5 Standard Worries5.1 Frequency tolerance5.2 Leibniz’s dictum5.3 Single case chance5.4 Missing values5.5 Explanation5.6 Counterfactual chances6 Chance and Credence6.1 An indefeasible indifference intuition6.2 Articulating the credence principle6.3 Appraising the credence principle7 Confirmation8 Laws9 Summing Up. (shrink)

Cell therapy means treating diseases with the body's own cells. One of the cell types most in demand for therapeutic purposes is the pancreatic β‐cell. This is because diabetes is one of the major healthcare problems in the world. Diabetes can be treated by islet transplantation but the major limitation is the shortage of organ donors. To overcome the shortfall in donors, alternative sources of pancreatic β‐cells must be found. Potential sources include embryonic or adult stem cells or, from existing (...) β‐cells. There is now a startling new addition to this list of therapies: the pancreatic α‐cell. Thorel and colleagues recently showed that under circumstances of extreme pancreatic β‐cell loss, α‐cells may serve to replenish the insulin‐producing compartment. This conversion of α‐cells to β‐cells represents an example of transdifferentiation. Understanding the molecular basis for transdifferentiation may help to enhance the generation of β‐cells for the treatment of diabetes. (shrink)

This paper deals with a proof theory for a theory T22 of recursively Mahlo ordinals in the form of Π2-reflecting on Π2-reflecting ordinals using a subsystem Od of the system O of ordinal diagrams in Arai 353). This paper is the first published one in which a proof-theoretic analysis à la Gentzen–Takeuti of recursively large ordinals is expounded.

Previous research reported that in processing structurally ambiguous sentences comprehenders often preserve an initial incorrect analysis even after adopting a correct analysis following structural disambiguation. One criticism is that the sentences tested in previous studies involved referential ambiguity and allowed comprehenders to make inferences about the initial interpretation using pragmatic information, suggesting the possibility that the initial analysis persisted due to comprehenders' pragmatic inference but not to their failure to perform complete reanalysis of the initial misanalysis. Our study investigated this (...) by testing locally ambiguous relative clause sentences in Japanese, in which the initial misinterpretation contradicts the correct interpretation. Our study using a self-paced reading technique demonstrated evidence for the persistence of the initial analysis with this structure. The results from an eye-tracking study further suggested that the phenomenon directly reflected the amount of support given to the initial incorrect analysis prior to disambiguating information: The more supported the incorrect main clause analysis was, the more likely comprehenders were to preserve the analysis even after the analysis was falsified. Our results thus demonstrated that the preservation of the initial analysis occurs not due to referential ambiguities but to comprehenders' difficulty to fully revise the highly supported initial interpretation. (shrink)

This paper deals with a proof theory for a theory T3 of Π3-reflecting ordinals using the system O of ordinal diagrams in Arai 1375). This is a sequel to the previous one 1) in which a theory for recursively Mahlo ordinals is analyzed proof-theoretically.

Hilbert proposed the epsilon substitution method as a basis for consistency proofs. Hilbert's Ansatz for finding a solving substitution for any given finite set of transfinite axioms is, starting with the null substitution S0, to correct false values step by step and thereby generate the process S0,S1,… . The problem is to show that the approximating process terminates. After Gentzen's innovation, Ackermann 162) succeeded to prove termination of the process for first order arithmetic. Inspired by G. Mints as an Ariadne's (...) thread we formulate the epsilon substitution method for the theory ID1 of non-iterated inductive definitions for disjunctions of simply universal and existential operators, and give a termination proof of the H-process based on Ackermann 162). The termination proof is based on transfinite induction up to the Howard ordinal. (shrink)

In this, journal, W. Buchholz gave an elegant proof of a characterization theorem for provably total recursive functions in the theory IDv for the v-times iterated inductive definitions . He characterizes the classes of functions by Hardy functions. In this note we will show that a slow growing analogue to the theorem can be obtained by a slight modification of Buchholz' proof.

We formulate epsilon substitution method for theories (H)α0 of absolute jump hierarchies, and give two termination proofs of the H-process: The first proof is an adaption of Mints M, Mints-Tupailo-Buchholz MTB, i.e., based on a cut-elimination of a specially devised infinitary calculus. The second one is an adaption of Ackermann Ack. Each termination proof is based on transfinite induction up to an ordinal θ(α0+ ω)0, which is best possible.

We gather the following miscellaneous results in proof theory from the attic.1. 1. A provably well-founded elementary ordering admits an elementary order preserving map.2. 2. A simple proof of an elementary bound for cut elimination in propositional calculus and its applications to separation problem in relativized bounded arithmetic below S21.3. 3. Equivalents for Bar Induction, e.g., reflection schema for ω logic.4. 4. Direct computations in an equational calculus PRE and a decidability problem for provable inequations in PRE.5. 5. Intuitionistic fixed (...) point theories which are conservative extensions of HA.6. 6. Proof theoretic strengths of classical fixed points theories.7. 7. An equivalence between transfinite induction rule and iterated reflection schema over IΣn.8. 8. Derivation lengths of finite rewrite rules reducing under lexicographic path orders and multiply recursive functions.Each section can be read separately in principle. (shrink)

This study addressed the question of whether L2 learners are able to utilize verb’s argument structure information in online structural analysis. Previous L2 research has shown that L2 learners have difficulty in using verb’s intransitive information to guide online syntactic processing. This is true even though L2 learners have grammatical knowledge that is correct and similar to that of native speakers. In the present study, we contrasted three hypotheses, the initial inaccessibility account, the intransitivity overriding account, and the fuzzy subcategorization (...) frame account, to investigate whether L2 learner’s knowledge of intransitive verbs is in fact ignored in L2 online structural analysis. The initial inaccessibility account and the fuzzy subcategorization frame account predicted that L2 learners cannot access intransitivity information in building syntactic structures in any situation. The intransitivity overriding account predicted that intransitivity information is accessed in L2 parsing, but this process is overridden by the strong transitivity preference when a verb is followed by a noun phrase. Importantly, the intransitivity overriding account specifically predicted that L2 learners would be able to use intransitive information in online syntactic processing when a noun phrase does not appear immediately following a verb. We tested the three accounts in an eye-tracking reading experiment using filler-gap dependency structures. We manipulated verb’s transitivity information and lexically based plausibility information and tested English native speakers as a control L1 group and Japanese-English L2 participants. The results showed that L2 learners as well as native speakers processed sentences differently depending on the subcategorization information of the verb, and adopted transitive analysis only when the verb was optionally transitive, providing support for the intransitivity overriding. The results further demonstrated that L2 learners had strong expectations for the transitive structure, which is consistent with the view proposed by the hyper-active gap-filling hypothesis. In addition, the results showed that the semantic mismatch in the incorrect transitive analysis facilitated native speaker’s processing but caused difficulty for L2 learners. Together, the current study provides evidence that L2 learners use intransitive information of the verbs to guide their structural analysis when there are no overriding constraints. (shrink)

In this note the well-ordering principle for the derivative \ of normal functions \ on ordinals is shown to be equivalent to the existence of arbitrarily large countable coded \-models of the well-ordering principle for the function \.

In Arai (An ordinal analysis of a single stable ordinal, submitted) it is shown that an ordinal \(\sup _{N is an upper bound for the proof-theoretic ordinal of a set theory \(\mathsf {KP}\ell ^{r}+(M\prec _{\Sigma _{1}}V)\). In this paper we show that a second order arithmetic \(\Sigma ^{1-}_{2}{\mathrm {-CA}}+\Pi ^{1}_{1}{\mathrm {-CA}}_{0}\) proves the wellfoundedness up to \(\psi _{\varOmega _{1}}(\varepsilon _{\varOmega _{{\mathbb {S}}+N+1}})\) for each _N_. It is easy to interpret \(\Sigma ^{1-}_{2}{\mathrm {-CA}}+\Pi ^{1}_{1}{\mathrm {-CA}}_{0}\) in \(\mathsf {KP}\ell ^{r}+(M\prec _{\Sigma (...) _{1}}V)\). (shrink)

In this paper we introduce a recursive notation system $O(\mu)$ of ordinals. An element of the notation system is called an ordinal diagram following G. Takeuti [25]. The system is designed for proof theoretic study of theories of recursively Mahlo universes. We show that for each $\alpha<\Omega$ in $O(\mu)$ KPM proves that the initial segment of $O(\mu)$ determined by $\alpha$ is a well ordering. Proof theoretic study for such theories will be reported in [9].

In this paper, we prove the wellfoundedness of recursive notation systems for reflecting ordinals up to Π₃-reflection by relevant inductive definitions.

We show that the existence of a weakly compact cardinal over the Zermelo–Fraenkel's set theory ZF is proof-theoretically reducible to iterations of Mostowski collapsings and Mahlo operations.

In this paper we introduce a recursive notation system O(Π 3 ) of ordinals. An element of the notation system is called an ordinal diagram. The system is designed for proof theoretic study of theories of Π 3 -reflection. We show that for each $\alpha in O(Π 3 ) a set theory KP Π 3 for Π 3 -reflection proves that the initial segment of O(Π 3 ) determined by α is a well ordering. Proof theoretic study for such theories (...) will be reported in [4]. (shrink)

We show that the consistency of the first order arithmetic $PA$ follows from the pointwise induction up to the Howard ordinal. Our proof differs from U. Schmerl [Sc]: We do not need Girard's Hierarchy Comparison Theorem. A modification on the ordinal assignment to proofs by Gentzen and Takeuti [T] is made so that one step reduction on proofs exactly corresponds to the stepping down $\alpha\mapsto\alpha [1]$ in ordinals. Also a generalization to theories $ID_q$ of finitely iterated inductive definitions is proved.

Speech is intelligible even when the temporal envelope of speech is distorted. The current study investigates how native and non-native speakers perceptually restore temporally distorted speech. Participants were native English speakers (NS), and native Japanese speakers who spoke English as a second language (NNS). In Experiment 1, participants listened to “locally time-reversed speech” where every x-ms of speech signal was reversed on the temporal axis. Here, the local time reversal shifted the constituents of the speech signal forward or backward from (...) the original position, and the amplitude envelope of speech was altered as a function of reversed segment length. In Experiment 2, participants listened to “modulation-filtered speech” where the modulation frequency components of speech were low-pass filtered at a particular cut-off frequency. Here, the temporal envelope of speech was altered as a function of cut-off frequency. The results suggest that speech becomes gradually unintelligible as the length of reversed segments increases (Experiment 1), and as a lower cut-off frequency is imposed (Experiment 2). Both experiments exhibit the equivalent level of speech intelligibility across six levels of degradation for native and non-native speakers respectively, which poses a question whether the regular occurrence of local time reversal can be discussed in the modulation frequency domain, by simply converting the length of reversed segments (ms) into frequency (Hz). (shrink)

In this paper we introduce a system AID of bounded arithmetic. The main feature of AID is to allow a form of inductive definitions, which was extracted from Buss’ propositional consistency proof of Frege systems F in Buss 3–29). We show that AID proves the soundness of F , and conversely any Σ 0 b -theorem in AID yields boolean sentences of which F has polysize proofs. Further we define Σ 1 b -faithful interpretations between AID+Σ 0 b -CA and (...) a quantified theory QALV of an equational system ALV in Clote 57–106). Hence ALV also proves the soundness of F. (shrink)

In this note we give a simplified ordinal analysis of first-order reflection. An ordinal notation system$OT$is introduced based on$\psi $-functions. Provable$\Sigma _{1}$-sentences on$L_{\omega _{1}^{CK}}$are bounded through cut-elimination on operator controlled derivations.