1101 search results - page 81 / 221 » Forcing in proof theory |
92
Voted
HUMO
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This paper introduces a hand tracking system with a theoretical proof of convergence. The tracking system follows a model-based approach and uses image-based cues, namely...
117
Voted
LFCS
2007
Springer
15 years 6 months ago
2007
Springer
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
101
Voted
SAC
2006
ACM
15 years 6 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
111
click to vote
LPAR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
134
click to vote
TYPES
1995
Springer
15 years 4 months ago
1995
Springer
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...