Decision Theory Based on Non-Additive Measures
Declarative and procedural semantics of fuzzy similarity based unification
In this paper we argue that for fuzzy unification we need a procedural and declarative semantics (as opposed to the two valued case, where declarative semantics is hidden in the requirement that unified terms are syntactically – letter by letter – identical). We present an extension of the syntactic model of unification to allow near matches, defined using a similarity relation. We work in Hájek’s fuzzy logic in narrow sense. We base our semantics on a formal model of fuzzy logic programming extended...
Decomposable cardinals.
Decomposing Baire class 1 functions into continuous functions
It is shown to be consistent that every function of first Baire class can be decomposed into continuous functions yet the least cardinal of a dominating family in is . The model used in the one obtained by adding Miller reals to a model of the Continuum Hypothesis.
Decomposing Borel functions using the Shore-Slaman join theorem
Jayne and Rogers proved that every function from an analytic space into a separable metrizable space is decomposable into countably many continuous functions with closed domains if and only if the preimage of each set under that function is again . Many researchers conjectured that the Jayne-Rogers theorem can be generalized to all finite levels of Borel functions. In this paper, by using the Shore-Slaman join theorem on the Turing degrees, we show the following variant of the Jayne-Rogers theorem...
Decomposition into special cubes and its applications to quasi-subanalytic geometry
The main purpose of this paper is to present a natural method of decomposition into special cubes and to demonstrate how it makes it possible to efficiently achieve many well-known fundamental results from quasianalytic geometry as, for instance, Gabrielov's complement theorem, o-minimality or quasianalytic cell decomposition.
Décompositions d'un intervalle réel et des ensembles de Cantor
Decompositions of a -algebra.
Decompositions of saturated models of stable theories
We characterize the stable theories T for which the saturated models of T admit decompositions. In particular, we show that countable, shallow, stable theories with NDOP have this property.
Decompositions of the plane and the size of the continuum
We consider a triple ⟨E₀,E₁,E₂⟩ of equivalence relations on ℝ² and investigate the possibility of decomposing the plane into three sets ℝ² = S₀ ∪ S₁ ∪ S₂ in such a way that each intersects each -class in finitely many points. Many results in the literature, starting with a famous theorem of Sierpiński, show that for certain triples the existence of such a decomposition is equivalent to the continuum hypothesis. We give a characterization in ZFC of the triples for which the decomposition exists....
Dedekind-Endlichkeit und Wohlordenbarkeit.
Deduction in many-valued logics: a survey.
Deduction over graphs under constraints : a soundness and completeness theorem
Deductive systems of BCK-algebras
In this paper we shall give some results on irreducible deductive systems in BCK-algebras and we shall prove that the set of all deductive systems of a BCK-algebra is a Heyting algebra. As a consequence of this result we shall show that the annihilator of a deductive system is the the pseudocomplement of . These results are more general than that the similar results given by M. Kondo in [7].
Definability and forcing in E-recursion.
Definability degrees for classes in the alternative set theory
Definability in structures of finite valency
Definability in the extended arithmetic of ordinal numbers [Book]
Definability in the lattice of equational theories of semigroups.
Definability of arithmetical operations from binary quadratic forms