Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have
published seminal works by leading logicians. Many of the original books in the series have …

We give a recursion-theoretic characterization of FP which describes polynomial time
computation independently of any externally imposed resource bounds. In particular, this …

This book presents an up-to-date, unified treatment of research in bounded arithmetic and
complexity of propositional logic with emphasis on independence proofs and lower bound …

Usual typed lambda-calculi yield input/output specifications; in this paper the authors show
how to extend this paradigm to complexity specifications. This is achieved by means of a …

In 1958, Kurt Gödel published in the journal Dialectica an interpretation of intuitionistic
arithmetic in a quantifier-free theory of functionals of finite type, an interpretation which has …

This account of propositional logic concentrates on the algorithmic translation of important
methods, especially of decision procedures for (subclasses of) propositional logic. Important …

We present Virtualized Reality, a technique to create virtual worlds out of dynamic events
using densely distributed stereo views. The intensity image and depth map for each camera …

§ 1. Introduction. The classical propositional calculus has an undeserved reputation among
logicians as being essentially trivial. I hope to convince the reader that it presents some of …

The P versus NP question grew out of developments in mathematical logic and electronic
technology during the middle part of the twentieth century. It is now considered to be one of …

This chapter discusses the proof-theoretic foundations of the first-order theory of the non-
negative integers. This first-order theory of numbers, also called 'first-order arithmetic' …