نتایج جستجو برای: universal coefficient theorem

تعداد نتایج: 408820  

1998
Bahman Kalantari

A new formula for the approximation of root of polynomials with complex coefficients is presented. For each simple root there exists a neighborhood such that given any input within this neighborhood, the formula generates a convergent sequence, computed via elementary operations on the input and the corresponding derivative values. Each element of the sequence is defined in terms of the quotien...

Journal: :J. Symb. Log. 2014
Chad E. Brown Christine Rizkallah

Glivenko’s theorem states that an arbitrary propositional formula is classically provable if and only if its double negation is intuitionistically provable. The result does not extend to full first-order predicate logic, but does extend to first-order predicate logic without the universal quantifier. A recent paper by Zdanowski shows that Glivenko’s theorem also holds for secondorder propositio...

Journal: :Missouri Journal of Mathematical Sciences 2003

Journal: :Journal of Physics A: Mathematical and General 2002

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید