1. Seikyō ronkō -- 2-3. Shibunrui -- 4-10. Rangai shorui -- 11-12. Genshi shiroku -- 13-14. Fukureki.

Genshi shiroku -- Hakurokudō Shoin keijimon.

We can easily discriminate self-produced from externally generated sensory signals. Recent studies suggest that the prediction of the sensory consequences of one’s own actions made by forward model can be used to attenuate the sensory effects of self-produced movements, thereby enabling a differentiation of the self-produced sensation from the externally generated one. The present study showed that attenuation of sensation occurred both when participants themselves performed a goal-directed action and when they observed experimenter performing the same action, although they clearly (...) reported that the tones were produced by other during action observation and by themselves during their own action. These results suggest that sensory prediction of action modulates ongoing auditory processing irrespective of who produces the sounds and that the explicit judgment of agency does not necessarily rely on the same mechanisms on which implicit perceptual measures such as sensory attenuation rely. (shrink)

Utterances of explicit performatives, such as “I order you to close the door,” have the forces named by the appearing verbs; here, the utterance has the force of ordering. These utterances utilize declarative sentences, which usually indicate the force of statements, rather than of any verbs contained in them. This leads many to theorize that explicit performatives are statements that cause their hearers to infer the forces they name. This article argues against this account on the grounds that it is (...) based on the false premise that hearers can unconsciously recognize illocutionary forces. Instead, I put forward the account that explicit performatives are nothing but the acts with the forces that they name. (shrink)

The number of competing-brands changes by new product's entry. The new product introduction is endemic among consumer packaged goods firm and is an integral component of their marketing strategy. As a new product's entry affects markets, there is a pressing need to develop market response model that can adapt to such changes. In this paper, we develop a dynamic model that capture the underlying evolution of the buying behavior associated with the new product. This extends an application of a dynamic (...) linear model, which is used by a number of time series analyses, by allowing the observed dimension to change at some point in time. Our model copes with a problem that dynamic environments entail: changes in parameter over time and changes in the observed dimension. We formulate the model with framework of a state space model. We realize an estimation of the model using modified Kalman filter/fixed interval smoother. We find that new product's entry (1) decreases brand differentiation for existing brands, as indicated by decreasing difference between cross-price elasticities; (2) decreases commodity power for existing brands, as indicated by decreasing trend; and (3) decreases the effect of discount for existing brands, as indicated by a decrease in the magnitude of own-brand price elasticities. The proposed framework is directly applicable to other fields in which the observed dimension might be change, such as economic, bioinformatics, and so forth. (shrink)

人間であること、これを問う政治哲学の徹底。その先に見えるのは、果たして平和的共存の根源性か、戦いのそのとき、自分以外ではありえない人間の生々しさか。.

We highlight that the connection of well-foundedness and recursive definitions is more than just convenience. While the consequences of making well-foundedness a sufficient condition for the existence of hierarchies have been extensively studied, we point out that well-foundedness is a necessary condition for the existence of hierarchies e.g. that even in an intuitionistic setting α⊢wfwhereα\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${_\alpha \vdash \mathsf{wf}\, {\rm where}\, _\alpha}$$\end{document} stands for the iteration of Π10\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...) \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi^0_1}$$\end{document} comprehension along some ordinal α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\alpha}$$\end{document} and wf\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{wf}}$$\end{document} stands for the well-foundedness of α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\alpha}$$\end{document}. (shrink)

Crew Pairing is one of the most important and difficult problems for airline companies. Nets to fuel costs, the crew costs constitute the largest cost of airlines, and the crew costs depend on the quality of the solution to the pairing problem. Conventional systems have been used to solve a daily model, which handles only regular flights with many simplifications, so a lot of corrections are needed to get a feasible solution and the quality of the solution is not so (...) high. A fully dated model, which handles regular flights and irregular flights simultaneously, is extremely hard and has not been solved directly hitherto. The number of irregular flights tend to increase in Europe and Japan, hence the resolution of the practical fully dated pairing system is desired. This paper presents a new approach which solves directly the fully dated crew pairing by Genetic Algorithms. GA is improved with stochastic processes to attack the fully dated model, and many heuristics are included in the decoding mecanism of the GA. For several hundred flights per day for fully dated 2 months scheduling period, the system found better or equivalent solutions to the human scheduler’s without any simplification from 5 to 20 times faster. (shrink)

Schedule planning is one of the most crucial issues for any airline company, because the profit of the company directly depends on the efficiency of the schedule. This paper presents a novel scheduling method which solves problems related to time scheduling, fleet assignment and maintenance routing simultaneously by Genetic Algorithms. Every schedule constraint is embeded in the fitness function, which is described as an object oriented model and works as a simulater developing itself over time, and whose solution is executable (...) without human correction. The schedular is able to solve the problems involving several hundred flights in a few hours, and the solutions are superior or equivalent to those by human experts in terms of the estimated profit. (shrink)

We introduce a new axiom called inductive dichotomy, a weak variant of the axiom of inductive definition, and analyze the relationships with other variants of inductive definition and with related axioms, in the general second order framework, including second order arithmetic, second order set theory and higher order arithmetic. By applying these results to the investigations on the determinacy axioms, we show the following. (i) Clopen determinacy is consistency-wise strictly weaker than open determinacy in these frameworks, except second order arithmetic; (...) this is an enhancement of Schweber–Hachtman separation of open and clopen determinacy into the consistency-wise separation. (ii) Hausdorff–Kuratowski hierarchy of differences of opens is faithfully reflected by the hierarchy of consistency strengths of corresponding parameter-free determinacies in the aforementioned frameworks; this result is valid also in second order arithmetic only except clopen determinacy. (shrink)

This article reports that some robustness of the notions of predicativity and of autonomous progression is broken down if as the given infinite total entity we choose some mathematical entities other than the traditionalω. Namely, the equivalence between normal transfinite recursion scheme and newdependent transfinite recursionscheme, which does hold in the context of subsystems of second order number theory, does not hold in the context of subsystems of second order set theory where the universeVof sets is treated as the given (...) totality. (shrink)

A standard methodology in philosophy of language is to use intuitions as evidence. Machery, Mallon, Nichols, and Stich challenged this methodology with respect to theories of reference by presenting empirical evidence that intuitions about one prominent example from the literature on the reference of proper names vary between Westerners and East Asians. In response, Sytsma and Livengood conducted experiments to show that the questions Machery and colleagues asked participants in their study were ambiguous, and that this ambiguity affected the responses (...) given by Westerners. Sytsma and Livengood took their results to cast doubt on the claim that the current evidence indicates that there is cross-cultural variation in intuitions about the Gödel case. In this paper we report on a new cross-cultural study showing that variation in intuitions remains even after controlling for the ambiguity noted by Sytsma and Livengood. (shrink)

We introduce a new simple way of defining the forcing method that works well in the usual setting under FA, the Foundation Axiom, and moreover works even under Aczel's AFA, the Anti-Foundation Axiom. This new way allows us to have an intuition about what happens in defining the forcing relation. The main tool is H. Friedman's method of defining the extensional membership relation ∈ by means of the intensional membership relation ε .Analogously to the usual forcing and the usual generic (...) extension for FA-models, we can justify the existence of generic filters and can obtain the Forcing Theorem and the Minimal Model Theorem with some modifications. These results are on the line of works to investigate whether model theory for AFA-set theory can be developed in a similar way to that for FA-set theory.Aczel pointed out that the quotient of transition systems by the largest bisimulation and transition relations have the essentially same theory as the set theory with AFA. Therefore, we could hope that, by using our new method, some open problems about transition systems turn out to be consistent or independent. (shrink)

... because the thing-in-itself has no abnormality. Anything unusual will appear, after I myself see it: Abnormality belongs not to the thing-in-itself, but to myself. Kuo P'u (276-324), Shan-hai ching (Scriptures of the Mountains and the Seas).

We study filters in residuated structures that are associated with congruence relations (which we call -filters), and develop a semantical theory for general substructural logics based on the notion of primeness for those filters. We first generalize Stone’s sheaf representation theorem to general substructural logics and then define the primeness of -filters as being “points” (or stalkers) of the space, the spectrum, on which the representing sheaf is defined. Prime FL-filters will turn out to coincide with truth sets under various (...) well known semantics for certain substructural logics. We also investigate which structural rules are needed to interpret each connective in terms of prime -filters in the same way as in Kripke or Routley-Meyer semantics. We may consider that the set of the structural rules that each connective needs in this sense reflects the difficulty of giving the meaning of the connective. A surprising discovery is that connectives , ⅋ of linear logic are linearly ordered in terms of the difficulty in this sense. (shrink)

By obtaining several new results on Cook-style two-sorted bounded arithmetic, this paper measures the strengths of the axiom of extensionality and of other weak fundamental set-theoretic axioms in the absence of the axiom of infinity, following the author’s previous work [K. Sato, The strength of extensionality I — weak weak set theories with infinity, Annals of Pure and Applied Logic 157 234–268] which measures them in the presence. These investigations provide a uniform framework in which three different kinds of (...) reverse mathematics–Friedman–Simpson’s “orthodox” reverse mathematics, Cook’s bounded reverse mathematics and large cardinal theory–can be reformulated within one language so that we can compare them more directly. (shrink)

Following the finitist’s rejection of the complete totality of the natural numbers, a finitist language allows only propositional connectives and bounded quantifiers in the formula-construction but not unbounded quantifiers. This is opposed to the currently standard framework, a first-order language. We conduct axiomatic studies on the notion of truth in the framework of finitist arithmetic in which at least smash function $\#$ is available. We propose finitist variants of Tarski ramified truth theories up to rank $\omega $, of Kripke–Feferman truth (...) theory and of Friedman–Sheard truth theory, and show that all of these have the same strength as the finitist arithmetic of one higher level along Grzegorczyk hierarchy. On the other hand, we also show that adding Burgess-style groundedness schema, adjusted to the finitist setting, makes Kripke–Feferman truth theory as strong as primitive recursive arithmetic. Meanwhile, we obtain some basic results on finitist theories of (full and hat) inductive definitions and on the second order axiom of hat inductive definitions for positive operators. (shrink)

We investigate which part of Brouwer’s Intuitionistic Mathematics is finitistically justifiable or guaranteed in Hilbert’s Finitism, in the same way as similar investigations on Classical Mathematics already done quite extensively in proof theory and reverse mathematics. While we already knew a contrast from the classical situation concerning the continuity principle, more contrasts turn out: we show that several principles are finitistically justifiable or guaranteed which are classically not. Among them are: fan theorem for decidable fans but arbitrary bars; continuity principle (...) and the axiom of choice both for arbitrary formulae; and $\Sigma _2$ induction and dependent choice. We also show that Markov’s principle MP does not change this situation; that neither does lesser limited principle of omniscience LLPO ; but that limited principle of omniscience LPO makes the situation completely classical. (shrink)

Dr. Sato's volume deals with the origin and formation of the political thought of pre-imperial Xun Zi, with close focus on this synthesizer's formative theory ...