1894 search results - page 47 / 379 » A TLA Proof System |
APAL
2008
13 years 11 months ago
2008
A simple cut elimination proof for arithmetic with epsilon symbol is used to establish termination of a modified epsilon substitution process. This opens a possibility of extensio...
LOGCOM
2006
13 years 10 months ago
2006
Comparative logics were introduced by Casari in the 1980s to treat aspects of comparative reasoning occurring in natural language. In this paper Gentzen systems are defined for the...
ICFP
2009
ACM
14 years 11 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
SYNASC
2007
IEEE
14 years 5 months ago
2007
IEEE
In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploratio...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...