منابع مشابه
Display Calculi for Nominal Tense Logics
We define display calculi for nominal tense logics extending the minimal nominal tense logic ( ) by addition of primitive axioms. To do so, we use the natural translation of into the minimal tense logic of inequality ( ) which is known to be properly displayable by application of Kracht’s results. The rules of the display calculus Æ for mimic those of the display calculus Æ for . We show that e...
متن کاملSymbolic Model Checking of Tense Logics on Rational Kripke Models
We introduce the class of rational Kripke models and study symbolic model checking of the basic tense logic Kt and some extensions of it in models from that class. Rational Kripke models are based on (generally infinite) rational graphs, with vertices labeled by the words in some regular language and transitions recognized by asynchronous two-head finite automata, also known as rational transdu...
متن کاملBasic Model Theory for Memory Logics
Memory logics is a family of modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent a memory. The logical language includes a collection of operations to access and modify the data structure. In this paper we study basic model properties of memory logics, and prove results concerning characterization, definability and interpo...
متن کاملFrank Wolter DECIDABILITY OF TENSE LOGICS
transitivity = 2p → 22p, and the axioms for linearity .3 fomulated for both 2 and 2−. Here we call normal extensions of Lin.t simply tense logics. There is a sequence of papers on uni-modal logics of weak orderings. Probably the first one is the famous result of R. Bull [1] that all extensions of S4.3 have the fmp. Then K. Fine [3] proved that all extensions of K4.3 are complete, and recently M...
متن کاملBDD-Based Automated Reasoning for Propositional Bi-Intuitionistic Tense Logics
We give Binary Decision Diagram (BDD) based methods for deciding validity and satisfiability of propositional Intuitionistic Logic Int and Bi-intuitionistic Tense Logic BiKt. We handle intuitionistic implication and bi-intuitionistic exclusion by treating them as modalities, but the move to an intuitionistic basis requires careful analysis for handling the reflexivity, transitivity and antisymm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematical Logic
سال: 1975
ISSN: 0003-4843
DOI: 10.1016/0003-4843(75)90003-0