G hasenjaeger (40 risultati)

Condizione: 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.…

Condizione: Good. 180 pp., hardcover, ex library, else text clean and binding tight (lacks dust jacket). - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.…

Hardcover. Condizione: Very Good. Condizione sovraccoperta: Very Good. Binding tight and square, Pages are clean and unmarked.

1st edition. Near fine cloth copy in a near-fine, very slightly edge-nicked and dust-dulled dust-wrapper, now mylar-sleeved. Remains particularly well-preserved overall; tight, bright, clean and strong. Physical description; 180 pp., 23 cm. Subjects; Logic, Symbolic and mathematical. Probabilities. Symbolic and mathematical. 1 Kg. …

Paperback. Condizione: Good. Sorry, No international shipping on this item.Ex-Library paperback with the usual markings, attachments, and library wear. Pages tanned from age. Except for library markings, interior clean and unmarked. Tight binding.

1st edition. Near fine cloth copy in a near-fine, very slightly edge-nicked and dust-dulled dust-wrapper, now mylar-sleeved. Remains particularly well-preserved overall; tight, bright, clean and strong. Physical description; 180 pp., 23 cm. Subjects; Logic, Symbolic and mathematical. Probabilities. Symbolic and mathematical. 1 Kg. …

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Paperback or Softback. Condizione: New. Introduction to the Basic Concepts and Problems of Modern Logic. Book.

PF. Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New. In English.

Condizione: As New. Unread book in perfect condition.

Blanda. Condizione: Buen estado. Condizione sovraccoperta: Buen estado.

23 cm. original cloth. 180 pp. bibliography. index. -(owner\'s name, otherwise (very) good). 410g.

Condizione: New.

Condizione: New. In English.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - P-mitotic sets.- Equivalence relations, invariants, and normal forms, II.- Recurrence relations for the number of labeled structures on a finite set.- Recursively enumerable extensions of R1 by finite functions.- On the complement of one complexity class in another.- The length-problem.- On r.e. inseparability of CPO index sets.- Arithmetical degrees of index sets for complexity classes.- Rudimentary relations and Turing machines with linear alternation.- A critical-pair/completion algorithm for finitely generated ideals in rings.- Extensible algorithms.- Some reordering properties for inequality proof trees.- Modular decomposition of automata.- Modular machines, undecidability and incompleteness.- Universal Turing machines (UTM) and Jones-Matiyasevich-masking.- Complexity of loop-problems in normed networks.- On the solvability of the extended - Ackermann class with identity.- Reductions for the satisfiability with a simple interpretation of the predicate variable.- The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems).- Implicit definability of finite binary trees by sets of equations.- Spektralproblem and completeness of logical decision problems.- Reduction to NP-complete problems by interpretations.- Universal quantifiers and time complexity of random access machines.- Second order spectra.- On the argument complexity of multiply transitive Boolean functions.- The VLSI complexity of Boolean functions.- Fast parallel algorithms for finding all prime implicants for discrete functions.- Bounds for Hodes - Specker theorem.- Proving lower bounds on the monotone complexity of Boolean functions.…

Blanda. Condizione: Buen estado. Condizione sovraccoperta: Buen estado.

Condizione: New. pp. 186.

Paperback. Condizione: Brand New. 1972 edition. 184 pages. 9.25x6.10x0.42 inches. In Stock.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - The field of modern logic is too extensive to be worked through by open cast mining. To open it up, we need to sink shafts and construct adits. This is the method of most text books: a systematic exposition of a number of main topics, supplemented by exercises to teach skill in the appurtenant techniques, lays a secure foundation for subsequent dis cussion of selected questions. Compared with this, the present treatment is more like a network of exploratory drillings to show that it would be worthwhile to start mining operations, or to work the existing shafts and adits, as the case may be. Within this metaphor we may also describe the inherent weakness of this conception: once a cavity is pierced, the duct's capacity will in general not be sufficient to carry away the discovered riches. But whether we are concerned with a new or an already worked mine - at any rate, the experience should stimulate us into either reviving an existing system of shafts or even, in particularly fortunate cases, designing a new ap proach.…

Condizione: New.

VI,456 S. Orig.-Karton. Erste Ausgabe.- (= Lecture notes in computer science , 171).- Gutes Exemplar.

Paperback. Condizione: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: As New. Unread book in perfect condition.

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

Condizione: As New. Unread book in perfect condition.

Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 472 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.