Complete Axiomatisations of Properties of Finite Sets
نویسندگان
چکیده
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, both taking a finite set as argument. We present a basic Hilbert-style axiomatisation, and study its completeness. The main results are syntactic and semantic characterisations of complete extensions of the logic.
منابع مشابه
Multidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملComputing Certificates of Regular Expression Equivalence
Deciding the equivalence of regular expressions is a fundamental problem of theoretical computer science. On one hand, there are several decision procedures to solve this problem. On the other hand, there are several axiomatisations of the equivalence of regular expression. The axiomatisations are proved to be complete and the proofs consists of showing that each steps of a decision procedure c...
متن کاملOn Multivalued Dependencies in Fixed and Undetermined Universes
The implication of multivalued dependencies (MVDs) in relational databases has originally been defined in the context of some fixed finite universe. While axiomatisability and implication problem have been intensely studied with respect to this notion, almost no research has been devoted towards the alternative notion of implication in which the underlying universe of attributes is left undeter...
متن کاملErratum to "Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets"
This note corrects two errors that occurred during the typesetting of our paper “Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets”, which appeared in Hartmann et al. [Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets, Theoret. Comput. Sci. 353(2) (2006) 167–196]. © 2006 Elsevier B.V. All rights reserved.
متن کاملAxiomatisations and Types for Probabilistic and Mobile Processes. (Axiomatisations et types pour des processus probabilistes et mobiles)
The focus of this thesis are the theoretical foundations for reasoning about algorithms and protocols for modern distributed systems. Two important features of models for these systems are probability and typed mobility: probabilities can be used to quantify unreliable or unpredictable behaviour and types can be used to guarantee secure behaviour in systems with a mobile structure. In this thes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logic Journal of the IGPL
دوره 16 شماره
صفحات -
تاریخ انتشار 2008