Minimum segments in sequent derivations | Zendy

Mirjana Borisavljević | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Minimum segments in sequent derivations

Author(s) -

Mirjana Borisavljević

Publication year - 2003

Publication title -

publications de l institut mathematique

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.246

H-Index - 17

eISSN - 1820-7405

pISSN - 0350-1302

DOI - 10.2298/pim0374005b

Subject(s) - sequent , mathematics , sequent calculus , natural deduction , predicate (mathematical logic) , pure mathematics , discrete mathematics , computer science , geometry , mathematical proof , programming language

In a system of sequents for intuitionistic predicate logic, deriva- tions without a special kind of cuts (maximum cuts) will be considered. The following be shown: in a derivation without maximum cuts there are paths of the same form as paths in a normal derivation of natural deduction, i.e., these paths have the E-part, the I-part, and one minimum part which corresponds to a minimum segment in a normal derivation.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research