Listing 1 - 10 of 147 | << page >> |
Sort by
|
Choose an application
Choose an application
Choose an application
Rippling is a radically new technique for the automation of mathematical reasoning. It is widely applicable whenever a goal is to be proved from one or more syntactically similar givens. It was originally developed for inductive proofs, where the goal was the induction conclusion and the givens were the induction hypotheses. It has proved to be applicable to a much wider class of tasks, from summing series via analysis to general equational reasoning. The application to induction has especially important practical implications in the building of dependable IT systems, and provides solutions to issues such as the problem of combinatorial explosion. Rippling is the first of many new search control techniques based on formula annotation; some additional annotated reasoning techniques are also described here. This systematic and comprehensive introduction to rippling, and to the wider subject of automated inductive theorem proving, will be welcomed by researchers and graduate students alike.
Choose an application
Choose an application
Infinite --- Logic, Symbolic and mathematical --- Set theory
Choose an application
Mathematical logic --- Algebra, Abstract. --- Logic, Symbolic and mathematical.
Choose an application
Logic, Symbolic and mathematical --- Mathematics --- Semantics (Philosophy) --- Philosophy
Choose an application
Choose an application
This book gives an overview of paraconsistent logics – that is logics which allow for inconsistency. Although allowing for inconsistency, paraconsistent logics are worth considering : Logical systems are worth considering in their own right since we can learn about very abstract structural properties of logics and the concepts employed within them such as negation, necessity and consistency. Some non-classical logics are especially of interest from a philosophical perspective since they alone offer the possibility of solving or even stating some philosophical problems. These introductory lectures argue from a philosophical perspective that some paraconsistent logics are of interest or even the best candidates for dealing with specific philosophical problems. Although logic is seen from the point of view of its philosophical use, various formal systems are described, compared and employed.
Choose an application
Throughout the twentieth century, the classical logic of Frege and Russell dominated the field of formal logic. But, as Ross Brady argues, a new type of weak relevant logic may prove to be better equipped to present new solutions to persistent paradoxes. Universal Logic begins with an overview of classical and relevant logic and discusses the limitations of both in analyzing certain paradoxes. It is the first text to demonstrate how the main set-theoretic and semantic paradoxes can be solved in a systematic way and as such will be of great interest to both scholars and students of logic.
Logic, symbolic and mathematical --- Logic, Symbolic and mathematical. --- Logic, Symbolic and mathematical --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism
Listing 1 - 10 of 147 | << page >> |
Sort by
|