While the quality of the results of T E X's mathematical formula layout algorithm is convincing, its original description is hard to understand since it is presented as an imperative program with complex control ow and destructive manipulations of the data structures representing formulae. In this paper, we present a re-implementation of T E X's formula layout algorithm in the functional langua...

it is well documented that language learning success or failure is influenced by the affective side of the learner. self-efficacy and anxiety are among the affective factors influencing language learning. this study first explores the relationship between efl learners' self-efficacy in reading comprehension and their reading anxiety. secondly, it explores the relationship between efl learners' ...

A semantics may be compositional and yet partial, in the sense that not all well-formed expressions are assigned meanings by it. Examples come from both natural and formal languages. When can such a semantics be extended to a total one, preserving compositionality? This sort of extension problem was formulated in Hodges [9], and solved there in a particular case, in which the total extension re...

Using a new regulator, we examine ’t Hooft’s approach for evaluating black hole entropy through a statistical-mechanical counting of states for a scalar field propagating outside the event horizon. We find that this calculation yields precisely the one-loop renormalization of the standard BekensteinHawking formula, S = A/(4G). Thus our result provides evidence confirming a suggestion by Susskin...

Formats for describing timing behaviors range from fixed menus of standard patterns, to fully open-ended behavioral definitions; of which some may be supported by formal semantic underpinnings, while others are better characterized as primarily informal notations. Timing descriptions that allow flexible extension within a fully formalized framework constitute a particularly interesting area in ...

In this paper we give a two sort bounded arithmetic whose provably total functions coincide with the class FP . Our first aim is to show that the theory proves Toda’s theorem in the sense that any formula in Σ∞ is provably equivalent to a Σ B 0 formula in the language of FP . We also argue about some problems concerning logical theories for counting classes.

One of the important abilities of learners is to monitor their own learning process and take charge of their development. To this end and based on the correlational nature of the study design, total of 125 students (for the Winter semester of 2017) educating at Zanjan Universities (89 B.A. students of Islamic Azad University and 60 B.A. students of Payam-e-Noor University) were chosen as the st...

In the paper a first order language is constructed. It includes the universal quantifier and the following propositional connectives: truth, negation, and conjunction. The variables are divided into three kinds: bound variables, fixed variables, and free variables. An infinite number of predicates for each arity is provided. Schemes of structural induction and schemes justifying definitions by ...

scan is an algorithm for reducing existential second-order logic formulae to equivalent simpler formulae, often first-order logic formulae. It is provably impossible for such a reduction to first-order logic to be successful for every second-order logic formula which has an equivalent first-order formula. In this paper we show that scan successfully computes the first-order equivalents of all S...