نتایج جستجو برای: Two variable
تعداد نتایج: 2624824 فیلتر نتایج به سال:
this thesis attempts to investigate the effects of prelistening activities on enhancing iranian efl learners` listening comprehension. the present study investigated ways in which learners` background knowledge could be activated in order to enhance their l2 listening comprehension by limiting the number of possible text interpretations prior to listening. the experiments conducted in this stud...
in fact this study is concerned with the relationship between the variation in thematice structure and the comprehension of spoken language. so the study focused on the following questions: 1. is there any relationship between thematic structure and the comprehension of spoken language? 2. which of the themes would have greated thematic force and be easier for the subjects to comprehend? accord...
The satisfiability and finite satisfiability problems for the two-variable fragment of firstorder logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.
The present paper gives a classification of the expressive power of two-variable least fixed-point logics. The main results are: 1. The two-variable fragment of monadic least fixed-point logic with parameters is as expressive as full monadic least fixed-point logic (on binary structures). 2. The two-variable fragment of monadic least fixed-point logic without parameters is as expressive as the ...
We show that the satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.
We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for ...
We show that the finite satisfiability problem for the guarded twovariable fragment with counting quantifiers is in EXPTIME. The method employed also yields a simple proof of the result obtained in Kazakov [6], that the satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME.
A logic function f has a disjoint bi-decomposition i f can be represented as f = h(g1(X1); g2(X2)), where X1 and X2 are disjoint set of variables, and h is an arbitrary two-variable logic fuction. f has a non-disjoint bidecomposition i f can be represented as f(X1;X2; x) = h(g1(X1; x); g2(X2; x)), where x is the common variable. In this paper, we show a fast method to nd bidecompositions. Also,...
in fact, this study focused on the following questions: 1. is there any difference between the effect of functional/notional approach and the structural approaches to language teaching on the proficiency test of efl learners? 2. can a rather innovative language test referred to as "functional test" ge devised so so to measure the proficiency test of efl learners, and thus be as much reliable an...
abstract this mixed method study examines whether there is any relationship among the variables of the study (job satisfaction, social capital and motivation). the researcher considered job satisfaction and social capital as independent variables; motivation is the dependent variable of the study. the researcher applied a questionnaire to assess each variable. to measure efl teachers’ job sati...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید