3228 search results - page 172 / 646 » Computationally Sound Proofs |
181
click to vote
RTA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
145
click to vote
TLCA
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimin...
185
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
185
click to vote
TABLEAUX
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...
146
click to vote
AISC
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...