Read While You Wait - Get immediate ebook access, if available*, when you order a print book

Progress in Computer Science and Applied Logic

Feasible Mathematics II

Editors: Clote, Peter, Remmel, Jeffrey B. (Eds.)

Free Preview

Buy this book

eBook $59.99
price for USA in USD (gross)
  • ISBN 978-1-4612-2566-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $99.00
price for USA in USD
  • ISBN 978-0-8176-3675-3
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • This title is currently reprinting. You can pre-order your copy now.
Softcover $79.99
price for USA in USD
  • ISBN 978-1-4612-7582-4
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
About this book

Perspicuity is part of proof. If the process by means of which I get a result were not surveyable, I might indeed make a note that this number is what comes out - but what fact is this supposed to confirm for me? I don't know 'what is supposed to come out' . . . . 1 -L. Wittgenstein A feasible computation uses small resources on an abstract computa­ tion device, such as a 'lUring machine or boolean circuit. Feasible math­ ematics concerns the study of feasible computations, using combinatorics and logic, as well as the study of feasibly presented mathematical structures such as groups, algebras, and so on. This volume contains contributions to feasible mathematics in three areas: computational complexity theory, proof theory and algebra, with substantial overlap between different fields. In computational complexity theory, the polynomial time hierarchy is characterized without the introduction of runtime bounds by the closure of certain initial functions under safe composition, predicative recursion on notation, and unbounded minimization (S. Bellantoni); an alternative way of looking at NP problems is introduced which focuses on which pa­ rameters of the problem are the cause of its computational complexity and completeness, density and separation/collapse results are given for a struc­ ture theory for parametrized problems (R. Downey and M. Fellows); new characterizations of PTIME and LINEAR SPACE are given using predicative recurrence over all finite tiers of certain stratified free algebras (D.

Table of contents (15 chapters)

Table of contents (15 chapters)

Buy this book

eBook $59.99
price for USA in USD (gross)
  • ISBN 978-1-4612-2566-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $99.00
price for USA in USD
  • ISBN 978-0-8176-3675-3
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • This title is currently reprinting. You can pre-order your copy now.
Softcover $79.99
price for USA in USD
  • ISBN 978-1-4612-7582-4
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
Loading...

Services for this Book

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Feasible Mathematics II
Editors
  • Peter Clote
  • Jeffrey B. Remmel
Series Title
Progress in Computer Science and Applied Logic
Series Volume
13
Copyright
1995
Publisher
Birkhäuser Basel
Copyright Holder
Birkhäuser Boston
eBook ISBN
978-1-4612-2566-9
DOI
10.1007/978-1-4612-2566-9
Hardcover ISBN
978-0-8176-3675-3
Softcover ISBN
978-1-4612-7582-4
Series ISSN
2297-0576
Edition Number
1
Number of Pages
447
Topics

*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works are not included.