1101 search results - page 42 / 221 » Forcing in proof theory |
93
Voted
BIRTHDAY
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
97
Voted
KBSE
1997
IEEE
15 years 4 months ago
1997
IEEE
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
100
click to vote
ENTCS
2006
15 years 18 days ago
2006
We describe an ongoing project in which we attempt to describe a neutral approach to proof and refutation. In particular, we present a language of neutral expressions which contai...
109
Voted
AAI
2006
15 years 20 days ago
2006
Enabling and managing coordination activities between autonomous, possibly mobile, computing entities in dynamic computing scenarios challenges traditional approaches to distribut...
114
Voted
LFCS
2009
Springer
15 years 7 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...