Short interspersed repetitive elements, or SINEs, are tRNA-derived retroposons that are dispersed throughout eukaryotic genomes and can be present in well over 104 total copies. The enormous volume of SINE amplifications per organism makes them important evolutionary agents for shaping the diversity of genomes, and the irreversible, independent nature of their insertion allows them to be used for diagnosing common ancestry among host taxa with extreme confidence. As such, they represent a powerful new tool for systematic biology that can be (...) strategically integrated with other conventional phylogenetic characters, most notably morphology and DNA sequences. This review covers the basic aspects of SINE evolution that are especially relevant to their use as systematic characters and describes the practical methods of characterizing SINEs for cladogram construction. It also discusses the limits of their systematic utility, clarifies some recently published misunderstandings, and illustrates the effective application of SINEs for vertebrate phylogenetics with results from selected case studies. BioEssays 22:148–160, 2000. ©2000 John Wiley & Sons, Inc. (shrink)

It is well known that the modal logic S5 can be embedded in the classical predicate logic by interpreting the modal operator in terms of a quantifier. Wajsberg [10] proved this fact in a syntactic way. Mints [7] extended this result to the quantified version of S5; using a purely proof-theoretic method he showed that the quantified S5 corresponds to the classical predicate logic with one-sorted variable. In this paper we extend Mints' result to the basic modal logic S4; we (...) investigate the correspondence between the quantified versions of S4 (with and without the Barcan formula) and the classical predicate logic (with one-sorted variable). We present a purely proof-theoretic proof-transformation method, reducing an LK-proof of an interpreted formula to a modal proof. (shrink)

It is well known that the modal logic S5 can be embedded in the classical predicate logic by interpreting the modal operator in terms of a quantifier. Wajsberg proved this fact in a syntactic way. Mints extended this result to the quantified version of S5; using a purely proof-theoretic method he showed that the quantified S5 corresponds to the classical predicate logic with one-sorted variable. In this paper we extend Mints’ result to the basic modal logic S4; we investigate the (...) correspondence between the quantified versions of S4 and the classical predicate logic. We present a purely proof-theoretic proof-transformation method, reducing an LK-proof of an interpreted formula to a modal proof. (shrink)

In this paper, we show the equivalence between the provability of a proof system of basic hybrid logic and that of translated formulas of the classical predicate logic with equality and explicit substitution by a purely proof–theoretic method. Then we show the equivalence of two groups of proof systems of hybrid logic: the group of labelled deduction systems and the group of modal logic-based systems.

「主体から主体を越えて主体の底」へ行こうとした西田哲学と共に、「悲哀の底」の「底なき底」においたとうとする論考。.

In the performing arts, such as music and dance performances, people actively interact with each other and show their exciting performances. Some studies have proposed that this interaction is a social origin of the performing arts. Some have further investigated this phenomenon based on the synchronization and coordination theory. Though the majority of these studies have focused on the collaborative context, several genres of the performing arts, such as jazz sessions and breakdance battles, have a competitive context. Several studies have (...) suggested that, in this competitive context, performers actively interact with each other and construct some correspondence. Moreover, a few recent studies focusing on competitive conversations, such as debates, have shown that, compared to people's interactions in collaborative conversations, people in competitive contexts frequently coordinate their behaviors in complicated ways. However, the interaction and coordination among performers in these competitive contexts have not been sufficiently investigated. Therefore, we investigated the coordination of expert breakdancers in battle scenes and measured their rhythmic movements using a motion capture system. We calculated the relative phase of the rhythmic movements between two dancers to investigate their coordination. The results showed that the dancers' rhythmic movements tended to synchronize in an anti-phase fashion, which means that there were similarities as well as differences between the two dancers' rhythmic movements. Furthermore, this pattern of coordination changed dynamically as time elapsed, from an in-phase synchronization or leader-follower relationships to an anti-phase synchronization and then leader-follower relationships. (shrink)

Proof-theory has traditionally been developed based on linguistic (symbolic) representations of logical proofs. Recently, however, logical reasoning based on diagrammatic or graphical representations has been investigated by logicians. Euler diagrams were introduced in the eighteenth century. But it is quite recent (more precisely, in the 1990s) that logicians started to study them from a formal logical viewpoint. We propose a novel approach to the formalization of Euler diagrammatic reasoning, in which diagrams are defined not in terms of regions as in (...) the standard approach, but in terms of topological relations between diagrammatic objects. We formalize the unification rule, which plays a central role in Euler diagrammatic reasoning, in a style of natural deduction. We prove the soundness and completeness theorems with respect to a formal set-theoretical semantics. We also investigate structure of diagrammatic proofs and prove a normal form theorem. (shrink)

Recently Lafont [6] showed the finite model property for the multiplicative additive fragment of linear logic (MALL) and for affine logic (LLW), i.e., linear logic with weakening. In this paper, we shall prove the finite model property for intuitionistic versions of those, i.e. intuitionistic MALL (which we call IMALL), and intuitionistic LLW (which we call ILLW). In addition, we shall show the finite model property for contractive linear logic (LLC), i.e., linear logic with contraction, and for its intuitionistic version (ILLC). (...) The finite model property for related substructural logics also follow by our method. In particular, we shall show that the property holds for all of FL and GL - -systems except FL c and GL - c of Ono [11], that will settle the open problems stated in Ono [12]. (shrink)

The paper traces the development and the role of syntactic reduction in Edmund Husserl’s early writings on mathematics and logic, especially on arithmetic. The notion has its origin in Hermann Hankel’s principle of permanence that Husserl set out to clarify. In Husserl’s early texts the emphasis of the reductions was meant to guarantee the consistency of the extended algorithm. Around the turn of the century Husserl uses the same idea in his conception of definiteness of what he calls “mathematical manifolds.” (...) The paper argues that the notion anticipates the notion of reduction in term rewrite theory in computer science. The role of the reduction for Husserl is, however, primarily epistemological: its purpose is to impart clarity to formal mathematics. (shrink)

Writing from a scientifically and philosophically informed perspective, the authors provide a critical overview of the conceptual difficulties encountered in many current neuroscientific and psychological theories.

The thesis according to which the meaning of a mathematical sentence is given by its proof was held by both Wittgenstein and the intuitionists, following Heyting and Dummett. In this paper, we clarify the meaning of this thesis for Wittgenstein, showing how his position differs from that of the intuitionists. We show how the thesis originates in his thoughts, from the middle period, about proofs by induction, and we sketch his answers to a number of objections, including the idea that, (...) given the particular meaning he gives to this thesis, he cannot account for mathematical conjectures. We conclude by showing how his views find a favourable echo today in the paradigm of “proposition-as-type” and extensions of the Curry-Howard isomorphism from which this paradigm originates. (shrink)

Recently Lafont [6] showed the finite model property for the multiplicative additive fragment of linear logic and for affine logic, i.e., linear logic with weakening. In this paper, we shall prove the finite model property for intuitionistic versions of those, i.e. intuitionistic MALL, and intuitionistic LLW. In addition, we shall show the finite model property for contractive linear logic, i.e., linear logic with contraction, and for its intuitionistic version. The finite model property for related substructural logics also follow by our (...) method. In particular, we shall show that the property holds for all of FL and GL$^-$-systems except FL$_c$ and GL$^-_c$ of Ono [11], that will settle the open problems stated in Ono [12]. (shrink)

We introduce a simple inference system based on two primitive relations between terms, namely, inclusion and exclusion relations. We present a normalization theorem, and then provide a characterization of the structure of normal proofs. Based on this, inferences in a syllogistic fragment of natural language are reconstructed within our system. We also show that our system can be embedded into a fragment of propositional minimal logic.

To investigate the cognitive processes underlying creative inspiration, we tested the extent to which viewing or copying prior examples impacted creative output in art. In Experiment 1, undergraduates made drawings under three conditions: copying an artist's drawing, then producing an original drawing; producing an original drawing without having seen another's work; and copying another artist's work, then reproducing that artist's style independently. We discovered that through copying unfamiliar abstract drawings, participants were able to produce creative drawings qualitatively different from the (...) model drawings. Process analyses suggested that participants' cognitive constraints became relaxed, and new perspectives were formed from copying another's artwork. Experiment 2 showed that exposure to styles of artwork considered unfamiliar facilitated creativity in drawing, while styles considered familiar did not do so. Experiment 3 showed that both copying and thoroughly viewing artwork executed using an unfamiliar style facilitated creativity in drawing, whereas merely thinking about alternative styles of artistic representation did not do so. These experiments revealed that deep encounters with unfamiliar artworks—whether through copying or prolonged observation—change people's cognitive representations of the act of drawing to produce novel artwork. (shrink)

A long-standing theme in discussion of perception and thought has been that our primary cognitive contact with individual objects and events in the world derives from our perceptual contact with them. When I look at a duck in front of me, I am not merely presented with the fact that there is at least one duck in the area, rather I seem to be presented withthisthing (as one might put it from my perspective) in front of me, which looks to (...) me to be a duck. Furthermore, such a perception would seem to put me in a position not merely to make the existential judgment that there is some duck or other present, but rather to make a singular, demonstrative judgment, that that is a duck. My grounds for an existential judgment in this case derives from my apprehension of the demonstrative thought and not vice versa. (shrink)

We shall give a direct proof of the independence result of a Buchholz style-Hydra Game on labeled finite trees. We shall show that Takeuti-Arai's cut-elimination procedure of $(\Pi^{1}_{1}-CA) + BI$ and of the iterated inductive definition systems can be directly expressed by the reduction rules of Buchholz's Hydra Game. As a direct corollary the independence result of the Hydra Game follows.

We first note that Gentzen's proof-reduction for his consistency proof of PA can be directly interpreted as moves of Kirby-Paris' Hydra Game, which implies a direct independence proof of the game . Buchholz's Hydra Game for labeled hydras is known to be much stronger than PA. However, we show that the one-dimensional version of Buchholz's Game can be exactly identified to Kirby-Paris' Game , by a simple and natural interpretation . Jervell proposed another type of a combinatorial game, by abstracting (...) Gentzen's proof-reductions and showed that his game is independent of PA. We show that this Jervell's game is actually much stronger than PA, by showing that the critical ordinal of Jervell's game is φω = ϵ0) in the Veblen hierarchy of ordinals. (shrink)