1101 search results - page 68 / 221 » Forcing in proof theory |
110
Voted
APAL
2010
15 years 3 months ago
2010
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTT0 and LTT 0, which we...
137
click to vote
SEFM
2006
IEEE
15 years 9 months ago
2006
IEEE
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
121
Voted
JSYML
2006
15 years 3 months ago
2006
Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic (Fund. Math. 171 (2002)), we show that there exists a number n such that m Sm (the u...
227
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...
108
click to vote
CHARME
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refine...