skip to content
Feasible mathematics II Preview this item
ClosePreview this item
Checking...

Feasible mathematics II

Author: Peter Clote; Jeffrey B Remmel
Publisher: Boston : Birkhäuser, 1995.
Series: Progress in computer science and applied logic, v. 13.
Edition/Format:   eBook : Document : Conference publication : EnglishView all editions and formats
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Conference papers and proceedings
Congresses
Additional Physical Format: Print version:
Feasible mathematics II.
Boston : Birkhäuser, 1995
(DLC) 94039297
(OCoLC)31436491
Material Type: Conference publication, Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Peter Clote; Jeffrey B Remmel
ISBN: 9781461225669 1461225663
OCLC Number: 853260861
Description: 1 online resource (viii, 447 pages) : illustrations.
Contents: 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.
Series Title: Progress in computer science and applied logic, v. 13.
Responsibility: Peter Clote, Jeffrey B. Remmel, editors.

Abstract:

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  Read more...

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/853260861> # Feasible mathematics II
    a schema:CreativeWork, schema:MediaObject, schema:Book ;
   library:oclcnum "853260861" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
   schema:about <http://dewey.info/class/511.3/e20/> ;
   schema:about <http://id.loc.gov/authorities/subjects/sh85082139> ; # Mathematics
   schema:about <http://experiment.worldcat.org/entity/work/data/352802092#Topic/computational_complexity> ; # Computational complexity
   schema:about <http://id.worldcat.org/fast/1012163> ; # Mathematics
   schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
   schema:bookFormat schema:EBook ;
   schema:datePublished "1995" ;
   schema:description "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."@en ;
   schema:description "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."@en ;
   schema:editor <http://viaf.org/viaf/24671463> ; # Peter Clote
   schema:editor <http://viaf.org/viaf/114319570> ; # Jeffrey B. Remmel
   schema:exampleOfWork <http://worldcat.org/entity/work/id/352802092> ;
   schema:genre "Conference publication"@en ;
   schema:genre "Conference papers and proceedings"@en ;
   schema:genre "Electronic books"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/352802092#Series/progress_in_computer_science_and_applied_logic> ; # Progress in computer science and applied logic ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/31436491> ;
   schema:name "Feasible mathematics II"@en ;
   schema:productID "853260861" ;
   schema:url <https://link.springer.com/openurl?genre=book&isbn=978-0-8176-3675-3> ;
   schema:url <http://dx.doi.org/10.1007/978-1-4612-2566-9> ;
   schema:url <https://0-link-springer-com.pugwash.lib.warwick.ac.uk/10.1007/978-1-4612-2566-9> ;
   schema:workExample <http://worldcat.org/isbn/9781461225669> ;
   schema:workExample <http://dx.doi.org/10.1007/978-1-4612-2566-9> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/853260861> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/352802092#Series/progress_in_computer_science_and_applied_logic> # Progress in computer science and applied logic ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/853260861> ; # Feasible mathematics II
   schema:name "Progress in computer science and applied logic ;" ;
    .

<http://id.loc.gov/authorities/subjects/sh85082139> # Mathematics
    a schema:Intangible ;
   schema:name "Mathematics"@en ;
    .

<http://id.worldcat.org/fast/1012163> # Mathematics
    a schema:Intangible ;
   schema:name "Mathematics"@en ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
   schema:name "Computational complexity"@en ;
    .

<http://viaf.org/viaf/114319570> # Jeffrey B. Remmel
    a schema:Person ;
   schema:birthDate "1948" ;
   schema:familyName "Remmel" ;
   schema:givenName "Jeffrey B." ;
   schema:name "Jeffrey B. Remmel" ;
    .

<http://viaf.org/viaf/24671463> # Peter Clote
    a schema:Person ;
   schema:familyName "Clote" ;
   schema:givenName "Peter" ;
   schema:name "Peter Clote" ;
    .

<http://worldcat.org/isbn/9781461225669>
    a schema:ProductModel ;
   schema:isbn "1461225663" ;
   schema:isbn "9781461225669" ;
    .

<http://www.worldcat.org/oclc/31436491>
    a schema:CreativeWork ;
   rdfs:label "Feasible mathematics II." ;
   schema:description "Print version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/853260861> ; # Feasible mathematics II
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.