Space in Weak Propositional Proof Systems


Book Description

This book considers logical proof systems from the point of view of their space complexity. After an introduction to propositional proof complexity the author structures the book into three main parts. Part I contains two chapters on resolution, one containing results already known in the literature before this work and one focused on space in resolution, and the author then moves on to polynomial calculus and its space complexity with a focus on the combinatorial technique to prove monomial space lower bounds. The first chapter in Part II addresses the proof complexity and space complexity of the pigeon principles. Then there is an interlude on a new type of game, defined on bipartite graphs, essentially independent from the rest of the book, collecting some results on graph theory. Finally Part III analyzes the size of resolution proofs in connection with the Strong Exponential Time Hypothesis (SETH) in complexity theory. The book is appropriate for researchers in theoretical computer science, in particular computational complexity.




Theory and Applications of Models of Computation


Book Description

This book constitutes the refereed proceedings of the Third International Conference on Theory and Applications of Models of Computation, TAMC 2006, held in Beijing, China, in May 2006. The 75 revised full papers presented together with 7 plenary talks were carefully reviewed and selected from 319 submissions. All major areas in computer science, mathematics (especially logic) and the physical sciences particularly with regard to computation and computability theory are addressed.




Mathematical Foundations of Computer Science 2013


Book Description

This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.




Theory and Applications of Models of Computation


Book Description

This book constitutes the refereed proceedings of the 7th International Conference on Theory and Applications of Models of Computation, TAMC 2010, held in Prague, Czech Republic, in June 2010. The 35 revised full papers presented together with 5 contributions of special sessions as well as 2 plenary talks were carefully reviewed and selected from 76 submissions. The papers address the three main themes of the conference which were computability, complexity, and algorithms and present current research in these fields with aspects to theoretical computer science, algorithmic mathematics, and applications to the physical sciences.




Computer Science Logic


Book Description

This book constitutes the refereed proceedings of the 21st International Workshop on Computer Science Logic, CSL 2007, held as the 16th Annual Conference of the EACSL in Lausanne, Switzerland. The 36 revised full papers presented together with the abstracts of six invited lectures are organized in topical sections on logic and games, expressiveness, games and trees, logic and deduction, lambda calculus, finite model theory, linear logic, proof theory, and game semantics.




Handbook of Proof Theory


Book Description

This volume contains articles covering a broad spectrum of proof theory, with an emphasis on its mathematical aspects. The articles should not only be interesting to specialists of proof theory, but should also be accessible to a diverse audience, including logicians, mathematicians, computer scientists and philosophers. Many of the central topics of proof theory have been included in a self-contained expository of articles, covered in great detail and depth.The chapters are arranged so that the two introductory articles come first; these are then followed by articles from core classical areas of proof theory; the handbook concludes with articles that deal with topics closely related to computer science.




Computer Science Logic


Book Description

This book constitutes the proceedings of the 23rd International Workshop on Computer Science Logic, CSL 2009, held in Coimbra, Portugal, in September 2009. The 34 papers presented together with 5 invited talks were carefully reviewed and selected from 89 full paper submissions. All current aspects of logic in computer science are addressed, ranging from foundational and methodological issues to application issues of practical relevance. The book concludes with a presentation of this year's Ackermann award, the EACSL Outstanding Dissertation Award for Logic in Computer Science.




Spectral Spaces


Book Description

Offers a comprehensive presentation of spectral spaces focussing on their topology and close connections with algebra, ordered structures, and logic.




The Logico-Algebraic Approach to Quantum Mechanics


Book Description

The twentieth century has witnessed a striking transformation in the un derstanding of the theories of mathematical physics. There has emerged clearly the idea that physical theories are significantly characterized by their abstract mathematical structure. This is in opposition to the tradi tional opinion that one should look to the specific applications of a theory in order to understand it. One might with reason now espouse the view that to understand the deeper character of a theory one must know its abstract structure and understand the significance of that struc ture, while to understand how a theory might be modified in light of its experimental inadequacies one must be intimately acquainted with how it is applied. Quantum theory itself has gone through a development this century which illustrates strikingly the shifting perspective. From a collection of intuitive physical maneuvers under Bohr, through a formative stage in which the mathematical framework was bifurcated (between Schrödinger and Heisenberg) to an elegant culmination in von Neumann's Hilbert space formulation the elementary theory moved, flanked even at the later stage by the ill-understood formalisms for the relativistic version and for the field-theoretic altemative; after that we have a gradual, but constant, elaboration of all these quantal theories as abstract mathematical struc tures (their point of departure being von Neumann's formalism) until at the present time theoretical work is heavily preoccupied with the manip ulation of purely abstract structures.




Bounded Arithmetic, Propositional Logic and Complexity Theory


Book Description

Discusses the deep connections between logic and complexity theory, and lists a number of intriguing open problems.