AbstractIn this paper we introduce effectiveness into model theory of intuitionistic logic. The main result shows that any computable theory T of intuitionistic predicate logic has a Kripke model with decidable forcing such that for any sentence φ, φ is forced in the model if and only if φ is intuitionistically deducible from T
We introduce a version of operational set theory, OST−, without a choice operation, which has a mach...
In this thesis, we explore three aspects of the computational content of proofs. These are: a compu...
Motivated by facilitating reasoning with logical meta-theory inside the Coq proof assistant, we inve...
AbstractWe introduce effectiveness considerations into model theory of intuitionistic logic. We inve...
This paper presents a constructive proof of completeness of Kripke models for the intuitionistic pr...
We present a technique to extend a Kripke structure (for intuitionistic logic) into an elementary ex...
AbstractWe initiate the study of computable model theory of modal logic, by proving effective comple...
A Kripke model K is a submodel of another Kripke model M if K is obtained by restricting the set of ...
We investigate the complexity of the model checking problem forintuitionistic and modal propositiona...
Weakening the conditions on the Kripke semantics for propositional intuitionistic logic (J) unearths...
Let T be a first-order theory. A T-normal Kripke structure is one in which every world is a classica...
This thesis is a study of intuitionistic semantics as presented by Beth [2] and Kripke [12], using t...
Abstract. We investigate the complexity of the model checking problem for intuitionistic and modal p...
International audienceIn this paper we demonstrate decidability for the intuitionistic modal logic S...
AbstractWe introduce a notion of the Kripke model for classical logic for which we constructively pr...
We introduce a version of operational set theory, OST−, without a choice operation, which has a mach...
In this thesis, we explore three aspects of the computational content of proofs. These are: a compu...
Motivated by facilitating reasoning with logical meta-theory inside the Coq proof assistant, we inve...
AbstractWe introduce effectiveness considerations into model theory of intuitionistic logic. We inve...
This paper presents a constructive proof of completeness of Kripke models for the intuitionistic pr...
We present a technique to extend a Kripke structure (for intuitionistic logic) into an elementary ex...
AbstractWe initiate the study of computable model theory of modal logic, by proving effective comple...
A Kripke model K is a submodel of another Kripke model M if K is obtained by restricting the set of ...
We investigate the complexity of the model checking problem forintuitionistic and modal propositiona...
Weakening the conditions on the Kripke semantics for propositional intuitionistic logic (J) unearths...
Let T be a first-order theory. A T-normal Kripke structure is one in which every world is a classica...
This thesis is a study of intuitionistic semantics as presented by Beth [2] and Kripke [12], using t...
Abstract. We investigate the complexity of the model checking problem for intuitionistic and modal p...
International audienceIn this paper we demonstrate decidability for the intuitionistic modal logic S...
AbstractWe introduce a notion of the Kripke model for classical logic for which we constructively pr...
We introduce a version of operational set theory, OST−, without a choice operation, which has a mach...
In this thesis, we explore three aspects of the computational content of proofs. These are: a compu...
Motivated by facilitating reasoning with logical meta-theory inside the Coq proof assistant, we inve...
DOI
Add to ORKG