3552 search results - page 236 / 711 » Proof theory in the abstract |
153
click to vote
DAGSTUHL
2003
15 years 8 months ago
2003
Abstract. There are a range of abstractions used for both modelling and proof modern computational systems. While these abstractions may have been devised for specific purposes, t...
164
click to vote
IJFCS
2011
15 years 1 months ago
2011
some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to pology. In turn, the ...
181
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
153
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
151
click to vote
CIE
2007
Springer
16 years 22 days ago
2007
Springer
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...