3552 search results - page 318 / 711 » Proof theory in the abstract |
151
click to vote
EUROCRYPT
2005
Springer
16 years 8 days ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
158
click to vote
APAL
2010
15 years 6 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
240
click to vote
NETWORKS
2011
14 years 9 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
144
click to vote
CADE
2004
Springer
16 years 7 months ago
2004
Springer
Abstract. Undefined terms are commonplace in mathematics, particularly in calculus. The traditional approach to undefinedness in mathematical practice is to treat undefined terms a...
132
click to vote
ALT
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. We describe an alternative construction of an existing canonical representation for definite Horn theories, the Guigues-Duquenne basis (or GD basis), which minimizes a n...