1,091 research outputs found

    On existential declarations of independence in IF Logic

    Full text link
    We analyze the behaviour of declarations of independence between existential quantifiers in quantifier prefixes of IF sentences; we give a syntactical criterion for deciding whether a sentence beginning with such prefix exists such that its truth values may be affected by removal of the declaration of independence. We extend the result also to equilibrium semantics values for undetermined IF sentences. The main theorem allows us to describe the behaviour of various particular classes of quantifier prefixes, and to prove as a remarkable corollary that all existential IF sentences are equivalent to first-order sentences. As a further consequence, we prove that the fragment of IF sentences with knowledge memory has only first-order expressive power (up to truth equivalence)

    Some observations about generalized quantifiers in logics of imperfect information

    Get PDF
    We analyse the two definitions of generalized quantifiers for logics of dependence and independence that have been proposed by F. Engstrom. comparing them with a more general, higher order definition of team quantifier. We show that Engstrom's definitions (and other quantifiers from the literature) can be identified, by means of appropriate lifts, with special classes of team quantifiers. We point out that the new team quantifiers express a quantitative and a qualitative component, while Engstrom's quantifiers only range over the latter. We further argue that Engstrom's definitions are just embeddings of the first-order generalized quantifiers into team semantics. and fail to capture an adequate notion of team-theoretical generalized quantifier, save for the special cases in which the quantifiers are applied to flat formulas. We also raise several doubts concerning the meaningfulness of the monotone/nonmonotone distinction in this context. In the appendix we develop some proof theory for Engstrom's quantifiers.Peer reviewe

    Decidability of predicate logics with team semantics

    Get PDF
    We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIME-complete. Furthermore, we show that the validity problem of two-variable dependence logic is undecidable, thereby solving an open problem from the team semantics literature. We also briefly analyse the complexity of the Bernays-Sch\"onfinkel-Ramsey prefix classes of dependence logic.Comment: Extended version of a MFCS 2016 article. Changes on the earlier arXiv version: title changed, added the result on validity of two-variable dependence logic, restructurin

    Team Semantics and Recursive Enumerability

    Full text link
    It is well known that dependence logic captures the complexity class NP, and it has recently been shown that inclusion logic captures P on ordered models. These results demonstrate that team semantics offers interesting new possibilities for descriptive complexity theory. In order to properly understand the connection between team semantics and descriptive complexity, we introduce an extension D* of dependence logic that can define exactly all recursively enumerable classes of finite models. Thus D* provides an approach to computation alternative to Turing machines. The essential novel feature in D* is an operator that can extend the domain of the considered model by a finite number of fresh elements. Due to the close relationship between generalized quantifiers and oracles, we also investigate generalized quantifiers in team semantics. We show that monotone quantifiers of type (1) can be canonically eliminated from quantifier extensions of first-order logic by introducing corresponding generalized dependence atoms

    The Doxastic Interpretation of Team Semantics

    Full text link
    We advance a doxastic interpretation for many of the logical connectives considered in Dependence Logic and in its extensions, and we argue that Team Semantics is a natural framework for reasoning about beliefs and belief updates

    Characterizing downwards closed, strongly first order, relativizable dependencies

    Full text link
    In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First Order Logic is equivalent to some first order sentence. In this work it is shown that all nontrivial dependency atoms that are strongly first order, downwards closed, and relativizable (in the sense that the relativizations of the corresponding atoms with respect to some unary predicate are expressible in terms of them) are definable in terms of constancy atoms. Additionally, it is shown that any strongly first order dependency is safe for any family of downwards closed dependencies, in the sense that every sentence of the logic obtained by adding to First Order Logic both the strongly first order dependency and the downwards closed dependencies is equivalent to some sentence of the logic obtained by adding only the downwards closed dependencies
    • …
    corecore