Abstract Kripke Semantics

نویسنده

  • Yanjing Wang
چکیده

Kripke Semantics Yanjing Wang (Amsterdam) In this paper, we give a schema of non-standard Kripke semantics for modal logic, in which the meaning of a modality in a formula depends on the evaluation process of that formula. More precisely, in our semantics schema, the truth condition for a sub-formula [] A of B depends on the path of worlds we passed in the evaluation of B and the position of []_i in Á with respect to other modal operators. We show that this abstract semantics schema can unify several non-standard Kripke semantics developed recently for different purposes in a single form. Important instances include mode-shifting semantics of hypermodal logic in [Gab02], the centered semantics and the more general n-token semantics in [BE06], indexed semantics in [Wan06], and the arc semantics in [Gab04]. From those instances, we can see that by introducing the context-dependent truth condition of modal formulas, we can characterize some phenomena in real-life reasoning. For example, as characterized in [BE06] and [Wan06], people may have \upper bounds" or limits of imaginations" in understanding and reasoning about the higher-order information represented by the sentences with nested modalities. There are many common features shared by the semantics in our schema. For instance, our approach suggests that we could make the representation of model simpler by encoding more \instructions" in the semantics. We discuss those features and provide general results and tools to study any semantics based on our schema.

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

ثبت نام

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

منابع مشابه

Ultraproducts and possible worlds semantics in institutions

We develop possible worlds (Kripke) semantics at the categorical abstract model theoretic level provided by the so-called ‘institutions’. Our general abstract modal logic framework provides a method for systematic Kripke semantics extensions of logical systems from computing science and logic. We also extend the institution-independent method of ultraproducts of [R. Diaconescu, Institution-inde...

متن کامل

Kripke Open Bisimulation - A Marriage of Game Semantics and Operational Techniques

Proving that two programs are contextually equivalent is notoriously hard, particularly for functional languages with references (i.e., local states). Many operational techniques have been designed to prove such equivalences, and fully abstract denotational model, using game semantics, have been built for such languages. In this work, we marry ideas coming from trace semantics, an operational v...

متن کامل

Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models

The semantics of Statecharts macro steps, as introduced by Pnueli and Shalev, lacks compositionality. This paper rst analyzes the compositionality problem and traces it back to the invalidity of the Law of the Excluded Middle. It then characterizes the semantics via a particular class of linear, intuitionistic Kripke models, namely stabilization sequences. This yields, for the rst time in the l...

متن کامل

Kripke Logical Relations and PCF

Sieber has described a model of PCF consisting of continuous functions that are invariant under certain ((nitary) logical relations, and shown that it is fully abstract for closed terms of up to third-order types. We show that one may achieve full abstraction at all types using a form of \Kripke logical relations" introduced by Jung and Tiuryn to characterize-deenability.

متن کامل

Abstract Model Repair

Model Repair George Chatzieleftheriou, Borzoo Bonakdarpour, Scott A. Smolka, and Panagiotis Katsaros 1 Department of Informatics, Aristotle University of Thessaloniki 54124 Thessaloniki, Greece 2 School of Computer Science, University of Waterloo 200 University Avenue West Waterloo N2L3G1, Canada 3 Department of Computer Science, Stony Brook University Stony Brook, NY 11794-4400, USA Abstract. ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006