Hamkins and Löwe proved that the modal logic of forcing is S4.2. In this paper, we consider its modal companion, the intermediate logic KC and relate it to the fatal Heyting algebra H ZFC of forcing persistent sentences. This Heyting algebra is equationally generic for the class of fatal Heyting algebras. Motivated by these results, we further analyse the class of fatal Heyting algebras
We examine the notion of bisimulation and its ramifications, in the context of the family of Heyting...
The admissible rules of a logic are those rules under which the set of theorems of the logic is clos...
We consider propositional intuitionistic logic Int and propositional modal logic S4 along with all t...
The variety of Heyting algebras has two well-behaved locally finite reducts, the variety of bounded ...
By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebr...
The variety of Heyting algebras has two well-behaved locally finite reducts, the variety of bounded ...
Every definable forcing class Γ gives rise to a corresponding forcing modality □Γ where □Γφ means th...
Every definable forcing class Γ gives rise to a corresponding forcing modality □Γ where □Γφ means th...
Abstract. It is assumed that a Kripke–Joyal semantics A = 〈C,Cov, F, 〉 has been defined for a first-...
In this paper we define and examine frame constructions for the family of many-valued modal logics i...
We study some operations that may be defined using the minimum operator in the context of a Heyting ...
In this paper four principles and one scheme of the Provability Logic of (intuitionistic) Heyting Ar...
We study some operations that may be defined using the minimum operator in the context of a Heyting ...
We give an algebraic model of (H3) designs of Hoare's and He's Unifying Theories of Programming. It ...
We study some operations that may be defined using the minimum operator in the context of a Heyting ...
We examine the notion of bisimulation and its ramifications, in the context of the family of Heyting...
The admissible rules of a logic are those rules under which the set of theorems of the logic is clos...
We consider propositional intuitionistic logic Int and propositional modal logic S4 along with all t...
The variety of Heyting algebras has two well-behaved locally finite reducts, the variety of bounded ...
By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebr...
The variety of Heyting algebras has two well-behaved locally finite reducts, the variety of bounded ...
Every definable forcing class Γ gives rise to a corresponding forcing modality □Γ where □Γφ means th...
Every definable forcing class Γ gives rise to a corresponding forcing modality □Γ where □Γφ means th...
Abstract. It is assumed that a Kripke–Joyal semantics A = 〈C,Cov, F, 〉 has been defined for a first-...
In this paper we define and examine frame constructions for the family of many-valued modal logics i...
We study some operations that may be defined using the minimum operator in the context of a Heyting ...
In this paper four principles and one scheme of the Provability Logic of (intuitionistic) Heyting Ar...
We study some operations that may be defined using the minimum operator in the context of a Heyting ...
We give an algebraic model of (H3) designs of Hoare's and He's Unifying Theories of Programming. It ...
We study some operations that may be defined using the minimum operator in the context of a Heyting ...
We examine the notion of bisimulation and its ramifications, in the context of the family of Heyting...
The admissible rules of a logic are those rules under which the set of theorems of the logic is clos...
We consider propositional intuitionistic logic Int and propositional modal logic S4 along with all t...
DOI
Add to ORKG