Proof internalization in generalized Frege systems for classical logic

Savateev, Yury

doi:10.1016/j.apal.2013.07.017

Annals of Pure and Applied Logic

2014

DOI: 10.1016/j.apal.2013.07.017

|View full text |Cite

Proof internalization in generalized Frege systems for classical logic

Yury Savateev¹

Abstract: We present a general method for inserting proofs in Frege systems for classical logic that produces systems that can internalize their own proofs.Introduction.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is possible to formulate sequent systems with the subformula property by adding indexes to standard justification logic operatorsà la Renne[12], or explicitly representing (potentially non cut-free) proofs themselvesà la Saveetev[13]. Beyond being somewhat artificial, these approaches offer little insight into the question of the analyticity for the logic of proofs.…”

mentioning

confidence: 99%

See 1 more Smart Citation

An Analytic Calculus for the Intuitionistic Logic of Proofs

Hill¹,

Poggiolesi²

2019

Notre Dame J. Formal Logic

View full text Add to dashboard Cite

The goal of this paper is to take a step towards the resolution of the problem of finding an analytic sequent calculus for the logic of proofs. For this, we focus on the system Ilp, the intuitionistic version of the logic of proofs. First we present the sequent calculus Gilp that is sound and complete with respect to the system Ilp; we prove that Gilp is cut-free and contraction-free, but it still does not enjoy the subformula property. Then, we enrich the language of the logic of proofs and we formulate in this language a second Gentzen calculus Gilp *. We show that Gilp * is a conservative extension of Gilp, and that Gilp * satisfies the subformula property. Keyword cut-elimination, logic of proofs, normalisation, proof sequents 2010 MSC: 03F05, 03B60 philosophical point of view. 2 Three works are related to the present one: in the papers [10, 9] the calculus Gilp is introduced and a rough idea of how to construct the calculus Gilp * is briefly suggested. The paper [11] mainly concerns a philosophical argument in favor of the analyticity of a sequent calculus, but exploits as a case-study the proof theory for the logic of proofs. The present paper is the only one where both systems Gilp and Gilp * are presented and the proof of their relation and of the analyticity of the logic of proof via the system Gilp * is fully demonstrated. The paper is organised as follows. Section 2. We will introduce the calculus Gilp for the intuitionistic logic of proofs. Sections 3-4. We will show that this calculus is contraction-free and cut-free; moreover the rules introducing propositional connectives and proof polynomials are symmetric (see [8] and [16] for a precise description of this property). However, Gilp does not satisfy the subformula property. Section 5. In the light of this result, we will analyse the logic of proofs in detail and attempt to find the reason for its "resistance" to analyticity. We will show that the reason is linked to the language of the logic of proofs. Section 6. We will change the language of the logic of proofs and build the calculus Gilp * in this new language. We will show that Gilp * satisfies the same properties as Gilp, namely it is cut-free, contraction-free and the rules introducing propositional connectives and proof polynomials are symmetric. Section 7. We will show that Gilp * enjoys the subformula property, and that-Section 8.-it can be thought of as a conservative extension of Gilp. 2 The calculus Gilp Definition 2.1. The language L lp contains: (i) the usual language of propositional boolean logic, (ii) proof variables x 0 , x 1 , x 2 , ..., (iii) proof constants c 0 , c 1 , c 2 , ..., (iv) the functional symbols +, !, and •, and (v) the operator symbol of the type "term : formula". We will use a, b, c, ... for proof constants, and u, v, w, ... for proof variables.

show abstract

mentioning

confidence: 99%

“…Note that here and elsewhere we refer to[2,4] and use the notation of the former 13. Specifically, cont is the reflexive transitive closure of the relation cont 1 defined as follows:…”

mentioning

confidence: 99%

An Analytic Calculus for the Intuitionistic Logic of Proofs

Hill¹,

Poggiolesi²

2019

Notre Dame J. Formal Logic

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Proof internalization in generalized Frege systems for classical logic

Abstract: We present a general method for inserting proofs in Frege systems for classical logic that produces systems that can internalize their own proofs.Introduction.

Cited by 1 publication

References 4 publications

An Analytic Calculus for the Intuitionistic Logic of Proofs

An Analytic Calculus for the Intuitionistic Logic of Proofs

Contact Info

Product

Resources

About