BERLEKAMP,E.(ED)
KEY PAPERS IN THE DEVELOPMENT OF CODING THEORY.
(ORIGINAL PUB. BY IEEE 1974)
This volume, originally published in 1974
by IEEE Press and
now distributed by A K Peters, Ltd., is a
collection of reprints
of original papers in coding theory covering
the first 25 years
of the field, with notes and comments inserted
by the editor, who
is one of the foremost contributors to the
subject. Studying the
original papers that shaped the subject provides
a thorough
introduction and will serve as stimulation
for further research.
1-56881-164-0 (A K PETERS ) 2002
WILF,H.
ALGORITHMS AND COMPLEXITY, 2ND ED.
This book is an introductory textbook on
the design and
analysis of algorithms. The author uses a
careful selection of a
few topics to illustrate the tools for algorithm
analysis.
Recursive algorithms are illustrated by Quicksort,
FFT, fast
matrix multiplications, and others. Algorithms
associated with
the network flow problem are fundamental
in many areas of graph
connectivity, matching theory, etc. Algorithms
in number theory
are discussed with some applications to public
key encryption.
From the table of contents: Mathematical
Preliminaries *Recursive
Algorithms *The Network Flow Problem *Algorithms
in the Theory of
Numbers *NP-Completeness
1-56881-178-0 (A K PETERS ) 2002
Bruce Berndt, et al., editors
Surveys in Number Theory:
Papers from the Millenial Conference on Number
Theory
A selection of the most accessible survey
papers from the
Millenial Conference on Number Theory. These
papers by a group of
international experts provide a current view
of the state of art
and an outlook into the future of number
theory research.
Year: 2002 ISBN: 1-56881-162-4
250 pages. Hardcover.
John H. Conway, Steve Sigur
The Triangle Book
With the advent of computer programs such
as SketchPad, many
high school students and amateur mathematicians
are rediscovering
interesting facts and theorems about triangles.
The authors have
created a nearly encyclopedoc collection
of known and not so
known aspects of the subject and present
them in a beautifully
illustrated triangular volume
Year: 2002 ISBN: 1-56881-1659
400 pages. Hardcover.
Israel Koren
Computer Arithmetic Algorithms 2nd edition
This text explains the fundamental principles
of algorithms
available for performing arithmetic operations
on digital
computers. These include basic arithmetic
operations like
addition, subtraction, multiplication, and
division in fixed-point
and floating-point number systems as well
as more complex
operations such as square root extraction
and evaluation of
exponential, logarithmic, and trigonometric
functions. The
algorithms described are independent of the
particular technology
employed for their implementation.
Year: 2001 ISBN: 1-56881-160-8
296 pages. Hardcover.
Arnold Miller
Descriptive Set Theory and Forcing, revised
second printing
Lecture Notes in Logic 4
This book is based on a graduate course given
by the author at
the University of Wisconsin. It presents
an exposition of basic
material from descriptive set theory (the
general theory of Borel
sets and projective sets), leading up to
a new proof of Louveau s
separation theorem for analytic sets. It
assumes some background
in mathematical logic and set theory, and
will be of interest to
reseachers and advanced students in these
areas as well as in
mathematical analysis.
Year: 2002 ISBN: 1-56881-176-4
130 pages. Paperback.
Per Lindstrom
Aspects of Incompleteness
Lecture Notes in Logic 10
This thoroughly revised second edition of
a classic book on the main ideas and results
of general meta-mathematics contains new
results and simplified proofs, as well as
an up to date bibliography. In addition to
the standard results of Godel and others
on incompleteness, (non) finite axiomatizability,
interpretability, etc.., it contains a thorough
treatment of partial conservativity and degrees
of interpretability. The reader should be
familiar with the widely used method of arithmetization
and with the elements of recursion theory.
Year: 2002 ISBN: 1-56881-173-X
170 pages. Paperback.
Torkel Franzen
Inexhaustibility: A Non-Exhaustive Treatment
Lecture Notes in Logic 16
Godels Incompleness Theorems are among the
most significant results in the foundation
of mathematics. These results have a positive
consequence: any system of axioms for mathematics
that we recognize as correct can be properly
extended by adding as a new axiom a formal
statement expressing that the original system
is consistent. This suggests that our mathematical
knowledge is inexhaustible, an essentially
philosophical topic to which this book is
devoted. Basic material in predicate logic,
set theory and recursion theory is presented,
leading to a proof of incompleteness theorems.
The inexhaustibility of mathematical knowledge
is treated based on the concept of transfinite
progressions of theories as conceived by
Turing and Feferman. All concepts and results
necessary to understand the arguments are
introduced as needed, making the presentation
self-contained and thorough.
Year: 2002 ISBN: 1-56881-174-8 Hardcover
300 pages. ISBN: 1-56881-175-6 Paperback