In this paper, we show that the predicate logics of consistent extensions of Heyting’s Arithmetic plus Church’s Thesis with uniqueness condition are complete II0/2. Similarly, we show that the predicate logic of HA*, i.e. Heyting’s Arithmetic plus the Completeness Principle (for HA*) is complete II0/2. These results extend the known results due to Valery Plisko. To prove the results we adapt Plisko’s method to use Tennenbaum’s Theorem to prove ‘categoricity of interpretations’ under certain assumptions
We investigate the modal logic of interpretability over Peano arithmetic (PA). Our main result is a...
This paper is concerned with the `logical structure' of arithmetical theories. We survey result...
Proofs and countermodels are the two sides of completeness proofs, but, in general, failure to find ...
AbstractIn this paper extensions of HA are studied that prove their own completeness, i.e. they prov...
In this paper we experiment with a rather general notion of “interpretation in constructive arithmet...
A constructive proof of the semantic completeness of intuitionistic predicate logic is explored usin...
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...
This paper considers Kripke completeness of Nelson’s constructive predicate logic N3 and its several...
This paper is concerned with the 'logical structure' of arithmetical theories. We survey results con...
In this paper, we study the provability logic of intuitionistic theories of arithmetic that prove th...
In this paper, we study the provability logic of intuitionistic theories of arithmetic that prove th...
AbstractIn this paper extensions of HA are studied that prove their own completeness, i.e. they prov...
We investigate the modal logic of interpretability over Peano arithmetic (PA). Our main result is a...
This paper is concerned with the `logical structure' of arithmetical theories. We survey result...
Proofs and countermodels are the two sides of completeness proofs, but, in general, failure to find ...
AbstractIn this paper extensions of HA are studied that prove their own completeness, i.e. they prov...
In this paper we experiment with a rather general notion of “interpretation in constructive arithmet...
A constructive proof of the semantic completeness of intuitionistic predicate logic is explored usin...
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...
This paper considers Kripke completeness of Nelson’s constructive predicate logic N3 and its several...
This paper is concerned with the 'logical structure' of arithmetical theories. We survey results con...
In this paper, we study the provability logic of intuitionistic theories of arithmetic that prove th...
In this paper, we study the provability logic of intuitionistic theories of arithmetic that prove th...
AbstractIn this paper extensions of HA are studied that prove their own completeness, i.e. they prov...
We investigate the modal logic of interpretability over Peano arithmetic (PA). Our main result is a...
This paper is concerned with the `logical structure' of arithmetical theories. We survey result...
Proofs and countermodels are the two sides of completeness proofs, but, in general, failure to find ...