Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
Feasible Mathematics II
.
Bookmark this Record
Catalogue Record 48273
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 48273
.
Reviews
Catalogue Record 48273
.
British Library
Resolver for RSN-48273
Google Scholar
Resolver for RSN-48273
WorldCat
Resolver for RSN-48273
Catalogo Nazionale SBN
Resolver for RSN-48273
GoogleBooks
Resolver for RSN-48273
ICTP Library
Resolver for RSN-48273
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
004.0151
Title
Feasible Mathematics II ([EBook] /) / edited by Peter Clote, Jeffrey B. Remmel.
Added Personal Name
Clote, Peter
editor.
Remmel, Jeffrey B.
editor.
Other name(s)
SpringerLink (Online service)
Publication
Boston, MA : : Birkhäuser Boston, , 1995.
Physical Details
447 p. : online resource.
Series
Progress in computer science and applied logic
; 13
ISBN
9781461225669
Summary Note
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.:
Contents note
Preface -- On the Existence of modulo p Cardinality Functions -- Predicative Recursion and The Polytime Hierarchy -- Are there Hard Examples for Frege Systems? -- On Godel’s Theorems on Lengths of Proofs II: Lower Bounds for Recognizing k Symbol Provability -- Feasibly Categorical Abelian Groups -- First Order Bounded Arithmetic and Small Boolean Circuit Complexity Classes -- Parameterized Computational Feasibility -- On Proving Lower Bounds for Circuit Size -- Effective Properties of Finitely Generated R.E. Algebras -- On Frege and Extended Frege Proof Systems -- Ramified Recurrence and Computational Complexity I: Word Recurrence and Poly-time -- Bounded Arithmetic and Lower Bounds in Boolean Complexity -- Ordinal Bounds for Programs -- Turing Machine Characterizations of Feasible Functionals of All Finite Types -- The Complexity of Feasible Interpretability.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/978-1-4612-2566-9
Links to Related Works
Subject References:
Computer Science
.
Computers
.
Science
.
Science, general
.
Theory of Computation
.
Authors:
Clote, Peter
.
Remmel, Jeffrey B.
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Progress in computer science and applied logic
.
Classification:
004.0151
.
.
ISBD Display
Catalogue Record 48273
.
Tag Display
Catalogue Record 48273
.
Related Works
Catalogue Record 48273
.
Marc XML
Catalogue Record 48273
.
Add Title to Basket
Catalogue Record 48273
.
Catalogue Information 48273
Beginning of record
.
Catalogue Information 48273
Top of page
.
Download Title
Catalogue Record 48273
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
48273
1
48273
-
2
48273
-
3
48273
-
4
48273
-
5
48273
-
Quick Search
Search for