This innovative monograph explores a new mathematical formalism in higher-order temporal logic for proving properties about the behavior of systems. Developed by the authors, the goal of this novel approach is to explain what occurs when multiple, di...Lasīt vairāk
This innovative monograph explores a new mathematical formalism in higher-order temporal logic for proving properties about the behavior of systems. Developed by the authors, the goal of this novel approach is to explain what occurs when multiple, di...Lasīt vairāk
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. Some emphasis will be put on ordinal analysis, re...Lasīt vairāk
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 cha...Lasīt vairāk
This book brings together contributions by leading researchers in computational complexity theory written in honor of Somenath Biswas on the occasion of his sixtieth birthday. They discuss current trends and exciting developments in this flourishing...Lasīt vairāk
Sērija : Progress in Computer Science and Applied Logic
(Izdošanas datums: 27-Nov-2013, PDF+DRM, Izdevniecība: Birkhauser Boston Inc, ISBN-13: 9781475711011)
In the winter of 1978, Professor George P61ya and I jointly taught Stanford Universitys introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as...Lasīt vairāk
Sērija : Progress in Computer Science and Applied Logic
(Izdošanas datums: 21-Nov-2013, PDF+DRM, Izdevniecība: Birkhauser Boston Inc, ISBN-13: 9781489935564)
The origins of this monograph lie in my Ph.D. dissertation of 1987 at the University of Pennsylvania, which was concerned with proof procedures for the Horn clause subset of logic. The rise of logic programming has made this an important area of stud...Lasīt vairāk
Sērija : Progress in Computer Science and Applied Logic
(Izdošanas datums: 29-Jun-2013, PDF+DRM, Izdevniecība: Birkhauser Boston Inc, ISBN-13: 9781461249900)
I wonder whether Karel Capek imagined in 1923 that by his use of the Czech word for forced labor, rohota, to name the android creations of Mr. Rossum he was naming an important technology of his future. Perhaps it wasnt Capeks work directly, but ra...Lasīt vairāk
Sērija : Progress in Computer Science and Applied Logic
(Izdošanas datums: 14-Mar-2013, PDF+DRM, Izdevniecība: Birkhauser Boston Inc, ISBN-13: 9781461256212)
-Ecclesiastes 12:12 Programs are invariably subjected to many rorms or transrormation. After an initial version of a program has been designed and developed, it undergoes debugging and certification. In addition, most long-lived pro- grams have a liC...Lasīt vairāk
Sērija : Progress in Computer Science and Applied Logic
(Izdošanas datums: 13-Mar-2013, PDF+DRM, Izdevniecība: Springer-Verlag New York Inc., ISBN-13: 9781461225669)
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 dont know what is supposed to com...Lasīt vairāk
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:...Lasīt vairāk
Sērija : Progress in Computer Science and Applied Logic
(Izdošanas datums: 07-Mar-2013, PDF+DRM, Izdevniecība: Birkhauser Boston Inc, ISBN-13: 9781461234661)
A so-called "e;effective"e; algorithm may require arbitrarily large finite amounts of time and space resources, and hence may not be practical in the real world. A "e;feasible"e; algorithm is one which only requires a limited amount o...Lasīt vairāk
Sērija : Progress in Computer Science and Applied Logic
(Izdošanas datums: 07-Mar-2013, PDF+DRM, Izdevniecība: Springer-Verlag New York Inc., ISBN-13: 9781461257912)
These two volumes are the Proceedings of the first special interest meeting instigated and organized by the joint Technical Section and College in Applied Probability of ORSA and THlS. This meeting, which took place January 5-7, 1981 at Florida Atlan...Lasīt vairāk
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 met...Lasīt vairāk
This volume contains the refereed proceedings of the Workshop on Cryptography and Computational Number Theory, CCNT99, which has been held in Singapore during the week of November 22-26, 1999. The workshop was organized by the Centre for Systems Sec...Lasīt vairāk
Sērija : Progress in Computer Science and Applied Logic
(Izdošanas datums: 06-Dec-2012, PDF+DRM, Izdevniecība: Springer-Verlag New York Inc., ISBN-13: 9781461206354)
One of the major concerns of theoretical computer science is the classifi- cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of th...Lasīt vairāk
Sērija : Progress in Computer Science and Applied Logic
(Izdošanas datums: 06-Dec-2012, PDF+DRM, Izdevniecība: Springer-Verlag New York Inc., ISBN-13: 9781461213208)
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)...Lasīt vairāk
Sērija : Progress in Computer Science and Applied Logic
(Izdošanas datums: 06-Dec-2012, PDF+DRM, Izdevniecība: Springer-Verlag New York Inc., ISBN-13: 9781461204350)
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 Mo...Lasīt vairāk
