Transfinite set theory encompasses the rigorous study of infinite hierarchies, particularly those structured by ordinals and cardinals. This field has been instrumental in deepening our comprehension ...
For the Heyting Arithmetic HA, HA∗ is defined [14, 15] as the theory {A | HA ⊢ A }, where A is called the box translation of A (Definition 2.4). We characterize the Σ₁-provability logic of HA∗ as a ...
Studia Logica: An International Journal for Symbolic Logic, Vol. 101, No. 1 (February 2013), pp. 31-44 (14 pages) Provability logic is a modal logic for studying properties of provability predicates, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback