Opening book details…
Can I read Space in Weak Propositional Proof Systems on EtoBox?
Space in Weak Propositional Proof Systems by Ilario Bonacina is a nonfiction available to read on EtoBox.
What is Space in Weak Propositional Proof Systems about?
1 online resource 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 Online resource; title from PDF title page (EBSCO, viewed January 24, 2018) Includes bibliographical references and index Introducti
Who reads Space in Weak Propositional Proof Systems?
It is typically read by self-directed learners exploring a subject in depth.
Common subject areas: history, science, philosophy, social sciences.
- Author
- Ilario Bonacina
- Publisher
- Springer International Publishing : Imprint: Springer
- Published
- 2017
- Language
- EN
- ISBN
- 9783319734538
- Category
- nonfiction
- Subjects
- Mathematics, Computer Science, Stem
More by Ilario Bonacina
Browse all works by Ilario Bonacina
Similar books
- Proof-Theoretical Coherence (Studies in Logic (Logic & Cognitive Systems)) — Dosen, Kosta, Petric, Zoran (2007)
- Logical Foundations of Proof Complexity (Perspectives in Logic) — Phuong Nguyen Stephen Cook (2010)
- Completeness Theory For Propositional Logics (studies In Universal Logic) — Pogorzelski, Witold A.; Wojtylak, Piotr (2008)
- Resolution Proof Systems: An Algebraic Theory (automated Reasoning Series) — Zbigniew Stachniak (2012)
- Propositional Quantifiers — Peter Fritz (2024)
- R-CALCULUS, IV : propositional logic — Wei Li; Yuefei Sui (2023)