Annual Report Computational Logic Semi-Automated Meta-Theory Proofs for Sequent Calculi
نویسنده
چکیده
Cut Admissibility is an important property for a calculus to have, and as such we wish to be able to automate the proof so that it can be fully formalised. The focus of this research is not to automate a given proof of Cut Admissibility, but rather to provide proof templates, which can then be adapted for other systems. However, before we can further expand on these aims, some background material must be presented. This material falls neatly into two categories; the basic theory, and the systems, and efforts, used to implement the theory.
منابع مشابه
Formalized Meta-Theory of Sequent Calculi for Substructural Logics
When studying sequent calculi, proof theorists often have to prove properties about the systems, whether it is to show that they are “well-behaved”, amenable to automated proof search, complete with respect to another system, consistent, among other reasons. These proofs usually involve many very similar cases, which leads to authors rarely writing them in full detail, only pointing to one or t...
متن کاملAnalytic Calculi for Non-Classical Logics: Theory and Applications
The possession of a suitable proof-calculus is the starting point for many investigations into a logic, including decidability and complexity, computational interpretations and automated theorem proving. By suitable proof-calculus we mean a calculus whose proofs exhibit some notion of subformula property (‘analyticity’). In this talk we describe a method for the algorithmic introduction of anal...
متن کاملTool support for reasoning in display calculi
We present a tool for reasoning in and about propositional sequent calculi. One aim is to support reasoning in calculi that contain a hundred rules or more, so that even relatively small pen and paper derivations become tedious and error prone. As an example, we implement the display calculus D.EAK of dynamic epistemic logic. Second, we provide embeddings of the calculus in the theorem prover I...
متن کاملLinear Logic as a Framework for Specifying Sequent Calculus
In recent years, intuitionistic logic and type systems have been used in numerous computational systems as frameworks for the specification of natural deduction proof systems. As we shall illustrate here, linear logic can be used similarly to specify the more general setting of sequent calculus proof systems. Linear logic’s meta theory can be used also to analyze properties of a specified objec...
متن کاملFocused Linear Logic and the λ-calculus
Linear logic enjoys strong symmetries inherited from classical logic while providing a constructive framework comparable to intuitionistic logic. However, the computational interpretation of sequent calculus presentations of linear logic remains problematic, mostly because of the many rule permutations allowed in the sequent calculus. We address this problem by providing a simple interpretation...
متن کامل