Order Total (1 Item Items):
Shipping Destination:
Remmel Jeffrey (58 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (58)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (47)
- As New, Fine or Near Fine (5)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (6)
Binding
Collectible Attributes
- First Edition (1)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (17)
- Not Print on Demand (37)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Feasible Mathematics II (Progress in Computer Science and Applied Logic)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 50.80
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Condition: Used. pp. 447 1st Edition, Reprint.
-
Condition: Used. pp. 447.
-
Condition: Used. pp. 447.
-
Feasible Mathematics II
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. 2011. Paperback. . . . . .
-
Condition: New. pp. 460.
-
Condition: New. 2011. Paperback. . . . . . Books ship from the US and Ireland.
-
Counting with Symmetric Functions (Developments in Mathematics, 43)
Book 41 of 70: Developments in MathematicsSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 86.64
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Counting with Symmetric Functions (Developments in Mathematics, 43)
Book 41 of 70: Developments in MathematicsSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 86.64
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Paperback. Condition: New.
-
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
Paperback. Condition: Like New. Like New. book.
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Condition: New. pp. 304 Softcover reprint of the original 1st ed. 2015 edition NO-PA16APR2015-KAP.
-
-
Paperback. Condition: Brand New. reprint edition. 304 pages. 9.25x6.10x0.69 inches. In Stock.
-
Hardcover. Condition: Brand New. 304 pages. French language. 9.25x6.25x0.75 inches. In Stock.
-
Counting with Symmetric Functions
Book 41 of 70: Developments in MathematicsLanguage: English
Published by Springer International Publishing, Springer International Publishing, 2019
ISBN 10: 3319795104 ISBN 13: 9783319795102
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This monograph provides a self-contained introduction to symmetric functions and their use in enumerative combinatorics. It is the first book to explore many of the methods and results that the authors present. Numerous exercises are included throughout, along with full solutions, to illustrate concepts and also highlight many interesting mathematical ideas.The text begins by introducing fundamental combinatorial objects such as permutations and integer partitions, as well as generating functions. Symmetric functions are considered in the next chapter, with a unique emphasis on the combinatorics of the transition matrices between bases of symmetric functions. Chapter 3 uses this introductory material to describe how to find an assortment of generating functions for permutation statistics, and then these techniques are extended to find generating functions for a variety of objects in Chapter 4. The next two chapters present the Robinson-Schensted-Knuthalgorithm and a method for proving Pólya's enumeration theorem using symmetric functions. Chapters 7 and 8 are more specialized than the preceding ones, covering consecutive pattern matches in permutations, words, cycles, and alternating permutations and introducing the reciprocity method as a way to define ring homomorphisms with desirable properties.Counting with Symmetric Functions will appeal to graduate students and researchers in mathematics or related subjects who are interested in counting methods, generating functions, or symmetric functions. The unique approach taken and results and exercises explored by the authors make it an important contribution to the mathematical literature.
-
Logical Methods: In Honor of Anil Nerode's Sixtieth Birthday (Progress in Computer Science and Applied Logic, 12)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 137.84
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Condition: Used. pp. 836.
-
Condition: Used. pp. 836 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
-
Condition: Used. pp. 836.
-
Taschenbuch. Condition: Neu. Logical Methods | In Honor of Anil Nerode's Sixtieth Birthday | John N. Crossley (u. a.) | Taschenbuch | Progress in Computer Science and Applied Logic | 2 Taschenbücher | Englisch | 2013 | Birkhäuser | EAN 9781461267089 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Logical Methods
Language: English
Published by Birkhauser Boston Inc, 1994
ISBN 10: 0817636900 ISBN 13: 9780817636906
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. Anil Nerode, Director of the Mathematics Institute at Cornell, USA, is one of the most influential logicians in the world. This volume, published in his honour, contains much new and significant work. The papers in general arose from a symposium held in his honour at Cornell University. Editor(s): Crossley, John N.; Remmel, Jeffrey B.; Shore, Richard A.; Sweedler, Moss E. Series: Progress in Computer Science and Applied Logic. Num Pages: 816 pages, biography. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 44. Weight in Grams: 1598. . 1994. Hardback. . . . .
-
Condition: New. pp. xxiv + 32.
-
Condition: Sehr gut. Zustand: Sehr gut | Seiten: 856 | Sprache: Englisch | Produktart: Bücher | The twenty-six papers in this volume reflect the wide and still expanding range of Anil Nerode's work. A conference on Logical Methods was held in honor of Nerode's sixtieth birthday (4 June 1992) at the Mathematical Sciences Institute, Cornell University, 1-3 June 1992. Some of the conference papers are here, but others are from students, co-workers and other colleagues. The intention of the conference was to look forward, and to see the directions currently being pursued, in the development of work by, or with, Nerode. Here is a brief summary of the contents of this book. We give a retrospective view of Nerode's work. A number of specific areas are readily discerned: recursive equivalence types, recursive algebra and model theory, the theory of Turing degrees and r.e. sets, polynomial-time computability and computer science. Nerode began with automata theory and has also taken a keen interest in the history of mathematics. All these areas are represented. The one area missing is Nerode's applied mathematical work relating to the environment. Kozen's paper builds on Nerode's early work on automata. Recursive equivalence types are covered by Dekker and Barback, the latter using directly a fundamental metatheorem of Nerode. Recursive algebra is treated by Ge & Richards (group representations). Recursive model theory is the subject of papers by Hird, Moses, and Khoussainov & Dadajanov, while a combinatorial problem in recursive model theory is discussed in Cherlin & Martin's paper. Cenzer presents a paper on recursive dynamics.
