Funda Karaçal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Funda Karaçal has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Ümit Ertuğrul
Department of Mathematics, Karadeniz Technical University, Trabzon 61080, Turkey
17 shared publications - Kübra Karacair
Karadeniz Technical University
7 shared publications - M. Nesibe Kesicioğlu
Department of Mathematics, Recep Tayyip Erdogan University, Rize, Turkey
5 shared publications - Radko Mesiar
Faculty of Civil Engineering, Slovak University of Technology, Bratislava, Slovakia
3 shared publications - Gül Deniz Çaylı
Department of Mathematics, Faculty of Science, Karadeniz Technical University, Trabzon, Turkey
2 shared publications - Mücahide Nesibe Kesicioğlu
Recep Tayyip Erdogan Univ, Dept Math, TR-53100 Rize, Turkey
2 shared publications
Latest Publications
- 13 October 2026
- Published by Turkish Journal of Mathematics and Computer Science, Association of Mathematicians in Turkish Journal of Mathematics and Computer Science
- Vol. 18 (3) , 780-799
Implication Operators by Means of Order-Preserving and Order-Reversing Functions on Bounded Lattices
In this paper, we propose new construction methods for generating implication operators based onorder-preserving or order-reversing functions on a bounded lattice. These methods establish a broader framework, allowing for the generation of a wider class of implication operators through the selection of monotonic functions. Furthermore, illustrative examples, figures, and the corresponding results are presented.
- 13 October 2026
- Published by Turkish Journal of Mathematics and Computer Science, Association of Mathematicians in Turkish Journal of Mathematics and Computer Science
- Vol. 18 (3) , 780-799
Implication Operators by Means of Order-Preserving and Order-Reversing Functions on Bounded Lattices
In this paper, we propose new construction methods for generating implication operators based onorder-preserving or order-reversing functions on a bounded lattice. These methods establish a broader framework, allowing for the generation of a wider class of implication operators through the selection of monotonic functions. Furthermore, illustrative examples, figures, and the corresponding results are presented.
- 12 June 2026
- Published by Springer Nature
- p. 339-350
Methods for Constructing Implications on Bounded Posets
- 12 June 2026
- Published by Springer Nature
- p. 339-350
Methods for Constructing Implications on Bounded Posets
- Open Access
- 3 February 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (6)
Construction methods for interval-valued t-norms on bounded lattices
In this paper, some construction methods for interval-valued t-norms (t-conorms) based on a down-set or an upset are presented. It is worth noting that the new construction methods do not have to be t-representable, which is a significant difference between the construction methods proposed in this paper and the commonly used construction methods of interval-valued t-norms (t-conorms) on other truth values sets. Some illustrative examples and remarks are also included to clarify the methods.
- 3 February 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 45 (6)
Open AccessConstruction methods for interval-valued t-norms on bounded lattices
In this paper, some construction methods for interval-valued t-norms (t-conorms) based on a down-set or an upset are presented. It is worth noting that the new construction methods do not have to be t-representable, which is a significant difference between the construction methods proposed in this paper and the commonly used construction methods of interval-valued t-norms (t-conorms) on other truth values sets. Some illustrative examples and remarks are also included to clarify the methods.
- Open Access
- 1 January 2026
- Published by National Library of Serbia in Filomat
- Vol. 40 (2) , 461-482
Uninorms with non-trivial unit element on the bounded lattices
In this paper, we focus on uninorms with non-trivial unit on bounded lattices. Based on the existence a t-norm T acting on [0, e] as well as a t-conorm S acting on [e, 1], we present some construction methods for uninorms on a bounded lattice, where some additional conditions on the bounded lattice and the neutral element e are required. The role of these additional conditions is emphasized. Finally, we present some results and some illustrative examples derived from these methods.
- 1 January 2026
- Published by National Library of Serbia in Filomat
- Vol. 40 (2) , 461-482
Open AccessUninorms with non-trivial unit element on the bounded lattices
In this paper, we focus on uninorms with non-trivial unit on bounded lattices. Based on the existence a t-norm T acting on [0, e] as well as a t-conorm S acting on [e, 1], we present some construction methods for uninorms on a bounded lattice, where some additional conditions on the bounded lattice and the neutral element e are required. The role of these additional conditions is emphasized. Finally, we present some results and some illustrative examples derived from these methods.
- 28 July 2025
- Published by Springer Nature
- p. 150-156
On Construction Methods of Fuzzy Implication Functions on Bounded Lattices
- 28 July 2025
- Published by Springer Nature
- p. 150-156
On Construction Methods of Fuzzy Implication Functions on Bounded Lattices
- 11 July 2025
- Published by Springer Nature
- p. 122-133
Implication Construction Methods on Bounded Lattices
- 11 July 2025
- Published by Springer Nature
- p. 122-133
Implication Construction Methods on Bounded Lattices
- 10 December 2024
- Published by Journal of Universal Mathematics in Journal of Universal Mathematics
SOME CONSTRUCTION METHODS FOR IMPLICATION OPERATORS ON BOUNDED LATTICES
In this paper, we focus the construction methods of implications on bounded lattices. We introduce several methods to obtain implication on bounded lattices. We basically base on implication defined on subinterval such as [a,1] or [0,b] of the bounded lattice L which has a,b ∈ L with a ≤ b for these construction methods. We also use fuzzy logic operators such as t-norms, t-conorms, negations and implications on L in some construction methods. In addition, we give some remarks and examples to make the new construction methods.
- 10 December 2024
- Published by Journal of Universal Mathematics in Journal of Universal Mathematics
SOME CONSTRUCTION METHODS FOR IMPLICATION OPERATORS ON BOUNDED LATTICES
In this paper, we focus the construction methods of implications on bounded lattices. We introduce several methods to obtain implication on bounded lattices. We basically base on implication defined on subinterval such as [a,1] or [0,b] of the bounded lattice L which has a,b ∈ L with a ≤ b for these construction methods. We also use fuzzy logic operators such as t-norms, t-conorms, negations and implications on L in some construction methods. In addition, we give some remarks and examples to make the new construction methods.
- 24 October 2022
- Published by Taylor & Francis in International Journal of General Systems
- Vol. 52 (4) , 414-442
Some further construction methods for uninorms on bounded lattices
In this paper, we propose new construction methods to obtain uninorms on a bounded lattice L with the fixed neutral element e using the presence of a t-norm (t-conorm) and a uninorm defined on a subinterval of L. Some properties related to these construction methods are investigated. Additionally, some illustrative examples are added for clarity.
- 24 October 2022
- Published by Taylor & Francis in International Journal of General Systems
- Vol. 52 (4) , 414-442
Some further construction methods for uninorms on bounded lattices
In this paper, we propose new construction methods to obtain uninorms on a bounded lattice L with the fixed neutral element e using the presence of a t-norm (t-conorm) and a uninorm defined on a subinterval of L. Some properties related to these construction methods are investigated. Additionally, some illustrative examples are added for clarity.
- 6 February 2022
- Published by Taylor & Francis in International Journal of General Systems
- Vol. 51 (3) , 239-261
Triangular norm decompositions through methods using congruence relations
In this paper, we introduce the concepts of T-distributive element, factor congruence, simple triangular norm and indecomposable t-norm on a bounded lattice through T-compatible congruence and study their related properties. We observe that the smallest t-norm on Boolean algebra is simple. We obtain a congruence by means of T-distributive element and investigate some properties of this type of congruence. A relation between the direct decomposability of any t-norm T and T-distributive elements whose supremum is T-∨-decomposable is obtained. Further, we show that any t-norm on a bounded lattice is directly indecomposable if and only if its underlying bounded lattice is directly indecomposable. We show that any t-norm T on a finite bounded lattice is isomorphic to a direct product of directly indecomposable t-norms. Finally, some illustrative examples are added.
- 6 February 2022
- Published by Taylor & Francis in International Journal of General Systems
- Vol. 51 (3) , 239-261
Triangular norm decompositions through methods using congruence relations
In this paper, we introduce the concepts of T-distributive element, factor congruence, simple triangular norm and indecomposable t-norm on a bounded lattice through T-compatible congruence and study their related properties. We observe that the smallest t-norm on Boolean algebra is simple. We obtain a congruence by means of T-distributive element and investigate some properties of this type of congruence. A relation between the direct decomposability of any t-norm T and T-distributive elements whose supremum is T-∨-decomposable is obtained. Further, we show that any t-norm on a bounded lattice is directly indecomposable if and only if its underlying bounded lattice is directly indecomposable. We show that any t-norm T on a finite bounded lattice is isomorphic to a direct product of directly indecomposable t-norms. Finally, some illustrative examples are added.
- 3 April 2021
- Published by Taylor & Francis in International Journal of General Systems
- Vol. 50 (3) , 281-299
The implications obtained by two given implications on bounded lattices
In this paper, some construction methods for implications on bounded lattices are introduced and the preserved properties such as the neutrality property, the identity principle and the ordering property are investigated. The algebraic structures of the sets defined by the constructed implications are studied.
- 3 April 2021
- Published by Taylor & Francis in International Journal of General Systems
- Vol. 50 (3) , 281-299
The implications obtained by two given implications on bounded lattices
In this paper, some construction methods for implications on bounded lattices are introduced and the preserved properties such as the neutrality property, the identity principle and the ordering property are investigated. The algebraic structures of the sets defined by the constructed implications are studied.