[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
login
Revision History for A367446 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of discrete implications I:L_n^2-> L_n defined on the finite chain L_n={0,1,...n}, which satisfy the generalized modus ponens with respect to a discrete t-norm T, i.e., T(x,I(x,y))<=y, for all x,y in L_n.
(history; published version)
#7 by Michael De Vlieger at Sun Nov 19 10:33:47 EST 2023
STATUS

reviewed

approved

#6 by Joerg Arndt at Sun Nov 19 10:29:37 EST 2023
STATUS

proposed

reviewed

#5 by Robert C. Lyons at Sat Nov 18 18:50:37 EST 2023
STATUS

editing

proposed

#4 by Robert C. Lyons at Sat Nov 18 18:49:53 EST 2023
COMMENTS

Also, the number of discrete implications I satisfying the generalized modus tollens with respect to a discrete t-norm T and the classical discrete negation N_C, given by N_C(x)=n-x for all x in L_n, i.e., T(N(y),I(x,y))\leqslant <= N(x) for all x,y in L_n (generalized modus tollens with respect to a discrete t-norm T and a discrete negation N).

STATUS

proposed

editing

Discussion
Sat Nov 18
18:50
Robert C. Lyons: LaTex isn’t allowed. I replaced “\leqslant” with “<=“.
#3 by Marc Munar at Sat Nov 18 11:12:45 EST 2023
STATUS

editing

proposed

#2 by Marc Munar at Sat Nov 18 11:12:40 EST 2023
NAME

allocated Number of discrete implications I:L_n^2-> L_n defined on the finite chain L_n={0,1,...n}, which satisfy the generalized modus ponens with respect to a discrete t-norm T, i.e., T(x,I(x,y))<=y, for Marc Munarall x,y in L_n.

DATA

1, 9, 519, 150120, 202728377

OFFSET

1,2

COMMENTS

Number of discrete implications I:L_n^2->L_n defined on the finite chain L_n={0,1,...,n} satisfying the generalized modus ponens with respect to a discrete t-norm T, i.e., the number of binary functions I:L_n^2->L_n such that I is decreasing in the first argument, increasing in the second argument, I(0,0)=I(n,n)=n and I(n,0)=0 (discrete implication), and T(x,I(x,y))<=y, for all x,y in L_n (generalized modus ponens with respect to a discrete t-norm T). A discrete t-norm T is a binary operator T:L_n^2->L_n such that T is increasing in each argument, commutative (T(x,y)=T(y,x) for all x,y in L_n), associative (T(x,T(y,z))=T(T(x,y),z) for all x,y,z in L_n) and has neutral element n (T(x,n)=x for all x in L_n).

Also, the number of discrete implications I satisfying the generalized modus tollens with respect to a discrete t-norm T and the classical discrete negation N_C, given by N_C(x)=n-x for all x in L_n, i.e., T(N(y),I(x,y))\leqslant N(x) for all x,y in L_n (generalized modus tollens with respect to a discrete t-norm T and a discrete negation N).

LINKS

M. Munar, S. Massanet and D. Ruiz-Aguilera, <a href="https://doi.org/10.1016/j.fss.2023.01.004">A review on logical connectives defined on finite chains</a>, Fuzzy Sets and Systems, Volume 462, 2023.

CROSSREFS

Particular case of the enumeration of discrete implications in general, enumerated in A360612.

The enumeration of discrete negations in general is given in A001700.

KEYWORD

allocated

nonn,hard,more

AUTHOR

Marc Munar, Nov 18 2023

STATUS

approved

editing

#1 by Marc Munar at Sat Nov 18 11:12:40 EST 2023
NAME

allocated for Marc Munar

KEYWORD

allocated

STATUS

approved