Sciweavers

15 search results - page 2 / 3
» Induction and Co-induction in Sequent Calculus
Sort
View
SAS
2007
Springer
140views Formal Methods» more  SAS 2007»
13 years 11 months ago
Formalised Inductive Reasoning in the Logic of Bunched Implications
We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framewo...
James Brotherston
CADE
2006
Springer
14 years 5 months ago
Cut-Simulation in Impredicative Logics
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
Christoph Benzmüller, Chad E. Brown, Michael ...
LPNMR
2009
Springer
13 years 12 months ago
A Deductive System for FO(ID) Based on Least Fixpoint Logic
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
Ping Hou, Marc Denecker
BIRTHDAY
2007
Springer
13 years 11 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...
TPHOL
2002
IEEE
13 years 10 months ago
Free-Style Theorem Proving
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
David Delahaye