Add to ORKGWe characterize the closed fragment of the provability logic of ΙΔo+EXP with a propositional constant for EXP. In three appendices the details of various results in Arithmetic needed for our characterization are provide
LP⊃,F is a three-valued paraconsistent propositional logic that is essentially the same as J3. It ha...
We present a simplified proof of Japaridze’s arithmetical completeness theorem for the well-known po...
This thesis is a study of nonstandard provability predicates for Peano Arithmetic (PA). By a nonstan...
In this paper we give a new proof of the characterization of the closed fragment of the provability...
We study a propositional polymodal provability logic GLP introduced by G. Japaridze. The previous t...
We study a propositional polymodal provability logic GLP introduced by G. Japaridze. The previous t...
AbstractLet PLω be the provability logic of IΔ0 + ω1. We prove some containments of the form L⊆PLω⊥h...
In this paper we characterize the closed fragment of the enriched probability logic of PRA and call ...
In this paper we characterize the closed fragment of the enriched probability logic of PRA and call ...
AbstractLet PLω be the provability logic of IΔ0 + ω1. We prove some containments of the form L⊆PLω⊥h...
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...
The logic iGLC is the intuitionistic version of Löb's Logic plus the completeness principle A→□A. In...
AbstractIn this paper extensions of HA are studied that prove their own completeness, i.e. they prov...
LP⊃,F is a three-valued paraconsistent propositional logic that is essentially the same as J3. It ha...
We present a simplified proof of Japaridze’s arithmetical completeness theorem for the well-known po...
This thesis is a study of nonstandard provability predicates for Peano Arithmetic (PA). By a nonstan...
In this paper we give a new proof of the characterization of the closed fragment of the provability...
We study a propositional polymodal provability logic GLP introduced by G. Japaridze. The previous t...
We study a propositional polymodal provability logic GLP introduced by G. Japaridze. The previous t...
AbstractLet PLω be the provability logic of IΔ0 + ω1. We prove some containments of the form L⊆PLω⊥h...
In this paper we characterize the closed fragment of the enriched probability logic of PRA and call ...
In this paper we characterize the closed fragment of the enriched probability logic of PRA and call ...
AbstractLet PLω be the provability logic of IΔ0 + ω1. We prove some containments of the form L⊆PLω⊥h...
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...
The logic iGLC is the intuitionistic version of Löb's Logic plus the completeness principle A→□A. In...
AbstractIn this paper extensions of HA are studied that prove their own completeness, i.e. they prov...
LP⊃,F is a three-valued paraconsistent propositional logic that is essentially the same as J3. It ha...
We present a simplified proof of Japaridze’s arithmetical completeness theorem for the well-known po...
This thesis is a study of nonstandard provability predicates for Peano Arithmetic (PA). By a nonstan...