Search Results

ENGLISH

Temporal Type Theory - A Topos-Theoretic Approach To Systems And Behavior

by David I. Spivak e Patrick Schultz

145,09€ + 10% CARD

 This innovative monograph explores a new mathematical formalism in higher-order temporal logic for proving properties about the behavior of systems.
ENGLISH

Communism And Nationalism In Postwar Cyprus, 1945-1955 - Politics And Ideologies Under British Rule

by Alexios Alecou

60,82€ + 10% CARD

free shipping

 This book analyzes the eventsthat impacted the structure and competitive processes of the two dominantCypriot political factions while under the watchful eye of British rule.
ENGLISH

Advances In Proof Theory

89,21€ + 10% CARD

free shipping

 The aim of this volume is to collect original contributions by the best specialists from the area of proof theory, constructivity, and computation and discuss recent trends and results in these areas.
ENGLISH

Mathematical Logic - Foundations For Information Science

by Wei Li

59,61€ + 10% CARD

 Mathematical logic is a branch of mathematics that takes axiom systems and mathematical proofs as its objects of study. This book shows how it can also provide a foundation for the development of information science and technology. The first five chapters systematically present the core topics of classical mathematical logic, including the syntax and models of first-order languages, formal inference systems, computability and representability, and Gödel’s theorems. The last five chapters present extensions and developments of classical mathematical logic, particularly the concepts of version sequences of formal theories and their limits, the system of revision calculus, proschemes (formal descriptions of proof methods and strategies) and their properties, and the theory of inductive inference. All of these themes contribute to a formal theory of axiomatization and its application to the process of developing information technology and scientific theories. The book also describes the paradigm of three kinds of language environments for theories and it presents the basic properties required of a meta-language environment. Finally, the book brings these themes together by describing a workflow for scientific research in the information era in which formal methods, interactive software and human invention are all used to their advantage.The second edition of the book includes major revisions on the proof of the completeness theorem of the Gentzen system and new contents on the logic of scientific discovery, R-calculus without cut, and the operational semantics of program debugging.This book represents a valuable reference for graduate and undergraduate students and researchers in mathematics, information science and technology, and other relevant areas of natural sciences. Its first five chapters serve as an undergraduate text in mathematical logic and the last five chapters are addressed to graduate students inrelevant disciplines.
ENGLISH

Coding, Cryptography And Combinatorics

118,59€ + 10% CARD

 It has long been recognized that there are fascinating connections between cod ing theory, cryptology, and combinatorics. Therefore it seemed desirable to us to organize a conference that brings together experts from these three areas for a fruitful exchange of ideas. We decided on a venue in the Huang Shan (Yellow Mountain) region, one of the most scenic areas of China, so as to provide the additional inducement of an attractive location. The conference was planned for June 2003 with the official title Workshop on Coding, Cryptography and Combi natorics (CCC 2003). Those who are familiar with events in East Asia in the first half of 2003 can guess what happened in the end, namely the conference had to be cancelled in the interest of the health of the participants. The SARS epidemic posed too serious a threat. At the time of the cancellation, the organization of the conference was at an advanced stage: all invited speakers had been selected and all abstracts of contributed talks had been screened by the program committee. Thus, it was de cided to call on all invited speakers and presenters of accepted contributed talks to submit their manuscripts for publication in the present volume. Altogether, 39 submissions were received and subjected to another round of refereeing. After care ful scrutiny, 28 papers were accepted for publication.
ENGLISH

Cryptographic Applications Of Analytic Number Theory - Complexity Lower Bounds And Pseudorandomness

by Igor Shparlinski

118,59€ + 10% CARD

 The book introduces new techniques that imply rigorous lower bounds on the com plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num bers of solutions of some polynomial equations over finite fields and residue rings. Other number theoretic techniques such as sieve methods and lattice reduction algorithms are used as well. The book also contains a number of open problems and proposals for further research. The emphasis is on obtaining unconditional rigorously proved statements. The bright side of this approach is that the results do not depend on any assumptions or conjectures. On the downside, the results are much weaker than those which are widely believed to be true. We obtain several lower bounds, exponential in terms of logp, on the degrees and orders of o polynomials; o algebraic functions; o Boolean functions; o linear recurrence sequences; coinciding with values of the discrete logarithm modulo a prime p at sufficiently many points (the number of points can be as small as pI/2+O:). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the rightmost bit of the discrete logarithm and defines whether the argument is a quadratic residue.
ENGLISH

Cryptography And Computational Number Theory

59,61€ + 10% CARD

 This volume contains the refereed proceedings of the Workshop on Cryptography and Computational Number Theory, CCNT'99, which has been held in Singapore during the week of November 22-26, 1999.
ENGLISH

Number Theoretic Methods In Cryptography - Complexity Lower Bounds

by Igor Shparlinski

59,61€ + 10% CARD

 The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1.
ENGLISH

Symbolic Rewriting Techniques

59,61€ + 10% CARD

 Symbolic rewriting techniques are methods for deriving consequences from systems of equations, and are of great use when investigating the structure of the solutions. Such techniques appear in many important areas of research within computer algebra: • the Knuth-Bendix completion for groups, monoids and general term-rewriting systems, • the Buchberger algorithm for Gröbner bases, • the Ritt-Wu characteristic set method for ordinary differential equations, and • the Riquier-Janet method for partial differential equations. This volume contains invited and contributed papers to the Symbolic Rewriting Techniques workshop, which was held at the Centro Stefano Franscini in Ascona, Switzerland, from April 30 to May 4, 1995. That workshop brought together 40 researchers from various areas of rewriting techniques, the main goal being the investigation of common threads and methods. Following the workshops, each contribution was formally refereed and 14 papers were selected for publication.
ENGLISH

Perspectives In Computational Complexity - The Somenath Biswas Anniversary Volume

131,84€ + 10% CARD

 Perspectives in Computational Complexity
ENGLISH

Advances In Proof Theory

119,24€ + 10% CARD

 The aim of this volume is to collect original contributions by the best specialists from the area of proof theory, constructivity, and computation and discuss recent trends and results in these areas.
ENGLISH

Mathematical Logic - Foundations For Information Science

by Wei Li

71,54€ + 10% CARD

 Presents basic principles and formal calculus of mathematical logic systematically. This book covers the core contents of classical mathematical logic, including the syntax and models of first-order languages, formal inference systems, computability and representability, and Godel's theorems.
ENGLISH

Graph-Based Proof Procedures For Horn Clauses

by Raatz

59,61€ + 10% CARD

 A large part of the monograph is devoted to detailed proofs that the methods we present are sound and complete, which in the context of the logic programming, means that the operational and denotational semantics agree.
ENGLISH

Notes On Introductory Combinatorics

by Donald R. Woods, George Polya e Robert E. Tarjan

92,74€ + 10% CARD

 In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. Enumerative combinatorics deals with the counting of combinatorial objects. Existential combinatorics studies the existence or nonexistence of combinatorial configurations.
ENGLISH

Applied Probability-Computer Science: The Interface Volume 1

by Ralph L. Disney e Teunis J. Ott

59,61€ + 10% CARD

 FunctionQl areas which are, or are becoming, sources of exciting problems are computer performance analysis, data base analysis, analysis of communication protocols, data networks, and mixed voice-data telephone networks.
ENGLISH

Evolution Of Programs

by Dershowitz

59,61€ + 10% CARD

 The synthesis rules may be used when a program is first being developed, or when, in the course of modifying a program, the need arises to rewrite a program segment.
ENGLISH

Real-Time Control Of Walking

by M.D. Donner

59,61€ + 10% CARD

 In the research community the field of robotics has recently reached large size and respectability, but without answering the question, "What is robotics?" Rather than try to enumerate all of the things that are and are not robots, I will try to characterize the kinds of features that make a system a robot.
ENGLISH

Learning And Geometry: Computational Approaches

118,59€ + 10% CARD

 The field of computational learning theory arose out of the desire to for- mally understand the process of learning. Scholars in both fields came together to learn about each others' field and to look for common ground, with the ultimate goal of providing a new model of learning from geometrical examples that would be useful in computer vision.
ENGLISH

Feasible Mathematics - A Mathematical Sciences Institute Workshop, Ithaca, New York, June 1989

by P.J. Scott e S.R. Buss

59,61€ + 10% CARD

 A so-called "effective" algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A "feasible" algorithm is one which only requires a limited amount of space and/or time for execution; the general idea is that a feasible algorithm is one which may be practical on today''s or at least tomorrow''s computers. There is no definitive analogue of Church''s thesis giving a mathematical definition of feasibility; however, the most widely studied mathematical model of feasible computability is polynomial-time computability. Feasible Mathematics includes both the study of feasible computation from a mathematical and logical point of view and the reworking of traditional mathematics from the point of view of feasible computation. The diversity of Feasible Mathematics is illustrated by the. contents of this volume which includes papers on weak fragments of arithmetic, on higher type functionals, on bounded linear logic, on sub recursive definitions of complexity classes, on finite model theory, on models of feasible computation for real numbers, on vector spaces and on recursion theory. The vVorkshop on Feasible Mathematics was sponsored by the Mathematical Sciences Institute and was held at Cornell University, June 26-28, 1989.
ENGLISH

Feasible Mathematics Ii

59,61€ + 10% CARD

 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.
ENGLISH

Introduction To Quantum Computing Algorithms

by Arthur O. Pittenger

79,49€ + 10% CARD

 In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com- puter. Since the difficulty of the factoring problem is crucial for the se- curity of a public key encryption system, interest (and funding) in quan- tum computing and quantum computation suddenly blossomed. Quan- tum computing had arrived. The study of the role of quantum mechanics in the theory of computa- tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]' [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec- tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of "quantum machines" one could imitate any quantum system.
ENGLISH

Interpolating Cubic Splines

by Gary D. Knott

98,71€ + 10% CARD

 A spline is a thin flexible strip composed of a material such as bamboo or steel that can be bent to pass through or near given points in the plane, or in 3-space in a smooth manner. Mechanical engineers and drafting specialists find such (physical) splines useful in designing and in drawing plans for a wide variety of objects, such as for hulls of boats or for the bodies of automobiles where smooth curves need to be specified. These days, physi cal splines are largely replaced by computer software that can compute the desired curves (with appropriate encouragment). The same mathematical ideas used for computing "spline" curves can be extended to allow us to compute "spline" surfaces. The application ofthese mathematical ideas is rather widespread. Spline functions are central to computer graphics disciplines. Spline curves and surfaces are used in computer graphics renderings for both real and imagi nary objects. Computer-aided-design (CAD) systems depend on algorithms for computing spline functions, and splines are used in numerical analysis and statistics. Thus the construction of movies and computer games trav els side-by-side with the art of automobile design, sail construction, and architecture; and statisticians and applied mathematicians use splines as everyday computational tools, often divorced from graphic images.
ENGLISH

Bounded Queries In Recursion Theory

by Georgia Martin e William Levine

118,59€ + 10% CARD

 The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it.
ENGLISH

Proof Theory For General Unification

by W. Snyder

59,61€ + 10% CARD

 In this monograph we study two generalizations of standard unification, E-unification and higher-order unification, using an abstract approach orig inated by Herbrand and developed in the case of standard first-order unifi cation by Martelli and Montanari. The formalism presents the unification computation as a set of non-deterministic transformation rules for con verting a set of equations to be unified into an explicit representation of a unifier (if such exists). This provides an abstract and mathematically elegant means of analysing the properties of unification in various settings by providing a clean separation of the logical issues from the specification of procedural information, and amounts to a set of ''inference rules'' for unification, hence the title of this book. We derive the set of transformations for general E-unification and higher order unification from an analysis of the sense in which terms are ''the same'' after application of a unifying substitution. In both cases, this results in a simple extension of the set of basic transformations given by Herbrand Martelli-Montanari for standard unification, and shows clearly the basic relationships of the fundamental operations necessary in each case, and thus the underlying structure of the most important classes of term unifi cation problems.
Loading results...

View more results