Rough Consequence and other Modal Logics

نویسندگان

چکیده

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

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

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

منابع مشابه

Generalization of Rough Sets using Modal Logics

The theory of rough sets is an extension of set theory with two additional unary set-theoretic operators deened based on a binary relation on the universe. These two operators are related to the modal operators in modal logics. By exploring the relationship between rough sets and modal logics, this paper proposes and examines a number of extended rough set models. By the properties satissed by ...

متن کامل

Rough Relations and Logics

In this chapter we discuss properties and applications of rough relations. We also investigate two types of logics in which one can express and prove properties of rough relations.

متن کامل

Rough and Modal Algebras

We have used here a theorem prover DATAC (DDduction Automatique dans des Thhories Associatives et Commu-tatives) to discover, study and compare properties of rough and corresponding modal algebras. The preliminary results were reported in 19]. The prover was developed at CRIN & INRIA Lorraine, Nancy (France), by the rst author. The rough algebras were introduced by the second author in 17] as a...

متن کامل

Bisimulation and Modal Logics

Modal logic is a family of logics for reasoning about modalities. For example, given a sentence φ, one may wish to express statements such as “φ is necessarily true” or “φ is possibly true”. Modalities are expressed using modal operators. In the most basic modal logic, called propositional modal logic, one may use the operators 2 and 3 to formalize the above two statements as 2φ and 3φ. In this...

متن کامل

Modal Consequence Relations

Logic is generally defined as the science of reasoning. Mathematical logic is mainly concerned with forms of reasoning that lead from true premises to true conclusions. Thus we say that the argument from σ0;σ1; · · · ;σn−1 to δ is logically correct if whenever σi is true for all i < n, then so is δ. In place of ‘argument’ one also speaks of a ‘rule’ or an ‘inference’ and says that the rule is v...

متن کامل

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


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

ژورنال

عنوان ژورنال: The Australasian Journal of Logic

سال: 2015

ISSN: 1448-5052

DOI: 10.26686/ajl.v12i1.2194