The relationship between auditory temporal processing,phonemic awareness,and reading disability

Recent research suggests an auditory temporal deficit as a possible contributing factor to poor phonemic awareness skills. This study investigated the relationship between auditory temporal processing of nonspeech sounds and phonological awareness ability in children with a reading disability, aged 8-12 years, using Tallal's tone-order judgement task. Normal performance on the tone-order task was established for 36 normal readers. Forty-two children with developmental reading disability were then subdivided by their performance on the tone-order task. Average and poor tone-order subgroups were then compared on their ability to process speech sounds and visual symbols, and on phonological awareness and reading. The presence of a tone-order deficit did not relate to performance on the order processing of speech sounds, to poorer phonological awareness or to more severe reading difficulties. In particular, there was no evidence of a group by interstimulus interval interaction, as previously described in the literature, and thus little support for a general auditory temporal processing difficulty as an underlying problem in poor readers. In this study, deficient order judgement on a nonverbal auditory temporal order task (tone task) did not underlie phonological awareness or reading difficulties.     

Polish Attempts to Modernize Thomism by Logic (Bocheński and Salamucha)

This paper reports some attempts undertaken in Poland in the 1930s to modernize Thomism by means of modern logic. In particular, it concerns J.M. Bocheski and J. Salamucha, the leading members of the CracowCircle. They attempted to give precise logical form to the Five Ways of Thomas Aquinas. Other works concerned the concept of transcendentals, the levels of abstraction, and the concept of essence.     

Inferential Intensionality

The paper is a study of properties of quasi-consequence operation which is a key notion of the so-called inferential approach in the theory of sentential calculi established in [5]. The principal motivation behind the quasi-consequence, q-consequence for short, stems from the mathematical practice which treats some auxiliary assumptions as mere hypotheses rather than axioms and their further occurrence in place of conclusions may be justified or not. The main semantic feature of the q-consequence reflecting the idea is that its rules lead from the non-rejected assumptions to the accepted conclusions.First, we focus on the syntactic features of the framework and present the q-consequence as related to the notion of proof. Such a presentation uncovers the reasons for which the adjective inferential is used to characterize the approach and, possibly, the term inference operation replaces q-consequence. It also shows that the inferential approach is a generalisation of the Tarski setting and, therefore, it may potentially absorb several concepts from the theory of sentential calculi, cf. [10]. However, as some concrete applications show, see e.g.[4], the new approach opens perspectives for further exploration.The main part of the paper is devoted to some notions absent, in Tarski approach. We show that for a given q-consequence operation W instead of one W-equivalence established by the properties of W we may consider two congruence relations. For one of them the current name is kept preserved and for the other the term W-equality is adopted. While the two relations coincide for any W which is a consequence operation, for an arbitrary W the inferential equality and the inferential equivalence may differ. Further to this we introduce the concepts of inferential extensionality and intensionality for q-consequence operations and connectives. Some general results obtained in Section 2 sufficiently confirm the importance of these notions. To complete a view, in Section 4 we apply the new intensionality-extensionality distinction to inferential extensions of a version of the ukasiewicz four valued modal logic.     

The Distance Function in Commutative ℓ-semigroups and the Equivalence in Łukasiewicz Logic

The equivalence connective in ukasiewicz logic has its algebraic counterpart which is the distance function d(x,y) =|x–y| of a positive cone of a commutative -group. We make some observations on logically motivated algebraic structures involving the distance function.     

The Acquisition of Temporal Reference Cross-Linguistically Using Two Acting-Out Comprehension Tasks

The acquisition of temporal event referencing, encoded by the temporal connectives: then, before, after, when, while, together, until, and since in English, Thai and Lisu was investigated using two acting-out comprehension tasks, a Marble task and a Toy task. Forty children aged 3.6-7.6 years from each language participated. The Marble and Toy tasks differed in their cognitive complexity: in the Marble task the child had to act out only one clause, whereas in the Toy task the child had to act out both clauses. This task manipulation affected performance in Lisu children only. Language-general effects were found, namely "then" and "together" were relatively early and "since" was relatively late in acquisition. Language-specific effects were found for Thai and Lisu. Results confirm that characteristics of task and test sentences affect children's comprehension of sentences expressing temporal relations and can partially account for the disparity in acquisition order found in previous studies.     

Fuzzy Logic and Arithmetical Hierarchy III

Fuzzy logic is understood as a logic with a comparative and truth-functional notion of truth. Arithmetical complexity of sets of tautologies (identically true sentences) and satisfiable sentences (sentences true in at least one interpretation) as well of sets of provable formulas of the most important systems of fuzzy predicate logic is determined or at least estimated.     

Finding Missing Proofs with Automated Reasoning

This article features long-sought proofs with intriguing properties (such as the absence of double negation and the avoidance of lemmas that appeared to be indispensable), and it features the automated methods for finding them. The theorems of concern are taken from various areas of logic that include two-valued sentential (or propositional) calculus and infinite-valued sentential calculus. Many of the proofs (in effect) answer questions that had remained open for decades, questions focusing on axiomatic proofs. The approaches we take are of added interest in that all rely heavily on the use of a single program that offers logical reasoning, William McCune's automated reasoning program OTTER. The nature of the successes and approaches suggests that this program offers researchers a valuable automated assistant. This article has three main components. First, in view of the interdisciplinary nature of the audience, we discuss the means for using the program in question (OTTER), which flags, parameters, and lists have which effects, and how the proofs it finds are easily read. Second, because of the variety of proofs that we have found and their significance, we discuss them in a manner that permits comparison with the literature. Among those proofs, we offer a proof shorter than that given by Meredith and Prior in their treatment of ukasiewicz's shortest single axiom for the implicational fragment of two-valued sentential calculus, and we offer a proof for the ukasiewicz 23-letter single axiom for the full calculus. Third, with the intent of producing a fruitful dialogue, we pose questions concerning the properties of proofs and, even more pressing, invite questions similar to those this article answers.     

On Neat Reducts of Algebras of Logic

SC , CA , QA and QEA stand for the classes of Pinter's substitution algebras, Tarski's cylindric algebras, Halmos' quasipolyadic algebras, and quasipolyadic equality algebras of dimension , respectively. Generalizing a result of Németi on cylindric algebras, we show that for K {SC, CA, QA, QEA} and ordinals < , the class Nr K of -dimensional neat reducts of -dimensional K algebras, though closed under taking homomorphic images and products, is not closed under forming subalgebras (i.e. is not a variety) if and only if > 1.From this it easily follows that for 1 < < , the operation of forming -neat reducts of algebras in K does not commute with forming subalgebras, a notion to be made precise.We give a contrasting result concerning Halmos' polyadic algebras (with and without equality). For such algebras, we show that the class of infinite dimensional neat reducts forms a variety.We comment on the status of the property of neat reducts commuting with forming subalgebras for various reducts of polyadic algebras that are also expansions of cylindric-like algebras. We try to draw a borderline between reducts that have this property and reducts that do not.Following research initiated by Pigozzi, we also emphasize the strong tie that links the (apparently non-related) property of neat reducts commuting with forming subalgebras with proving amalgamation results in cylindric-like algebras of relations. We show that, like amalgamation, neat reducts commuting with forming subalgebras is another algebraic expression of definability and, accordingly, is also strongly related to the well-known metalogical properties of Craig, Beth and Robinson in the corresponding logics.