Empirical Negation, Co-negation and Contraposition Rule I: Semantical Investigations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More on Empirical Negation

Intuitionism can be seen as a verificationism restricted to mathematical discourse. An attempt to generalize intuitionism to empirical discourse presents various challenges. One of those concerns the logical and semantical behavior of what has been called ‘empirical negation’. An extension of intuitionistic logic with empirical negation was given by Michael De and a labelled tableaux system was...

متن کامل

Classical and Empirical Negation in Subintuitionistic Logic

Subintuitionistic (propositional) logics are those in a standard intuitionistic language that result by weakening the frame conditions of the Kripke semantics for intuitionistic logic. In this paper we consider two negation expansions of subintuitionistic logic, one by classical negation and the other by what has been dubbed “empirical” negation. We provide an axiomatization of each expansion a...

متن کامل

Rule Learning with Negation: Issues Regarding Effectiveness

An investigation of rule learning processes that allow the inclusion of negated features is described. The objective is to establish whether the use of negation in inductive rule learning systems is effective with respect to classification. This paper seeks to answer this question by considering two issues relevant to such systems; feature identification and rule refinement. Both synthetic and ...

متن کامل

Rule Learning with Negation for Text Classification

Classification rule generators that have the potential to include negated features in their antecedents are generally acknowledged to generate rules that have greater discriminating power than rules without negation. This can be achieved by including the negation of all features as part of the input. However, this is only viable if the number of features is relatively small. There are many appl...

متن کامل

Completeness of the Negation as Failure Rule

Let P be a Horn clause log ic program and comp(p) be i t s completion in the sense of Clark. Clark gave a j u s t i f i c a t i o n fo r the negation as f a i l u r e ru le by showing that if a ground atom A is in the f i n i t e f a i l u r e set of P, then ~A is a l o g i c a l consequence of comp(P), that i s , the negation as f a i l u r e ru le is sound. We prove here that the converse als...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Section of Logic

سال: 2020

ISSN: 2449-836X,0138-0680

DOI: 10.18778/0138-0680.2020.12