Models and Satisfiability
نویسنده
چکیده
The article includes schemes of defining by structural induction, and definitions and theorems related to: the set of variables which have free occurrences in a ZF-formula, the set of all valuations of variables in a model, the set of all valuations which satisfy a ZF-formula in a model, the satisfiability of a ZF-formula in a model by a valuation, the validity of a ZF-formula in a model, the axioms of ZF-language, the model of the ZF set theory.
منابع مشابه
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisfiability problems in arbitrary and in infinite models, respectively. We exhibit a theory T1 such that satisfiability is decidable, but satisfiability in infinite models is undecidable. It follows that satisfiability in T1 ∪ T2 is undecidable, ...
متن کاملStory Understanding Through Multi-Representation Model Construction
We present an implemented model of story understanding and apply it to the understanding of a children’s story. We argue that understanding a story consists of building multirepresentation models of the story and that story models are efficiently constructed using a satisfiability solver. We present a computer program that contains multiple representations of commonsense knowledge, takes a narr...
متن کاملFault Tolerant Boolean Satisfiability
A δ-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying assignments represent robust solutions to optimization problems (e.g., scheduling) where it is possible to recover from unforeseen events (e.g., a resource becoming...
متن کاملTableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic
We study the multiagent epistemic logic CMAEL(CD) with operators for common and distributed knowledge for all coalitions of agents. We introduce Hintikka structures for this logic and prove that satisfiability in such structures is equivalent to satisfiability in standard models. Using this result, we design an incremental tableau based decision procedure for testing satisfiability in CMAEL(CD).
متن کاملDoes Treewidth Help in Modal Satisfiability? - (Extended Abstract)
Many tractable algorithms for solving the Constraint Satisfaction Problem (Csp) have been developed using the notion of the treewidth of some graph derived from the input Csp instance. In particular, the incidence graph of the Csp instance is one such graph. We introduce the notion of an incidence graph for modal logic formulae in a certain normal form. We investigate the parameterized complexi...
متن کاملA Does Treewidth Help in Modal Satisfiability?
Many tractable algorithms for solving the Constraint Satisfaction Problem (Csp) have been developed using the notion of the treewidth of some graph derived from the input Csp instance. In particular, the incidence graph of the Csp instance is one such graph. We introduce the notion of an incidence graph for modal logic formulas in a certain normal form. We investigate the parameterized complexi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989