Surprise Castle
Computation Theory and Logic

Computation Theory and Logic - Paperback

$54.99
Quantity
01

Pay over time for orders over $35.00 with

Offers & Perks

Earn 54 points with this purchase

Added to your rewards balance after checkout.

100 points welcome bonus

Create an account and start with extra points.

Join now
Availability:In StockSeries:Lecture Notes in Computer SciencePublish date:7/29/1987Pages:442
Languages:EnglishPublisher:SpringerISBN-13:9783540181705ISBN-10:3540181709UPC:9783540181705Book Category:ComputersBook Subcategory:Machine Theory, Computer ScienceSize:9.21 x 6.14 x 0.93 inchesWeight:0.64Product ID:SCHAHA8SKR
This volume contains 37 invited research papers collected in memory of Dieter Rödding, who is known for his work on the classification of recursive functions, on reduction classes, on the spectrum problem and on the complexity of cardinality quantifiers in predicate logic and in arithmetical hierarchy. He was one of the first to pursue the interaction of logic and computer science. The volume reflects the wide spectrum of Dieter Rödding's scientific interests.
Languages:EnglishPublisher:SpringerISBN-13:9783540181705ISBN-10:3540181709UPC:9783540181705Book Category:ComputersBook Subcategory:Machine Theory, Computer ScienceSize:9.21 x 6.14 x 0.93 inchesWeight:0.64Product ID:SCHAHA8SKR
Publisher: Springer

Edition

1987 Edition

Free shipping on orders over $75. Standard shipping takes 3-7 business days. Returns accepted within 30 days of purchase.