Sciweavers

551 search results - page 30 / 111
» Natural proofs
Sort
View
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
14 years 16 days ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
TAPSOFT
1987
Springer
14 years 8 days ago
Induction Principles Formalized in the Calculus of Constructions
The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard [12], Martin...
Gérard P. Huet
JSC
2006
122views more  JSC 2006»
13 years 8 months ago
An automated prover for Zermelo-Fraenkel set theory in Theorema
This paper presents some fundamental aspects of the design and the implementation of an automated prover for Zermelo-Fraenkel set theory within the well-known Theorema system. The...
Wolfgang Windsteiger
LICS
2007
IEEE
14 years 3 months ago
Principles of Superdeduction
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
Paul Brauner, Clément Houtmann, Claude Kirc...
RTA
2005
Springer
14 years 2 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner