Dialogues, strategies, and intuitionistic provability (Q1061740): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5547552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dialogspiele als Semantische Grundlage von Logikkalkülen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3290716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on the completeness of logical systems relative to the validity- concepts of P. Lorenzen and K. Lorenz / rank
 
Normal rank

Latest revision as of 18:25, 14 June 2024

scientific article
Language Label Description Also known as
English
Dialogues, strategies, and intuitionistic provability
scientific article

    Statements

    Dialogues, strategies, and intuitionistic provability (English)
    0 references
    0 references
    1985
    0 references
    This paper presents an equivalent theorem proof, namely that for every winning strategy in certain Lorenzen-style dialogue games there is a proof in LJ, the Gentzen consecution calculus for intuitionistic logic, and vice versa. There is an algorithm for transforming either into the other. In addition, for propositional languages, every LJ proof can be transformed into an irreducible normal form.
    0 references
    0 references
    0 references
    0 references
    0 references
    natural deduction
    0 references
    winning strategy
    0 references
    dialogue games
    0 references
    Gentzen consecution calculus
    0 references
    intuitionistic logic
    0 references
    irreducible normal form
    0 references
    0 references