On a unification problem related to Kreisel's conjecture
On almost equitable uninorms
Uninorms, as binary operations on the unit interval, have been widely applied in information aggregation. The class of almost equitable uninorms appears when the contradictory information is aggregated. It is proved that among various uninorms of which either underlying t-norm or t-conorm is continuous, only the representable uninorms belong to the class of almost equitable uninorms. As a byproduct, a characterization for the class of representable uninorms is obtained.
On an algebraic and Kripke semantics for intermediate logics
On canonical formulas for extensions of minimal logic.
On cardinalities of algebras of formulas for -categorical theories
On characteristic formulae for Event-Recording Automata
A standard bridge between automata theory and logic is provided by the notion of characteristic formula. This paper investigates this problem for the class of event-recording automata (ERA), a subclass of timed automata in which clocks are associated with actions and that enjoys very good closure properties. We first study the problem of expressing characteristic formulae for ERA in Event-Recording Logic (ERL ), a logic introduced by Sorea to express event-based timed specifications. We prove that...
On classification with missing data using rough-neuro-fuzzy systems
The paper presents a new approach to fuzzy classification in the case of missing data. Rough-fuzzy sets are incorporated into logical type neuro-fuzzy structures and a rough-neuro-fuzzy classifier is derived. Theorems which allow determining the structure of the rough-neuro-fuzzy classifier are given. Several experiments illustrating the performance of the roughneuro-fuzzy classifier working in the case of missing features are described.
On closed classes of quasilinear functions
On completeness results for Predicate Lukasiewicz, Product, Gödel and Nilpotent Minimum Logics Expanded with Truth-constants.
On continuity of the entropy-based differently implicational algorithm
Aiming at the previously-proposed entropy-based differently implicational algorithm of fuzzy inference, this study analyzes its continuity. To begin with, for the FMP (fuzzy modus ponens) and FMT (fuzzy modus tollens) problems, the continuous as well as uniformly continuous properties of the entropy-based differently implicational algorithm are demonstrated for the Tchebyshev and Hamming metrics, in which the R-implications derived from left-continuous t-norms are employed. Furthermore, four numerical...
On Core XPath with Inflationary Fixed Points
We prove the undecidability of Core XPath 1.0 (CXP) [G. Gottlob and C. Koch, in Proc. of 17th Ann. IEEE Symp. on Logic in Computer Science, LICS ’02 (Copenhagen, July 2002). IEEE CS Press (2002) 189–202.] extended with an Inflationary Fixed Point (IFP) operator. More specifically, we prove that the satisfiability problem of this language is undecidable. In fact, the fragment of CXP+IFP containing only the self and descendant axes is already undecidable.
On cut elimination in the presence of peirce rule.
On decidability of one class of boolean formulas
On effective speed-up and long proofs of trivial theorems in formal theories
On exact conditionals.
On extensions of Nelson's logic satisfying Dummett's axiom.
On functions that cannot be mv-truth values in algebraic structures.
It is shown, in a general frame and playing with idempotency, that in order to have on a given lattice a Multiple Valued Logic preserving the lattice structure, the only t-norms and t-conorms allowing to modelize the truth values of a v b, a ^ b and a --> b are Min and Max, respectively, apart from ordinal sums.
On fuzzy ideals in Hilbert algebras.
On fuzzy intuitionistic logic
On general and reproductive solutions of finite equations.