1101 search results - page 66 / 221 » Forcing in proof theory |
108
Voted
VMCAI
2007
Springer
15 years 6 months ago
2007
Springer
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
115
Voted
RTA
2004
Springer
15 years 5 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...
99
Voted
CONCUR
1995
Springer
15 years 4 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...
68
Voted
JUCS
2007
15 years 13 days 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...
105
Voted
LPAR
2010
Springer
14 years 10 months ago
2010
Springer
We consider a mild extension of universal algebra in which terms are built both from deterministic and probabilistic variables, and are interpreted as distributions. We formulate a...