Abstract The class of pseudo-M algebras contains pseudo-BCK, pseudo-BCI, pseudo-BCH, pseudo-BE, pseudo-CI and many other logic. In this paper, the notion deductive system in a algebra is introduced its elementary properties are investigated. Closed systems defined studied. homomorphic (closed) provided. concepts translation R-congruences It shown that there bijection between closed R-congruence...

Dong, F. and L.V.S. Lakshmanan, Intuitionistic interpretation of deductive databases with incomplete information, Theoretical Computer Science 133 (1994) 267-306. The aim of this paper is to build the relationship between deductive databases with incomplete information and hypothetical reasoning using embedded implications. We first consider the semantics of deductive databases with incomplete ...

Abstract Sahlqvist theory is extended to the fragments of intuitionistic propositional calculus that include conjunction connective. This allows us introduce a character amenable arbitrary protoalgebraic deductive systems. As an application, we obtain theorem for implication connective and extensions linear logic.

Oaksford, Chater, and Larkin (2000) have suggested that people actually use everyday probabilistic reasoning when making deductive inferences. In two studies, we explicitly compared probabilistic and deductive reasoning with identical if-then conditional premises with concrete content. In the first, adults were given causal premises with one strongly associated antecedent and were asked to make...

this study investigated the relative effects of deductive and inductive form-focused instruction (ffi) on the acquisition of 4 non-generic definite article uses(cultural, situational, structural, and textual) as assessed by explicit and implicit outcome measures. the tests utilized to assess efl learners' acquisition of definite article uses were timed and untimed grammaticality judgment t...