3 research outputs found
Modalities as interactions between the classical and the intuitionistic logics
We give an equivalent formulation of topological algebras, interpreting S4, as boolean algebras equipped with intuitionistic negation. The intuitionistic substructure—Heyting algebra—of such an algebra can be then seen as an “epistemic subuniverse”, and modalities arise from the interaction between the intuitionistic and classical negations or, we might perhaps say, between the epistemic and the ontological aspects: they are not relations between arbitrary alternatives but between intuitionistic substructures and one common world governed by the classical (propositional) logic. As an example of the generality of the obtained view, we apply it also to S5. We give a sound, complete and decidable sequent calculus, extending a classical system with the rules for handling the intuitionistic negation, in which one can prove all classical, intuitionistic and S4 valid sequents
Decidability of admissibility:On a problem by friedman and its solution by rybakov
Rybakov (1984) proved that the admissible rules of IPC are decidable. We give a proof of the same theorem, using the same core idea, but couched in the many notions that have been developed in the mean time. In particular, we illustrate how the argument can be interpreted as using refinements of the notions of exactness and extendibility
Nonclassical Probability and Convex Hulls
It is well known that the convex hull of the classical truth value functions contains all and only the probability functions. Work by Paris and Williams has shown that this also holds for various kinds of nonclassical logics too. This note summarises the formal details of this topic and extends the results slightly