Proving that two programs are contextually equivalent is notoriously hard, particularly for functional languages with references (i.e., local states). Many operational techniques have been designed to prove such equivalences, and fully abstract denotational model, using game semantics, have been built for such languages. In this work, we marry ideas coming from trace semantics, an operational v...

We introduce e ectiveness considerations into model theory of intuitionistic logic. We investigate e ectiveness of completeness (by Kripke) results for intermediate logics such as for example, intuitionistic logic, classical logic, constant domain logic, directed frames logic, Dummett's logic, etc.

comparing the performance of a set of activities or organizations under uncertainty environment has been performed by means of fuzzy data envelopment analysis (fdea) since the traditional dea models require accurate and precise performance data. as regards a method for dealing with uncertainty environment, many researchers have introduced dea models in fuzzy environment. some of these models ar...

The stable model semantics has become a dominating approach for the management of negation in logic programming. It relies mainly on the closed world assumption to complete the available knowledge and its formulation has its founding root in the so-called Gelfond-Lifschitz transform. The primary goal of this work is to present an alternative and epistemic based characterization of the stable mo...

We introduce three relations between models of Peano Arithmetic (PA), each of which is characterized as an arithmetical accessibility relation. A relation R is said to be an arithmetical accessibility relation if for any modelM of PA,M Prπ(φ) iffM′ φ for allM′ withM RM′, where Prπ(x) is an intensionally correct provability predicate of PA. The existence of arithmetical accessibility relations y...

Goldblatt and Thomason’s theorem on modally definable classes of Kripke frames and Venema’s theorem on modally definable classes of Kripke models are generalised to coalgebras.

Usually, in the Kripke semantics for intuitionistic propositional logic (or for superintuitionistic logics) partially ordered frames are used. Why? In this paper we propose an intrinsically intuitionistic motivation for that. Namely, we show that every Kripke frame (with an arbitrary accessibility relation), whose set of valid formulas is a superintuitionistic logic, is logically equivalent to ...