1888 search results - page 40 / 378 » Proof theory and computational analysis |
RTA
2004
Springer
14 years 22 days 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...
CONCUR
1995
Springer
13 years 11 months ago
1995
Springer
We develop a theory of bisimulation equivalence for the broadcast calculus CBS. Both the strong and weak versions of bisimulation congruence we study are justi ed in terms of a cha...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We propose to use Grothendieck institutions based on 2categorical diagrams as a basis for heterogeneous specification. We prove a number of results about colimits and (so...
FOCM
2006
13 years 7 months ago
2006
We introduce some modifications and extensions of the concept od index pair in the Conley index theory. We then show how these concepts may be used to overcome some difficulties in...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...