56 research outputs found

    A Simple Logic of Functional Dependence

    Get PDF
    This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more concrete settings for dependence are discussed: continuous dependence in topological models, linear dependence in vector spaces, and temporal dependence in dynamical systems and games.Comment: 56 pages. Journal of Philosophical Logic (2021

    Atoms in infinite dimensional free sequence-set algebras

    Get PDF
    A. Tarski proved that the m-generated free algebra of CAα\mathrm{CA}_{\alpha}, the class of cylindric algebras of dimension α\alpha, contains exactly 2m2^m zero-dimensional atoms, when m≥1m\ge 1 is a finite cardinal and α\alpha is an arbitrary ordinal. He conjectured that, when α\alpha is infinite, there are no more atoms. This conjecture has not been confirmed or denied yet. In this article, we show that Tarski's conjecture is true if CAα\mathrm{CA}_{\alpha} is replaced by Dα\mathrm{D}_{\alpha}, Gα\mathrm{G}_{\alpha}, but the mm-generated free Crsα\mathrm{Crs}_{\alpha} algebra is atomless

    Zero-one laws with respect to models of provability logic and two Grzegorczyk logics

    Get PDF
    It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in almost no models of that size. Therefore, many properties of models, such as having an even number of elements, cannot be expressed in the language of first-order logic. Halpern and Kapron proved zero-one laws for classes of models corresponding to the modal logics K, T, S4, and S5 and for frames corresponding to S4 and S5. In this paper, we prove zero-one laws for provability logic and its two siblings Grzegorczyk logic and weak Grzegorczyk logic, with respect to model validity. Moreover, we axiomatize validity in almost all relevant finite models, leading to three different axiom systems

    Algebras of partial functions

    Get PDF
    This thesis collects together four sets of results, produced by investigating modifications, in four distinct directions, of the following. Some set-theoretic operations on partial functions are chosen—composition and intersection are examples—and the class of algebras isomorphic to a collection of partial functions, equipped with those operations, is studied. Typical questions asked are whether the class is axiomatisable, or indeed finitely axiomatisable, in any fragment of first-order logic, what computational complexity classes its equational/quasiequational/first-order theories lie in, and whether it is decidable if a finite algebra is in the class. The first modification to the basic picture asks that the isomorphisms turn any existing suprema into unions and/or infima into intersections, and examines the class so obtained. For composition, intersection, and antidomain together, we show that the suprema and infima conditions are equivalent. We show the resulting class is axiomatisable by a universal-existential-universal sentence, but not axiomatisable by any existential-universal-existential theory. The second contribution concerns what happens when we demand partial functions on some finite base set. The finite representation property is essentially the assertion that this restriction that the base set be finite does not restrict the algebras themselves. For composition, intersection, domain, and range, plus many supersignatures, we prove the finite representation property. It follows that it is decidable whether a finite algebra is a member of the relevant class. The third set of results generalises from unary to ‘multiplace’ functions. For the signatures investigated, finite equational or quasiequational axiomatisations are obtained; similarly when the functions are constrained to be injective. The finite representation property follows. The equational theories are shown to be coNP-complete. In the last section we consider operations that may only be partial. For most signatures the relevant class is found to be recursively, but not finitely, axiomatisable. For others, finite axiomatisations are provided

    First order logic without equality on relativized semantics

    Get PDF
    Let α≥2 be any ordinal. We consider the class Drsα of relativized diagonal free set algebras of dimension α. With same technique, we prove several important results concerning this class. Among these results, we prove that almost all free algebras of Drsα are atomless, and none of these free algebras contains zero-dimensional elements other than zero and top element. The class Drsα corresponds to first order logic, without equality symbol, with α-many variables and on relativized semantics. Hence, in this variation of first order logic, there is no finitely axiomatizable, complete and consistent theory. © 2018 Elsevier B.V
    • …
    corecore