On the finite model property for Kripke models
نویسندگان
چکیده
منابع مشابه
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...
متن کاملComplexity of Model Checking for Logics over Kripke models
Mathematical logic and computational complexity have close connections that can be traced to the roots of computability theory and the classical decision problem. In the context of complexity, some well-known fundamental problems are: satisfiability testing of formulas (in some logic), proof complexity, and the complexity of checking if a given model satisfies a given formula. The Model Checkin...
متن کاملA Finite Model Property for Intersection Types
We show that the relational theory of intersection types known as BCD has the finite model property; that is, BCD is complete for its finite models. Our proof uses rewriting techniques which have as an immediate by-product the polynomial time decidability of the preorder ⊆ (although this also follows from the so called beta soundness of BCD). BCD is the relational theory of intersection types p...
متن کاملAncestral Kripke Models and Nonhereditary Kripke Models for the Heyting Propositional Calculus
This is a sequel to two previous papers, where it was shown that, for the Heyting propositional calculus H, we can give Kripke-style models whose accessibility relation R need not be a quasi-ordering relation, provided we have: x\=A &Vy(xRy=* y VA). From left to right, this is the heredity condition of standard Kripke models for H, but, since R need not be reflexive, the converse is not automat...
متن کاملKripke Models for Classical Logic
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications of the Research Institute for Mathematical Sciences
سال: 1971
ISSN: 0034-5318
DOI: 10.2977/prims/1195193783