21,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
11 °P sammeln
Andere Kunden interessierten sich auch für
![On Kolmogorov's Superposition Theorem and its Applications]( "On Kolmogorov's Superposition Theorem and its Applications")
On Kolmogorov's Superposition Theorem and its Applications56,99 €![Musielak-Orlicz spaces of vector sequences and superposition operator]( "Musielak-Orlicz spaces of vector sequences and superposition operator")
Musielak-Orlicz spaces of vector sequences and superposition operator35,99 €![Order of Integration (Calculus)]( "Order of Integration (Calculus)")
Order of Integration (Calculus)24,99 €![Rod Calculus]( "Rod Calculus")
Rod Calculus35,99 €![Vector Calculus]( "Vector Calculus")
Vector Calculus32,99 €![Fitch- Style Calculus]( "Fitch- Style Calculus")
Fitch- Style Calculus24,99 €![Sequent Calculus]( "Sequent Calculus")
Sequent Calculus28,99 €
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The superposition calculus is a calculus for reasoning in equational first-order logic. It has been developed in the early 1990s and combines concepts from first-order resolution with ordering-based equality handling as developed in the context of (unfailing) Knuth-Bendix completion. It can be seen as a generalization of either resolution (to equational logic) or unfailing completion (to full clausal logic). As most first-order calculi, superposition tries to show the unsatisfiability of a set of first-order clauses, i.e. it performs proofs by refutation. Superposition is refutation-complete given unlimited resources and a fair derivation strategy, every unsatisfiable clause set can eventually be proved to be unsatisfiable.