Abstract In 2016, Béziau introduces a restricted notion of paraconsistency, the so-called genuine paraconsistency. A logic is paraconsistent if it rejects laws $\varphi ,\neg \varphi \vdash \psi $ and $\vdash \neg (\varphi \land )$. that paper, author analyzes, among three-valued logics, which them satisfy this property. If we consider multiple-conclusion consequence relations, dual properties ...

In order to define some interesting consequence relations, certain generalizations have been proposed in a many-valued semantic setting that useful for defining what called pure, mixed and ordertheoretic relations. But these are insufficient capture other like intersective relations (a relation cannot be defined as relation, but only the intersection of two relations) or with conjunctive (or, b...

Article history: Received 17 November 2013 Received in revised form 25 May 2014 Accepted 25 May 2014 Available online xxxx This paper aims to deepen our understanding of the mechanisms underlying the mutual constitution of competing institutional logics and sociomaterial entanglements by combining a sociomaterial lens with the institutional logics perspective. We present findings from an interp...

The research adopts a multivocal and multilevel institutionalist perspective to analyze information technology-enabled change into the structures of the public service in Africa as reflected in changes of practices around information processing. Information systems scripts and guidelines are considered as vocal to new logics of public service (e.g., new public management) imported into the loca...

Several justification logics have evolved, starting with the logic LP, [2]. These can be thought of as explicit versions of modal logics, or logics of knowledge or belief in which the unanalyzed necessity operator has been replaced with a family of explicit justification terms. Modal logics come in various strengths. For their corresponding justification logics, differing strength is reflected ...

We consider certain infectious logics (Sfde, dSfde, K3w, and PWK) several their non-infectious modifications, including two new logics, reformulate previously constructed natural deduction systems for them (or present such from scratch the case of logics) in way that proof normalisation theorem becomes possible these logics. a establish negation subformula property question.

Several justification logics have evolved, starting with the logic LP, [2]. These can be thought of as explicit versions of modal logics, or logics of knowledge or belief in which the unanalyzed necessity operator has been replaced with a family of explicit justification terms. Modal logics come in various strengths. For their corresponding justification logics, differing strength is reflected ...

Several justification logics have evolved, starting with the logic LP, (Artemov 2001). These can be thought of as explicit versions of modal logics, or logics of knowledge or belief, in which the unanalyzed necessity (knowledge, belief) operator has been replaced with a family of explicit justification terms. Modal logics come in various strengths. For their corresponding justification logics, ...

Logics of quasiary predicates are algebra-based logics constructed in a semantic-syntactic style on the methodological basis, which is common with programming. Such way of construction gives a possibility to use these logics in formal methods of software development. We demonstrate the main ideas of program logic construction and give formal definitions for an important fragment of program logi...