We show that length initial submodels of S12 can be extended to a model of weak second order arithmetic. As a corollary we show that the theory of length induction for polynomially bounded second order existential formulae cannot define the function division.

In this paper, we propose an extension of the Minimal Generation Gap (MGG) to reduce the number of fitness evaluation for the real-coded GAs (RCGA). When MGG is applied to actual engineering problems, for example applied to optimization of design parameters, the fitness calculating time is usually huge because MGG generates many children from one pair of parents and the fitness is calculated by repetitive simulation or analysis. The proposed method called Saving MGG reduces the number of fitness evaluation by (...) estimating the promising degrees of children using individual distribution and fitness information of population, and selecting children based on the promising degree before evaluating the fitness. Experimental results show that RCGA with Saving MGG can provide large reducing effects on 20 or 30 dimensional Sphere functions, Rosenbrock functions, ill-scaled Rosenbrock functions, and Rastrigin function. (shrink)

We investigate a subsystem of minimal logic related to D. Vakarelov’s logic \, using the framework of subminimal logics by A. Colacito, D. de Jongh and A. L. Vargas. In the course of it, the relationship between the two semantics in the respective frameworks is clarified. In addition, we introduce a sequent calculus for the investigated subsystem, and some proof-theoretic properties are established. Lastly, we formulate a new infinite class of subsystems of minimal logics.

S-Modulin is a frog homolog of recoverin. The function and the underlying mechanism of the action of these proteins are now understood in general. However, there remain some unsolved issues including; two distinct effects of S-modulin; Ca2+-dependent binding of S-modulin to membranes and a possible target protein; S-modulin-like proteins in other neurons. These issues are considered in this commentary.

In dieser Abhandlung versuchen wir die Theorie des Erhabenen bei Kant als eine Logik der reflektierenden Urteilskraft darzustellen, die den Ubergang des Sinnlichen ins Ubersinnliche ermoglicht. Die Urteilskraft bezieht die Spannung der Einbildungskraft vor dem Nicht-Darstellbaren auf das Ubersinnliche, und in dieser Beziehung sieht Kant "eine a priori im Subjekte liegende Zweckmassigkeit". Durch die Vorstellung der gewaltigen Natur kann unsere innere Idee erweckt werden, wenn wir berucksichtigen, "dass auf jene moralischen Anlagen bei jeder schicklichen Veranlassung Rucksicht genommen werden sollte". Durch (...) das Urteil uber das Erhabene erhalten wir eine Veranlassung fur diejenige Reflexion, die innerhalb der Natur auch die ubersinnliche Idee (oder ein gottliches Wesen) denkt. (edited). (shrink)

Kripke completeness of some infinitary predicate modal logics is presented. More precisely, we prove that if a normal modal logic above is -persistent and universal, the infinitary and predicate extension of with BF and BF is Kripke complete, where BF and BF denote the formulas pi pi and x x, respectively. The results include the completeness of extensions of standard modal logics such as , and its extensions by the schemata T, B, 4, 5, D, and their combinations. The proof (...) is obtained by extending the correspondence between the representation of modal algebras and the completeness of propositional modal logic to infinite. (shrink)

November 4th-5th, 2012 at Kyoto University. Organizers: Hisashi Nakao & Pierre-Alain Braillard.

Despite the tendency to be otherwise, some non-classical logics are known to validate formulas that are invalid in classical logic. A subclass of such systems even possesses pairs of a formula and its negation as theorems, without becoming trivial. How should these provable contradictions be understood? The present paper aims to shed light on aspects of this phenomenon by taking as samples the constructive connexive logic C, which is obtained by a simple modification of a system of constructible falsity, namely (...) N4, as well as its non-constructive extension C3. For these systems, various observations concerning provable contradictions are made, using mainly a proof-theoretic approach. The topics covered in this paper include: how new contradictions are found from parts of provable contradictions; how to characterise provable contradictions in C3 that are constructive; how contradictions can be seen from the relative viewpoint of strong implication; and as an appendix an attempt at generating provable contradictions in C3. (shrink)

Eukaryotic genome DNA is wrapped around core histones and forms a nucleosome structure. Together with associated proteins and RNAs, these nucleosomes are organized three‐dimensionally in the cell as chromatin. Emerging evidence demonstrates that chromatin consists of rather irregular and variable nucleosome arrangements without the regular fiber structure and that its dynamic behavior plays a critical role in regulating various genome functions. Single‐nucleosome imaging is a promising method to investigate chromatin behavior in living cells. It reveals local chromatin motion, which reflects (...) chromatin organization not observed in chemically fixed cells. The motion data is like a gold mine. Data analyses from many aspects bring us more and more information that contributes to better understanding of genome functions. In this review article, we describe imaging of single‐nucleosomes and their tracked behavior through oblique illumination microscopy. We also discuss applications of this technique, especially in elucidating nucleolar organization in living cells. (shrink)

We prove in the framework of Bishop's constructive mathematics that the sequential completion equation image of the space [MATHEMATICAL SCRIPT CAPITAL D] is filter-complete. Then it follows as a corollary that the filter-completeness of [MATHEMATICAL SCRIPT CAPITAL D] is equivalent to the principle BD-ℕ, which can be proved in classical mathematics, Brouwer's intuitionistic mathematics and constructive recursive mathematics of Markov's school, but does not in Bishop's constructive mathematics. We also show that equation image is identical with the filter-completion which was (...) provided by Bishop. (shrink)

We define a theory of two-sort bounded arithmetic whose provably total functions are exactly those in ${\mathcal{F}_{LOGCFL}}$ by way of a generalized quantifier that expresses computations of SAC 1 circuits. The proof depends on Kolokolova’s conditions for the connection between the provable capture in two-sort theories and descriptive complexity.

We define a fragment of Primitive Recursive Arithmetic by replacing the defining axioms for primitive recursive functions by those for functions in some specific complexity class. In this note we consider such theory for AC0. We present a model-theoretical property of this theory, by means of which we are able to characterize its provably total functions. Next we consider the problem of how strong the induction scheme can be in this theory.

We will give a two-sort system which axiomatizes winning strategies for the combinatorial game Node Kayles. It is shown that our system captures alternating polynomial time reasonings in the sense that the provably total functions of the theory corresponds to those computable in APTIME. We will also show that our system is equivalently axiomatized by Sprague–Grundy theorem which states that any Node Kayles position is provably equivalent to some NIM heap.

日本の固有の宗教神道より説き起こし、日本の仏教、歌人・念仏者・茶人・武人・医者・妙好人・禅僧・真宗僧侶・作家・俳人と多種な人間像を通して、日本人の生き生きとした生命の躍動感を解き明かす。.

Strong negation is a well-known alternative to the standard negation in intuitionistic logic. It is defined virtually by giving falsity conditions to each of the connectives. Among these, the falsity condition for implication appears to unnecessarily deviate from the standard negation. In this paper, we introduce a slight modification to strong negation, and observe its comparative advantages over the original notion. In addition, we consider the paraconsistent variants of our modification, and study their relationship with non-constructive principles and connexivity.

In this paper, we argue that a distinction ought to be drawn between two ways in which a given world might be logically impossible. First, a world w might be impossible because the laws that hold at w are different from those that hold at some other world (say the actual world). Second, a world w might be impossible because the laws of logic that hold in some world (say the actual world) are violated at w. We develop a novel (...) way of modelling logical possibility that makes room for both kinds of logical impossibility. Doing so has interesting implications for the relationship between logical possibility and other kinds of possibility (for example, metaphysical possibility) and implications for the necessity or contingency of the laws of logic. (shrink)

A logic is called 'paraconsistent' if it rejects the rule called 'ex contradictione quodlibet', according to which any conclusion follows from inconsistent premises. While logicians have proposed many technically developed paraconsistent logical systems and contemporary philosophers like Graham Priest have advanced the view that some contradictions can be true, and advocated a paraconsistent logic to deal with them, until recent times these systems have been little understood by philosophers. This book presents a comprehensive overview on paraconsistent logical systems to change (...) this situation. The book includes almost every major author currently working in the field. The papers are on the cutting edge of the literature some of which discuss current debates and others present important new ideas. The editors have avoided papers about technical details of paraconsistent logic, but instead concentrated upon works that discuss more 'big picture' ideas. Different treatments of paradoxes takes centre stage in many of the papers, but also there are several papers on how to interpret paraconistent logic and some on how it can be applied to philosophy of mathematics, the philosophy of language, and metaphysics. (shrink)

An assessment of mood or emotion is important in developing mental health measures, and facial expressions are strongly related to mood or emotion. This study thus aimed to examine the relationship between levels of negative mood and characteristics of mouth parts when moods are drawn as facial expressions on a common platform. A cross-sectional study of Japanese college freshmen was conducted, and 1,068 valid responses were analyzed. The questionnaire survey consisted of participants’ characteristics, the Profile of Mood States, and a (...) sheet of facial expression drawing, and the sheet was digitized and analyzed using an image-analysis software. Based on the total POMS score as an index of negative mood, the participants were divided into four groups: low, normal, high, and very high. Lengths of drawn lines and between both mouth corners were significantly longer, and circularity and roundness were significantly higher in the L group. With increasing levels of negative mood, significant decreasing trends were observed in these lengths. Convex downward and enclosed figures were significantly predominant in the L group, while convex upward figures were significantly predominant and a tendency toward predominance of no drawn mouths or line figures was found in the H and VH groups. Our results suggest that mood states can be significantly related to the size and figure characteristics of drawn mouths of FACED on a non-verbal common platform. That is, these findings mean that subjects with low negative mood may draw a greater and rounder mouth and figures that may be enclosed and downward convex, while subjects with a high negative mood may not draw the line, or if any, may draw the line shorter and upward convex. (shrink)

It is known that for any subdirectly irreducible finite Heyting algebra A and any Heyting algebra, B, A is embeddable into a quotient algebra of B, if and only if Jankov's formula ${\rm{\chi A}}$ A for A is refuted in B. In this paper, we present an infinitary extension of the above theorem given by Jankov. More precisely, for any cardinal number ${\rm{\kappa }}$, we present Jankov's theorem for homomorphisms preserving infinite meets and joins, a class of subdirectly irreducible complete (...) ${\rm{\kappa }}$ - Heyting algebras and ${\rm{\kappa }}$ - infinitary logic, where a ${\rm{\kappa }}$ -Heyting algebra is a Heyting algebra A with ${\rm{\# A}} \le {\rm{\kappa }}$ and ${\rm{\kappa }}$ - infinitary logic is the infinitary logic such that for any set ${\rm{\Theta }}$ of formulas with ${\rm{\# \Theta }} \le {\rm{\kappa }}$ ⌈ Θ and ‷ Θ are well defined formulas. (shrink)

We investigate the relationship between M. De's empirical negation in Kripke and Beth Semantics. It turns out empirical negation, as well as co-negation, corresponds to different logics under different semantics. We then establish the relationship between logics related to these negations under unified syntax and semantics based on R. Sylvan's CCω.

Narrative views of the self argue that we constitute our self in self-narratives. Embodied views hold that our self is shaped through embodied experiences. In that case, what is the relation between embodiment and narrativity in the process of self-constitution? The question demands a clear definition of embodiment, but existing studies remains unclear on this point (section 2). We offer a correction to this situation by drawing on Merleau-Ponty’s analysis of the body that highlights its habituality. On this account, the (...) body has an inherent tendency to cultivate an organization of habits through its history of engagement with the world (section 3). Next, we explore its role in narrative self-constitution by distinguishing between two aspects of the narrative self, the narrated I and the narrating I (section 4). We argue on phenomenological grounds that self-narratives are informed by bodily perspectives in both respects. Furthermore, a focus on the habituality of the body allows for a better explanation of self-constitution than those based on implicit self-narratives (section 5). For these phenomenological and theoretical reasons, we conclude that narrative self-constitution is an embodied and embedded practice (section 6). (shrink)

Dharmakīrti argues that there is no pramāṇa (valid means of cognition or source of knowledge) for a thesis that is a self-contradiction (svavacanavirodha). That is, self-contradictions such as ‘everything said is false’ and ‘my mother is barren’ cannot be known to be true or false. The contemporary scholar Tillemans challenges Dharmakīrti by arguing that we can know that self-contradictions are false by means of a formal logical inference. The aims of the paper are to answer Tillemans’ challenge from what we (...) take to be Dharmakīrti’s or Dharmakīrtian (someone who is like Dharmakīrti) perspective and to demonstrate the unique features of Dharmakīrti’s view of inference. By so doing, we show that the epistemology in relation to the formal conception of logic that underlies Tillemans’ challenge is problematic from Dharmakīrti’s or Dharmakīrtian perspective. The paper, thus, presents Dharmakīrti’s view of inference and logical reasoning as well as a Dharmakīrtian challenge to the formal conception of logic that is the dominant contemporary conception. (shrink)

There was a time when 'logic' just meant classical logic. The climate is slowly changing and non-classical logic cannot be dismissed off-hand. However, a metatheory used to study the properties of non-classical logic is often classical. In this paper, we will argue that this practice of relying on classical metatheories is problematic. In particular, we will show that it is a bad practice because the metatheory that is used to study a non-classical logic often rules out the very logic it (...) is designed to study. (shrink)

Following on from Shaun Gallagher's influential 2005 book How the Body Shapes the Mind, this volume brings together leading experts from the fields of philosophy, neuroscience, psychology, and psychiatry in a productive dialogue, exploring key questions and debates about the relationship between body schema and body image.

N. Kamide introduced a pair of classical and constructive logics, each with a peculiar type of negation: its double negation behaves as classical and intuitionistic negation, respectively. A consequence of this is that the systems prove contradictions but are non-trivial. The present paper aims at giving insights into this phenomenon by investigating subsystems of Kamide’s logics, with a focus on a system in which the double negation behaves as the negation of minimal logic. We establish the negation inconsistency of the (...) system and embeddability of contradictions from other systems. In addition, we attempt at an informational interpretation of the negation using the dimathematical framework of H. Wansing. (shrink)

H. Omori and H. Wansing introduced in a recent paper possible alternatives for the negation of the logic of first-degree entailment. One of their observations with regard to these alternative negations is that some of them turn out to induce negation inconsistency, meaning that some contradictions become provable (under an arbitrary premise) when used in place of the original negation. Omori and Wansing also considered a non-deterministic generalisation of such operators, but it was left open whether the generalised negation similarly (...) induces negation inconsistency. In this paper, we provide an answer to this question in the positive, and moreover look into further generalisation and characterisation of non-deterministic operators which satisfy the formal criteria of negation inconsistency and its pair notion of negation incompleteness in the setting of Omori and Wansing. (shrink)

We show that each of $\Delta _{3}^{1}-{\rm CA}_{0}+\Sigma _{3}^{1}-{\rm IND}$ and $\Pi _{2}^{1}-{\rm CA}_{0}+\Pi _{3}^{1}-{\rm TI}$ proves $\Delta _{3}^{0}-{\rm Det}$ and that neither $\Sigma _{3}^{1}-{\rm IND}$ nor $\Pi _{3}^{1}-{\rm TI}$ can be dropped. We also show that neither $\Delta _{3}^{1}-{\rm CA}_{0}+\Sigma _{\infty}^{1}-{\rm IND}$ nor $\Pi _{2}^{1}-{\rm CA}_{0}+\Pi _{\infty}^{1}-{\rm TI}$ proves $\Sigma _{3}^{0}-{\rm Det}$. Moreover, we prove that none of $\Delta _{2}^{1}-{\rm CA}_{0}$, $\Sigma _{3}^{1}-{\rm IND}$ and $\Pi _{2}^{1}-{\rm TI}$ is provable in $\Delta _{1}^{1}-{\rm Det}_{0}={\rm ACA}_{0}+\Delta _{1}^{1}-{\rm Det}$.

Within a weak subsystem of second-order arithmetic , that is -conservative over , we reformulate Kreisel's proof of the Second Incompleteness Theorem and Boolos' proof of the First Incompleteness Theorem.