Sciweavers

123 search results - page 13 / 25
» The Deduction Theorem for Strong Propositional Proof Systems
Sort
View
BIRTHDAY
2007
Springer
15 years 3 months ago
Superdeduction at Work
Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a ...
Paul Brauner, Clément Houtmann, Claude Kirc...
ENTCS
2002
66views more  ENTCS 2002»
14 years 9 months ago
Strongly Normalising Cut-Elimination with Strict Intersection Types
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
Steffen van Bakel
86
Voted
CORR
2006
Springer
110views Education» more  CORR 2006»
14 years 9 months ago
Definitions by Rewriting in the Calculus of Constructions
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
Frédéric Blanqui
CLIMA
2007
14 years 11 months ago
Proof Theory for Distributed Knowledge
The proof theory of multi-agent epistemic logic extended with operators for distributed knowledge is studied. Distributed knowledge of A within a group G means that A follows from ...
Raul Hakli, Sara Negri
CADE
1990
Springer
15 years 1 months ago
IMPS: An Interactive Mathematical Proof System
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
William M. Farmer, Joshua D. Guttman, F. Javier Th...