6978 search results - page 209 / 1396 » On Proofs in System P |
171
click to vote
UC
2009
Springer
16 years 1 months ago
2009
Springer
Membrane systems with dividing and dissolving membranes are known to solve PSPACE problems in polynomial time. However, we give a P upperbound on an important restriction of such s...
182
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
178
click to vote
LICS
2003
IEEE
15 years 12 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
164
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
163
click to vote
JIIS
2008
15 years 6 months ago
2008
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...