Gernot salzer (8 Ergebnisse)

Zustand: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Zustand: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Paperback. Zustand: New. An Unused, unmarked and unblemished copy. Still in plastic packaging!; 100% Satisfaction Guaranteed! Ships same or next business day.

23,5 x 15,5 cm. Zustand: Gut. 1. Auflage. VIII, 297 Seiten Selected Papers. - Innen sauberer, guter Zustand. Softcover, Broschur mit den üblichen Bibliotheks-Markierungen, Stempeln und Einträgen, innen wie außen, siehe Bilder. Untere Ecke leicht geknickt. - Lecture Notes in Artificial Intelligence 1761. Subseries of Lectur Notes in Computer Science. DE-10-53 Sprache: Englisch Gewicht in Gramm: 420.…

Paperback. Zustand: Brand New. 1st edition. 297 pages. 9.25x6.00x0.75 inches. In Stock.

Kartoniert / Broschiert. Zustand: New.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Papers.- Automated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory.- Higher-Order Modal Logic-A Sketch.- Proving Associative-Commutative Termination Using RPO-Compatible Orderings.- Decision Procedures and Model Building or How to Improve Logical Information in Automated Deduction.- Replacement Rules with Definition Detection.- Contributed Papers.- On the Complexity of Finite Sorted Algebras.- A Further and Effective Liberalization of the -Rule in Free Variable Semantic Tableaux.- A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory.- Interpretation of a Mizar-Like Logic in First Order Logic.- An ((n log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic.- Implicational Completeness of Signed Resolution.- An Equational Re-engineering of Set Theories.- Issues of Decidability for Description Logics in the Framework of Resolution.- Extending DecidableClause Classes via Constraints.- Completeness and Redundancy in Constrained Clause Logic.- Effective Properties of Some First Order Intuitionistic Modal Logics.- Hidden Congruent Deduction.- Resolution-Based Theorem Proving for SH n-Logics.- Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized -Rule but Without Skolemization.…

Zustand: gut. 2000. Automated deduction in classical and non-classical logic In deutscher Sprache. pages.