Soit un ensemble fini. Nous nous proposons ici d’établir des indices de distance entre les divers ensembles de parties de . Nous généraliserons pour cela, à , la notion de fonction caractéristique bien connue dans .
We show how to reduce the assumptions in consistency strength used to prove several theorems on universal indestructibility.
We present a new prover for propositional 3-valued logics, TAS-M3, which is an extension of the TAS-D prover for classical propositional logic. TAS-M3 uses the TAS methodology and, consequently, it is a reduction-based method. Thus, its power is based on the reductions of the size of the formula executed by the F transformation. This transformation dynamically filters the information contained in the syntactic structure of the formula to avoid as much distributions as possible, in order to improve...
This paper is just a first approach to the idea that the membership function μP of a fuzzy set labelled P is, basically, a measure on the set of linguistic expressions x is P for each x in the corresponding universe of discourse X. Estimating that the meaning of P (relatively to X) is nothing else than the use of P on X, these measures seem to be reached by generalizing to a preordered set the concept of Fuzzy Measure, introduced by M. Sugeno, when the preorder translates the primary use of the...
This paper aims to propose a complete relational semantics for the so-called logic of bounded lattices, and prove a completeness theorem with regard to a class of two-sorted frames that is dually equivalent (categorically) to the variety of bounded lattices.
S. Solecki proved that if is a system of closed subsets of a complete separable metric space , then each Suslin set which cannot be covered by countably many members of contains a set which cannot be covered by countably many members of . We show that the assumption of separability of cannot be removed from this theorem. On the other hand it can be removed under an extra assumption that the -ideal generated by is locally determined. Using Solecki’s arguments, our result can be used...
For categories with equalizers the concepts ``accessible'' and ``axiomatizable'' are equivalent. This results is proved under (in fact, is equivalent to) the large-cardinal Vopěnka's principle.