On propositional definability
نویسندگان
چکیده
منابع مشابه
On propositional definability
In standard propositional logic, logical definability is the ability to derive the truth value of some propositional symbols given a propositional formula and the truth values of some propositional symbols. Although appearing more or less informally in various AI settings, a computation-oriented investigation of the notion is still lacking, and this paper aims at filling the gap. After recallin...
متن کاملUniform Definability in Propositional Dependence Logic
Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula in the language of inquisitive logic with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a formula in the language of propositional dependence logic without these two connectives. We show that although such a (noncompositional) transl...
متن کاملTwo Forms of Dependence in Propositional Logic: Controllability and Definability
We investigate two forms of dependence between variables and/or formulas within a propositional knowledge base: controllability (a set of variables X controls a formula if there is a way to fix the truth value of the variables in X in order to achieve to have a prescribed truth value) and definability (X defines a variable y if every truth assignment of the variables inX enables us finding out ...
متن کاملNote on Supervenience and Definability
The idea of a property’s being supervenient on a class of properties is familiar from much philosophical literature. We give this idea a linguistic turn by converting it into the idea of a predicate symbol’s being supervenient on a set of predicate symbols relative to a (first order) theory. What this means is that according to the theory, any individuals differing in respect to whether the giv...
متن کاملOn Definability in Dependence Logic
We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable bymeans of identity only in dependence logic, or equivalently in independence friendly logic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2008
ISSN: 0004-3702
DOI: 10.1016/j.artint.2007.12.003