You are not logged in | Log in

A simplified lower bound for implicational logic

Speaker(s)
Konrad Zdanowski
Affiliation
UKSW
Date
May 17, 2024, 12:15 p.m.
Room
room 5450
Title in Polish
Uproszczona dolna granica dla logiki implikacyjnej
Seminar
Seminar Semantics, Logic, Verification and its Applications

A streamlined and simplified exponential lower bound on the length of proofs in intuitionistic implicational logic will be presented. The construction suffices to be adaptated to Gordeev and Haeusler’s dag-like natural deduction.