K-admissibility of A6 and A7

نویسندگان
چکیده

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

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

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

منابع مشابه

Admissibility and Event-rationality Admissibility and Event-rationality

We develop an approach to providing epistemic conditions for admissible behavior in games. Instead of using lexicographic beliefs to capture infinitely less likely conjectures, we postulate that players use tie-breaking sets to help decide among strategies that are outcome-equivalent given their conjectures. A player is event-rational if she best responds to a conjecture and uses a list of subs...

متن کامل

Inference Rules in Nelson's Logics, Admissibility and Weak Admissibility

Our paper aims to investigate inference rules for Nelson’s logics and to discuss possible ways to determine admissibility of inference rules in such logics. We will use the technique offered originally for intuitionistic logic and paraconsistent minimal Johannson’s logic. However, the adaptation is not an easy and evident task since Nelson’s logics do not enjoy replacement of equivalences rule....

متن کامل

Exact Unification and Admissibility

A new hierarchy of “exact” unification types is introduced, motivated by the study of admissible rules for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by instantiation, but rather by inclusion over the corresponding sets of unified identities. Minimal complete sets of unifiers under this new preordering always h...

متن کامل

⊤⊤-closed relations and admissibility

While developing a method for reasoning about programs, Pitts defined the ⊤⊤-closed relations as an alternative to the standard admissible relations. This paper reformulates and studies Pitts’s operational concept of ⊤⊤-closure in a semantic framework. It investigates the nontrivial connection between ⊤⊤-closure and admissibility, showing that ⊤⊤-closure is strictly stronger than admissibility ...

متن کامل

Admissibility and common belief

The concept of ‘fully permissible sets’ is defined by an algorithm that eliminates strategy subsets. It is characterized as choice sets when there is common certain belief of the event that each player prefer one strategy to another if and only if the former weakly dominates the latter on the set of all opponent strategies or on the union of the choice sets that are deemed possible for the oppo...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1992

ISSN: 0021-8693

DOI: 10.1016/0021-8693(92)90106-v