Sciweavers

551 search results - page 9 / 111
» Natural proofs
Sort
View
ENTCS
2006
159views more  ENTCS 2006»
13 years 10 months ago
Approximations of Modal Logic K
Inspired by the recent work on approximating classical logic, we present a procedure that approximates the modal logic K by determining a maximum limit of introspection. This proc...
Guilherme de Souza Rabello, Marcelo Finger
ENTCS
2006
133views more  ENTCS 2006»
13 years 10 months ago
A Compositional Natural Semantics and Hoare Logic for Low-Level Languages
The advent of proof-carrying code has generated significant interest in reasoning about low-level languages. It is widely believed that low-level languages with jumps must be diff...
Ando Saabas, Tarmo Uustalu
IANDC
2006
93views more  IANDC 2006»
13 years 10 months ago
Automation for interactive proof: First prototype
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem prov...
Jia Meng, Claire Quigley, Lawrence C. Paulson
ASIACRYPT
2005
Springer
14 years 3 months ago
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
Abstract We provide evidence that the unforgeability of several discrete-log based signatures like Schnorr signatures cannot be equivalent to the discrete log problem in the standa...
Pascal Paillier, Damien Vergnaud
BIRTHDAY
2003
Springer
14 years 3 months ago
A Hierarchical Completeness Proof for Propositional Temporal Logic
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...
Ben C. Moszkowski