On the sum of observables in a logic
On the syntactico-semantical completeness of first-order fuzzy logic. II. Main results
On the syntactico-semantical completeness of first-order fuzzy logic. I. Syntax and semantics
On the -conditionality of -power based implications
It is well known that, in forward inference in fuzzy logic, the generalized modus ponens is guaranteed by a functional inequality called the law of -conditionality. In this paper, the -conditionality for -power based implications is deeply studied and the concise necessary and sufficient conditions for a power based implication being -conditional are obtained. Moreover, the sufficient conditions under which a power based implication is -conditional are discussed, this discussions give an...
On the t-closure Condition of Martin.
On the tensor product of a Boolean algebra and an orthoalgebra
On the theory of grossone.
On the topological complexity of infinitary rational relations
We prove in this paper that there exists some infinitary rational relations which are analytic but non Borel sets, giving an answer to a question of Simonnet [20].
On the Topological Complexity of Infinitary Rational Relations
We prove in this paper that there exists some infinitary rational relations which are analytic but non Borel sets, giving an answer to a question of Simonnet [20].
On the transfer principle in fuzzy theory.
We show in this paper that almost all results proved in many papers about fuzzy algebras can be proved uniformly and immediately by using so-called Transfer Principle.
On the uniqueness problem for quite full logics
On the weak pigeonhole principle
We investigate the proof complexity, in (extensions of) resolution and in bounded arithmetic, of the weak pigeonhole principle and of the Ramsey theorem. In particular, we link the proof complexities of these two principles. Further we give lower bounds to the width of resolution proofs and to the size of (extensions of) tree-like resolution proofs of the Ramsey theorem. We establish a connection between provability of WPHP in fragments of bounded arithmetic and cryptographic assumptions (the existence...
On the weak representability of -complete dimension complemented cylindric algebras
On the -superposition of functions of a -valued logic.
On tightness in chain-net spaces
On Todorcevic orderings
The Todorcevic ordering 𝕋(X) consists of all finite families of convergent sequences in a given topological space X. Such an ordering was defined for the special case of the real line by S. Todorcevic (1991) as an example of a Borel ordering satisfying ccc that is not σ-finite cc and even need not have the Knaster property. We are interested in properties of 𝕋(X) where the space X is taken as a parameter. Conditions on X are given which ensure the countable chain condition and its stronger versions...
On tolerance analysis
On two Classical Results in the First Order Logic
On two complete sets in the analytical and the arithmetical hierarchies.
On two problems of mice