نتایج جستجو برای: deduction
تعداد نتایج: 6306 فیلتر نتایج به سال:
2009
Gilles Dowek
Deduction modulo is an extension of first-order predicate logic where axioms are replaced by rewrite rules. For instance, the axiom P ⇔ (Q ⇒ R) is replaced by the rule P −→ (Q ⇒ R). These rules define an equivalence relation and, in a proof, a proposition can be replaced by an equivalent one at any time. A presentation of Simple Type Theory in Deduction modulo, calledHOL, has been given in [3]....
Journal:
:Indonesian Journal of Electrical Engineering and Computer Science
2018
Journal:
:Kritike: An Online Journal of Philosophy
2009
Journal:
:Proceedings of the Edinburgh Mathematical Society
1891
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید