This book presents a unifying framework for using priority arguments to prove theorems in computability.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Manuel Lerman is a Professor Emeritus of the Department of Mathematics at the University of Connecticut. He is the author of Degrees of Unsolvability: Local and Global Theory, has been the managing editor for the book series Perspectives in Mathematical Logic, has been an editor of Bulletin for Symbolic Logic, and is an editor of the ASL's Lecture Notes in Logic series.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: PsychoBabel & Skoob Books, Didcot, Vereinigtes Königreich
Hardcover. Zustand: Good. Zustand des Schutzumschlags: No Dust Jacket. Hardcover. No jacket. Lecture Notes in Logic, No. 34. Superficial marks on boards. Spine head is lightly bumped. Contents in excellent condition. BW. Used. Artikel-Nr. 287874
Anzahl: 1 verfügbar
Anbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA
Hardcover. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Artikel-Nr. G0521119693I3N00
Anzahl: 1 verfügbar
Anbieter: WYEMART LIMITED, HEREFORD, Vereinigtes Königreich
hardcover. Zustand: Very Good. Artikel-Nr. mon0000331906
Anzahl: 3 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. 176 pages. 9.00x6.00x0.75 inches. In Stock. Artikel-Nr. x-0521119693
Anzahl: 2 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book presents a unifying framework for using priority arguments to prove theorems in computability. Priority arguments provide the most powerful theorem-proving technique in the field, but most of the applications of this technique are ad hoc, masking the unifying principles used in the proofs. The proposed framework presented isolates many of these unifying combinatorial principles and uses them to give shorter and easier-to-follow proofs of computability-theoretic theorems. Standard theorems of priority levels 1, 2, and 3 are chosen to demonstrate the framework's use, with all proofs following the same pattern. The last section features a new example requiring priority at all finite levels. The book will serve as a resource and reference for researchers in logic and computability, helping them to prove theorems in a shorter and more transparent manner. Artikel-Nr. 9780521119696
Anzahl: 1 verfügbar