DOIAbstract
AbstractLet PLω be the provability logic of IΔ0 + ω1. We prove some containments of the form L⊆PLω⊥h(C) where L is the provability logic of PA and C is a suitable class of Kripke frames
AbstractLet PLω be the provability logic of IΔ0 + ω1. We prove some containments of the form L⊆PLω⊥h(C) where L is the provability logic of PA and C is a suitable class of Kripke frames
We characterize the closed fragment of the provability logic of ΙΔo+EXP with a propositional consta...
The logic iGLC is the intuitionistic version of Löb's Logic plus the completeness principle A→□A. In...
The class of bounded arithmetic predicates (BA) is the smallest class containing the polynomial pred...
AbstractLet PLω be the provability logic of IΔ0 + ω1. We prove some containments of the form L⊆PLω⊥h...
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where mo...
AbstractA well-known polymodal provability logic GLP due to Japaridze is complete w.r.t. the arithme...
In this paper we give a new proof of the characterization of the closed fragment of the provability...
AbstractA well-known polymodal provability logic GLP due to Japaridze is complete w.r.t. the arithme...
Kripke-style semantics is suggested for the provability logic with quantifiers on proofs correspond...
Kripke-style semantics is suggested for the provability logic with quantifiers on proofs correspond...
In this paper we investigate those extensions of the bimodal provability logic C⃗ SM0 (alias P⃗ RL1 ...
In this paper we investigate those extensions of the bimodal provability logic C⃗ SM0 (alias P⃗ RL1 ...
The logic iGLC is the intuitionistic version of Löb's Logic plus the completeness principle A→□A. In...
The logic iGLC is the intuitionistic version of Löb's Logic plus the completeness principle A→□A. In...
The logic iGLC is the intuitionistic version of Löb's Logic plus the completeness principle A→□A. In...
We characterize the closed fragment of the provability logic of ΙΔo+EXP with a propositional consta...
The logic iGLC is the intuitionistic version of Löb's Logic plus the completeness principle A→□A. In...
The class of bounded arithmetic predicates (BA) is the smallest class containing the polynomial pred...
AbstractLet PLω be the provability logic of IΔ0 + ω1. We prove some containments of the form L⊆PLω⊥h...
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where mo...
AbstractA well-known polymodal provability logic GLP due to Japaridze is complete w.r.t. the arithme...
In this paper we give a new proof of the characterization of the closed fragment of the provability...
AbstractA well-known polymodal provability logic GLP due to Japaridze is complete w.r.t. the arithme...
Kripke-style semantics is suggested for the provability logic with quantifiers on proofs correspond...
Kripke-style semantics is suggested for the provability logic with quantifiers on proofs correspond...
In this paper we investigate those extensions of the bimodal provability logic C⃗ SM0 (alias P⃗ RL1 ...
In this paper we investigate those extensions of the bimodal provability logic C⃗ SM0 (alias P⃗ RL1 ...
The logic iGLC is the intuitionistic version of Löb's Logic plus the completeness principle A→□A. In...
The logic iGLC is the intuitionistic version of Löb's Logic plus the completeness principle A→□A. In...
The logic iGLC is the intuitionistic version of Löb's Logic plus the completeness principle A→□A. In...
We characterize the closed fragment of the provability logic of ΙΔo+EXP with a propositional consta...
The logic iGLC is the intuitionistic version of Löb's Logic plus the completeness principle A→□A. In...
The class of bounded arithmetic predicates (BA) is the smallest class containing the polynomial pred...
Add to ORKG