This is a survey paper of approaches to the concept of logical implication. Roughly stated the main motivation of these approaches is to provide a necessary and sufficient condition for a set of propositions to logically imply a single proposition. In regard to their affinities these approaches are grouped into two: the transformational conception and the informational conception. Some approach...

One of the most prominent approaches in Inductive Logic Programming is the use of least generalizations under subsumption of given clauses. However, subsumption is weaker than logical implication, and not very well suited for handling recursive clauses. Therefore an important open question in this area concerns the existence of least generalizations under implication (LGIs). Our main new result...

This paper deals with learning implication relations from some kinds of knowledge (statistical studies, possibilistic information or possible worlds) about truth valuations on a set of propositions. An induction principle is considered in each one of this cases. If only the possible valuations are known, then it is checked when two families of possible valuations produce the same implication. A...

We involve a certain propositional logic based on an ortholattice. We characterize the implication reduct of such a logic and show that its algebraic counterpart is the so-called orthosemilattice. Properties of congruences and congruence kernels of these algebras are described.

We propose a “cryptographic” interpretation for the propositional connectives of primal infon logic introduced by Y. Gurevich and I. Neeman and prove the corresponding soundness and completeness results. Primal implication φ→p ψ corresponds to the encryption of ψ with a secret key φ, primal disjunction φ ∨p ψ is a group key and ⊥ reflects some backdoor constructions such as full superuser permi...

We investigate fragments of intuitionistic propositional logic containing implication but not disjunction. These fragments are finite, but their size grows superexponentially with the number of generators. Exact models are used to characterize the fragments.

In this tutorial, I will discuss the concepts behind generalizing ordering to measuring and apply these ideas to the derivation of probability theory. The fundamental concept is that anything that can be ordered can be measured. Since we are in the business of making statements about the world around us, we focus on ordering logical statements according to implication. This results in a Boolean...

the aim of this paper is to introduce the notions of ($epsilon, epsilon vee q$)-fuzzy p-ideals, ($epsilon, epsilon vee q$)-fuzzy q-ideals and ($epsilon, epsilon vee q$)-fuzzy a-ideals in bcialgebras and to investigate some of their properties. several characterizationtheorems for these generalized fuzzy ideals are proved and the relationshipamong these generalized fuzzy ideals of bci-algebras i...

In this paper we investigate the fragment of intuitionistic logic which only uses conjunction (meet) and implication, using finite duality for distributive lattices and universal models. We give a description of the finitely generated universal models of this fragment and give a complete characterization of the up-sets of Kripke models of intuitionistic logic which can be defined by meet-implic...

A comparative study of the implication functions and t-norms behavior when they are used as implication operators in the fuzzy control inference process is carried out in this paper. In order to do it, the widely studied application of the Inverted Pendulum is considered. Moreover, a comparison methodology of the different fuzzy logic controllers designed is defined with the purpose of get more...