A standard correction for random guessing (cfg) formula on multiple-choice and Yes/Noexaminations was examined retrospectively in the scores of the intermediate female EFL learners in an English language school. The correctionwas a weighting formula for points awarded for correct answers,incorrect answers, and unanswered questions so that the expectedvalue of the increase in test score due to g...

BACKGROUND AND OBJECTIVE Although soy formula has been reported to support normal development, concerns exist regarding potential adverse developmental effects of phytochemicals associated with soy protein. This study characterized developmental status (mental, motor, and language) of breastfed (BF), milk-based formula-fed (MF), or soy protein-based formula-fed (SF) infants during the first yea...

In this paper, we attempt to capture the notion of usefulness in propositional language. We believe that classical implication captures a certain kind of usefulness, and name it strict usefulness. We say that a formula P is strictly useful to a formula Q under a formula set Γ if and only if P implies Q under Γ in classical propositional logic. We also believe that classical implication is too s...

We examine a bidirectional Propositional Dynamic Logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC−. By this kind of multimodal logic we can express properties both in the entire future and in the past of an event. Path expressions strengthen the classical until operator of temporal logic. For every formula defining an MSC language, we construct a communic...

This paper generalizes existing connections between automata and logic to a coalgebraic abstraction level. Let F : Set→ Set be a standard functor that preserves weak pullbacks. We introduce various notions of F-automata, devices that operate on pointed F-coalgebras. The criterion under which such an automaton accepts or rejects a pointed coalgebra is formulated in terms of an infinite two-playe...

Explosive increase in enduser computing on distributed systems requires that endusers develop application software by themselves. One solution is given as a formula of “a domain model ≡ a computation model.” This formula implies that one task in a domain model of cooperative work corresponds to one object in a computation model based on an object-oriented model. Application development environm...

This article revisits earlier proposals that language learning is, in essence, the learning of formulaic sequences and their interpretations; that this occurs at all levels of granularity from large to small; and that the language system emerges from the statistical abstraction of patterns latent within and across form and function in language usage. It considers recent research in individual d...