Cantone omodeo (42 résultats)

Etat : New.

Hard cover. Etat : Very good. No jacket. In great condition. Binding is tight and inside is clean and unmarked.

Etat : good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New.

Paperback. Etat : New. Print on Demand. This book introduces a series of mathematical formulas and techniques for evaluating set theories. These theories, called syllogistic schemes, are applicable to any finite collection of set variables, and easily demonstrate the satisfiability, or truth, of each. It has been shown that any formula can be broken down as a disjunction of syllogistic formulas. The initial part of this book focuses on refining the algorithm outlined above, while the second half explores complexity issues related to classes of set-theoretic formulas. The author proves that if a set of syllogistic schemes is non-empty, then it contains at least one minimum effort scheme, and that in order to check for satisfiability, only such schemes need to be sought. This search, though it involves backtracking, can be piloted quite effectively. This book will be of interest to mathematicians, logicians, and computer scientists. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…

Etat : New. In English.

Etat : New.

Etat : New.

Etat : New. pp. 436.

Etat : As New. Unread book in perfect condition.

Etat : New. In English.

Hardcover. Etat : Brand New. 2011 edition. 433 pages. 9.25x6.25x1.25 inches. In Stock.

Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Hardback. Etat : New. 2011th. This must-read text presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz on computational logic and set theory and its application to proof verification techniques, culminating in the ÆtnaNova system, a prototype computer program designed to verify the correctness of mathematical proofs presented in the language of set theory. Topics and features: describes in depth how a specific first-order theory can be exploited to model and carry out reasoning in branches of computer science and mathematics; presents an unique system for automated proof verification in large-scale software systems; integrates important proof-engineering issues, reflecting the goals of large-scale verifiers; includes an appendix showing formalized proofs of ordinals, of various properties of the transitive closure operation, of finite and transfinite induction principles, and of Zorn's lemma.…

Paperback. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Etat : New. In English.

Etat : New. In English.

Etat : New.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New.

Hardback. Etat : New. 2011th. This must-read text presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz on computational logic and set theory and its application to proof verification techniques, culminating in the ÆtnaNova system, a prototype computer program designed to verify the correctness of mathematical proofs presented in the language of set theory. Topics and features: describes in depth how a specific first-order theory can be exploited to model and carry out reasoning in branches of computer science and mathematics; presents an unique system for automated proof verification in large-scale software systems; integrates important proof-engineering issues, reflecting the goals of large-scale verifiers; includes an appendix showing formalized proofs of ordinals, of various properties of the transitive closure operation, of finite and transfinite induction principles, and of Zorn's lemma.…

Etat : As New. Unread book in perfect condition.

Hardback. Etat : New. 2001 ed. An up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning.

Etat : New. pp. 428.

Paperback. Etat : Brand New. 428 pages. 9.21x5.98x0.94 inches. In Stock.

Hardback. Etat : New. 2001 ed. An up-to-date and comprehensive account of set-oriented symbolic manipulation and automated reasoning methods. This book will be of interest to graduates and researchers in theoretical computer science and computational logic and automated reasoning.

Hardcover Sehr gut erhalten.