3552 search results - page 38 / 711 » Proof theory in the abstract |
121
click to vote
JELIA
1990
Springer
15 years 6 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
113
click to vote
TPHOL
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract. Interactive proof assistants should verify the proofs they receive from automatic theorem provers. Normally this proof reconstruction takes place internally, forming part...
121
click to vote
ISOLA
2007
Springer
15 years 8 months ago
2007
Springer
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
110
click to vote
TPHOL
2002
IEEE
15 years 6 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
110
click to vote
STACS
2001
Springer
15 years 6 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...