Proof finding algorithms for implicational logics (Q1575928): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Martin W. Bunder / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Grigori Mints / rank
Normal rank
 
Property / author
 
Property / author: Martin W. Bunder / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Grigori Mints / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lambda terms definable as combinators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BCK and BCI logics, condensed detachment and the 2-property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über Tautologien, in Welchen Keine Variable Mehr Als Zweimal Vorkommt / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic propositional logic is polynomial-space complete / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:16, 30 May 2024

scientific article
Language Label Description Also known as
English
Proof finding algorithms for implicational logics
scientific article

    Statements

    Proof finding algorithms for implicational logics (English)
    0 references
    23 August 2000
    0 references
    Logics considered here include implicational fragments of intuitionistic propositional logic, relevance logics \(R_{\rightarrow}\), \(T_{\rightarrow}\) and \(T_{\rightarrow}-W\), multiplicative linear logic and affine logic. For each of them a restriction on \(\lambda\)-terms providing an equivalent natural deduction formulation is stated, then a corresponding proof search algorithm is described.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    implicative logics
    0 references
    decision procedures
    0 references
    implicational fragments
    0 references
    intuitionistic propositional logic
    0 references
    relevance logics
    0 references
    multiplicative linear logic
    0 references
    affine logic
    0 references
    restriction on \(\lambda\)-terms
    0 references
    natural deduction
    0 references
    proof search algorithm
    0 references
    0 references
    0 references