Cut-elimination for a logic with definitions and induction

@article{McDowell2000CuteliminationFA,
title={Cut-elimination for a logic with definitions and induction},
author={Raymond McDowell and Dale Miller},
journal={Theor. Comput. Sci.},
year={2000},
volume={232},
pages={91-119}
}

In order to reason about specifications of computations that are given via the proof search or logic programming paradigm one needs to have at least some forms of induction and some principle for reasoning about the ways in which terms are built and the ways in which computations can progress. The literature contains many approaches to formally adding these reasoning principles with logic specifications. We choose an approach based on the sequent calculus and design an intuitionistic logic FO… CONTINUE READING

A xpoint theorem in linear logic. A message posted on the linear@cs.stanford.edu mailing list, http://www.csl.sri.com/linear/mailing-list- traffic/www/07/mail_3.html