A Theorem which is Equivalent to the Axiom of Choice.
A theoretical comparison of disco and CADIAG-II-like systems for medical diagnoses
In this paper a fuzzy relation-based framework is shown to be suitable to describe not only knowledge-based medical systems, explicitly using fuzzy approaches, but other ways of knowledge representation and processing. A particular example, the practically tested medical expert system Disco, is investigated from this point of view. The system is described in the fuzzy relation-based framework and compared with CADIAG-II-like systems that are a “pattern” for computer-assisted diagnosis systems based...
A theoretical development of distance measure for intuitionistic fuzzy numbers.
A theory of local negation: the model and some applications.
A theory of refinement structure of hedge algebras and its applications to fuzzy logic
In [13], an algebraic approach to the natural structure of domains of linguistic variables was introduced. In this approach, every linguistic domain can be interpreted as an algebraic structure called a hedge algebra. In this paper, a refinement structure of hedge algebras based on free distributive lattices generated by linguistic hedge operations will be examined in order to model structure of linguistic domains more properly. In solving this question, we restrict our consideration to the specific...
A Theory Of Variable Types.
A topological application of flat morasses
We define combinatorial structures which we refer to as flat morasses, and use them to construct a Lindelöf space with points of cardinality , consistent with GCH. The construction reveals, it is hoped, that flat morasses are a tool worth adding to the kit of any user of set theory.
A topological duality for the -chains associated with the logic
In this paper we present a topological duality for a certain subclass of the -structures defined by M. M. Fidel, which conform to a non-standard semantics for the paraconsistent N. C. A. da Costa logic . Actually, the duality introduced here is focused on -structures whose supports are chains. For our purposes, we characterize every -chain by means of a new structure that we will call down-covered chain (DCC) here. This characterization will allow us to prove the dual equivalence between the...
A topological interpretation of second-order intuitionistic arithmetic
A topology generated by eventually different functions
A T-partial order obtained from T-norms
A partial order on a bounded lattice is called t-order if it is defined by means of the t-norm on . It is obtained that for a t-norm on a bounded lattice the relation iff for some is a partial order. The goal of the paper is to determine some conditions such that the new partial order induces a bounded lattice on the subset of all idempotent elements of and a complete lattice on the subset of all elements of which are the supremum of a subset of atoms.
A tree axiom.
A tree -base for without cofinal branches
We prove an analogue to Dordal’s result in P.L. Dordal, A model in which the base-matrix tree cannot have cofinal branches, J. Symbolic Logic 52 (1980), 651–664. He obtained a model of ZFC in which there is a tree -base for with no branches yet of height . We establish that this is also possible for using a natural modification of Mathias forcing.
A Turing machine oracle hierarchy. I.
A Turing machine oracle hierarchy. II.
A Turing machine space hierarchy
A type of βN with relative types
A type-open minimal model.
A unifying approach to theorems on preservation and interpolation for binary relations between structures.
A universal function for continuous functions