The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 101 –
120 of
208
In this paper, we consider the following basic question. Let A be an L-structure and let ψ be an infinitary sentence in the language L∪R, where R is a new relation symbol. When is it the case that for every B ≅ A, there is a relation R such that (B,R) ⊨ ψ and ? We succeed in giving necessary and sufficient conditions in the case where ψ is a “recursive” infinitary sentence. (A recursive infinitary formula is an infinitary formula with recursive disjunctions and conjunctions.) We consider also...
In [AK], we asked when a recursive structure A and a sentence φ, with a new relation symbol, have the following property: for each ℬ≅ A there is a relation S such that S is recursive relative to ℬ and ℬ,S)⊨ φ. Here we consider several related properties, in which there is a uniform procedure for determining S from ℬ ≅A, or from ℬ,¯b)≅(A,ā), for some fixed sequence of parameters ā from A; or in which ℬ and S are required to be recursive. We investigate relationships between these properties, showing...
Fuzzy classification systems is defined in this paper as an aggregative model, in such a way that Ruspini classical definition of fuzzy partition appears as a particular case. Once a basic recursive model has been accepted, we then propose to analyze relevance and redundancy in order to allow the possibility of learning from previous experiences. All these concepts are applied to a real picture, showing that our approach allows to check quality of such a classification system.
It is shown that the axioms of the intuitionistic logic can be proved as theorems in the frames of the intuitionistic fuzzy logic.
The paper shows that commutative Hilbert algebras introduced by Y. B. Jun are just J. C. Abbot’s implication algebras.
Some constructions of spaces with/without dense subspaces satisfying stronger separation axioms are presented.
Currently displaying 101 –
120 of
208