Infinitary provability logic
A non-well-founded deep inference proof system for the modal language with at most countably infinite conjunctions and disjunctions is developed and it is shown that the infinitary provability logic arising from certain admissible sets lies between the set of theorems of the Hilbert-style calculus and the non-well-foun...