?
Циклические выводы в логике доказуемости Гёделя-Лёба
С. 56–58.
A Hilbert-style proof system for the Godel-Lob provability logic GL is
considered, in which provability is based on the notion of a cyclic (circu-
lar) proof. Unlike ordinary derivations, these proofs can be represented
by graphs allowed to contain cycles, rather than by finite trees.
Language:
Russian
In book
М.: Современные тетради, 2017.