Sciweavers

1894 search results - page 17 / 379
» A TLA Proof System
Sort
View
SIAMCOMP
2000
76views more  SIAMCOMP 2000»
13 years 10 months ago
On Interpolation and Automatization for Frege Systems
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
Maria Luisa Bonet, Toniann Pitassi, Ran Raz
ENTCS
2007
92views more  ENTCS 2007»
13 years 10 months ago
A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are...
Clemens Grabmayer
ICALP
2010
Springer
14 years 3 months ago
On p-Optimal Proof Systems and Logics for PTIME
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
Yijia Chen, Jörg Flum
LATA
2009
Springer
14 years 5 months ago
Nondeterministic Instance Complexity and Proof Systems with Advice
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
Olaf Beyersdorff, Johannes Köbler, Sebastian ...
COCO
2007
Springer
109views Algorithms» more  COCO 2007»
14 years 4 months ago
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
Richard Cleve, William Slofstra, Falk Unger, Sarva...