188 search results - page 27 / 38 » Logic of Proofs for Bounded Arithmetic |
JUCS
2007
15 years 4 months ago
2007
: In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic te...
163
click to vote
LICS
2010
IEEE
15 years 3 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
179
click to vote
ICFEM
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Certificate translation is a method that transforms certificates of source programs into certificates of their compilation. It provides strong guarantees on low-level cod...
134
click to vote
IPL
2007
15 years 4 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
136
click to vote
TLCA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...