The relevance graph of a BCK-formula

Sachio Hirokawa

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

It is known that the set of BCK-formulas which is provable by the detachment rule of Meredith is identical to the set pts(BCK) of principal type-schemes of BCK-λ-terms. This paper shows a characterization of the set pts(BCK-β) of principal type-schemes of BCK-λ-terms in β-normal form. To characterize the set pts(BCK), a 'relevance relation' is defined between type variables in a type. A type variable b is relevant to a type variable c in a type α iff α contains a negative occurrence of a subtype of the form (... → b) → ... → c. The relevance graph G(α) of the type α is the directed graph induced by this relevance relation. A type variable is said to be positive iff it occurs in a positive position and negative otherwise. It is proved that a type α is in pts(BCK-β) iff α satisfies: (a) every type variable occurs exactly once in a negative position and at most once in a positive position; (b) no negative type variable is relevant to any type variable but itself and the subgraph of G(α) whose nodes are positive type variables of α is a tree whose root is the rightmost type variable in α; (c) each positive type variable in a subtype γ is relevant to the right-most type variable in γ.

Original languageEnglish
Pages (from-to)269-285
Number of pages17
JournalJournal of Logic and Computation
Volume3
Issue number3
DOIs
Publication statusPublished - Jun 1 1993

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Software
  • Arts and Humanities (miscellaneous)
  • Hardware and Architecture
  • Logic

Fingerprint Dive into the research topics of 'The relevance graph of a BCK-formula'. Together they form a unique fingerprint.

  • Cite this