A proper class of pairwise incomparable cardinals
A property of stable theories
A property of the solvable radical in finitely decidable varieties
It is shown that in a finitely decidable equational class, the solvable radical of any finite subdirectly irreducible member is comparable to all congruences of the irreducible if the type of the monolith is 2. In the type 1 case we establish that the centralizer of the monolith is strongly solvable.
A propos des distances entre ensembles de parties
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 .
A propos des quasi-ordres - Note
A propos d'un théorème de MacIntyre
A proposal concerning the formulation of the infinitistic axiom in the theory of logical probability
A Propositional p-adic Probability Logic
A pseudo representation theorem for various categories of relations.
A recursion-theoretic characterization of instances of provable in
A Reducibility Arising from the Boone Groups.
A Reduction in Consistency Strength for Universal Indestructibility
We show how to reduce the assumptions in consistency strength used to prove several theorems on universal indestructibility.
A reduction-based theorem prover for 3-valued logic.
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...
A reflection on what is a membership function.
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...
A reflection phenomenon in descriptive set theory
A relational semantics for the logic of bounded lattices
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.
A remark on a paper by Karel Prikry
A remark on a paper of Taimanov
A remark on a theorem of Solecki
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...
A remark on accessible and axiomatizable categories
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.