athir al-din abhari is one of the most outstanding logicians of the islamic period, even though he is less known to contemporary scholars than other logicians. this article, by presenting an edition of al-risalat al-zahirah (the shining treatise), not only makes available for the first time in print an important text in the field of logic, but also surveys some of abhari's logical thought ...

Classical logic is unfortunately defective with its problematic definition of implication relation, the “material implication”. This work presents a corrected definition of implication relation to replace material implication in classical logic. Common “paradoxes” of material implication are avoided while simplicity and usefulness of the system are reserved with this definition of implication r...

Monolithic three-dimensional integration of memory and logic circuits could dramatically improve performance and energy efficiency of computing systems. Some conventional and emerging memories are suitable for vertical integration, including highly scalable metaloxide resistive switching devices (“memristors”), yet integration of logic circuits proves to be much more challenging. Here we demons...

Considering different implication operators, such as Lukasiewicz, Gödel or product implication in the same logic program, naturally leads to the allowance of several adjoint pairs in the lattice of truthvalues. In this paper we apply this idea to introduce multi-adjoint logic programs as an extension of monotonic logic programs. The continuity of the immediate consequences operators is proved a...

The new …eld of judgment aggregation aims to …nd collective judgments on logically interconnected propositions. Recent impossibility results establish limitations on the possibility to vote independently on the propositions. I show that, fortunately, the impossibility results do not apply to a wide class of realistic agendas once propositions like “if a then b” are adequately modelled, namely a...

The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner’s Theorem remains valid when we restrict the language to the strict implication fragment, and that the same holds for Hemaspaandra’s Theorem. As a consequence we have that the validity problem for most standard normal modal logics is the same ...

This paper focuses on the robustness problem of full implication triple implication inference method for fuzzy reasoning. First of all, based on strong regular implication, the weighted logic metric for measuring distance between two fuzzy sets is proposed. Besides, under this metric, some robustness results of the triple implication method are obtained, which demonstrates that the triple impli...

We propose a constructive discursive logic with strong negation CDLSN based on Nelson’s constructive logic N as a constructive version of Jaśkowski’s discursive logic. In CDLSN, discursive negation is defined similar to intuitionistic negation and discursive implication is defined as material implication using discursive negation. We give an axiomatic system and Kripke semantics with a complete...

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

We introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. More precisely, some deduction problems that are P-complete for classical logic programs are shown to be co-NP-complete for probabilistic many-v...