نتایج جستجو برای: order boundaryvalue problem
تعداد نتایج: 1660723 فیلتر نتایج به سال:
The order of problems presented to students is an important variable that affects learning effectiveness. Previous studies have shown that solving problems in a blocked order, in which all problems of one type are completed before the student is switched to the next problem type, results in less effective performance than does solving the problems in an interleaved order. While results are star...
We stratify intuitionistic first-order logic over (∀,→) into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these fragments. We prove that even the ∆2 level is undecidable and that Σ1 is Expspace-complete. We also prove that the arity-bounded fragment of Σ1 is complete for co-Nexptime.
1. The Classical Decision Problem by Egon Börger, Erich Grädel and Yuri Gurevich. Reviewed by Dan A. Simovici. This book discusses decidable and undecidable fragments of first-order logic. This book unifies and simplifies many of the previous proofs in the literature. The proofs of decidability are particularly interesting since the original proofs of these results were difficult but have been ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید