Li-ideals of implicative almost distributive lattices

Li-ideals of implicative almost distributive... | F1000Research "use strict";function _typeof(t){return(_typeof="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}!function(){var t=function(){var t,e,o=[],n=window,r=n;for(;r;){try{if(r.frames.__tcfapiLocator){t=r;break}}catch(t){}if(r===n.top)break;r=r.parent}t||(!function t(){var e=n.document,o=!!n.frames.__tcfapiLocator;if(!o)if(e.body){var r=e.createElement("iframe");r.style.cssText="display:none",r.name="__tcfapiLocator",e.body.appendChild(r)}else setTimeout(t,5);return!o}(),n.__tcfapi=function(){for(var t=arguments.length,n=new Array(t),r=0;r 3&&2===parseInt(n[1],10)&&"boolean"==typeof n[3]&&(e=n[3],"function"==typeof n[2]&&n[2]("set",!0)):"ping"===n[0]?"function"==typeof n[2]&&n[2]({gdprApplies:e,cmpLoaded:!1,cmpStatus:"stub"}):o.push(n)},n.addEventListener("message",(function(t){var e="string"==typeof t.data,o={};if(e)try{o=JSON.parse(t.data)}catch(t){}else o=t.data;var n="object"===_typeof(o)&&null!==o?o.__tcfapiCall:null;n&&window.__tcfapi(n.command,n.version,(function(o,r){var a={__tcfapiReturn:{returnValue:o,success:r,callId:n.callId}};t&&t.source&&t.source.postMessage&&t.source.postMessage(e?JSON.stringify(a):a,"*")}),n.parameter)}),!1))};"undefined"!=typeof module?module.exports=t:t()}(); dataLayer = dataLayer || []; // Standard GTM initialization - Google Consent Mode handles consent automatically (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src= 'https://www.googletagmanager.com/gtm.js?id='+i+dl+ '>m_auth=hzk0Vc3qFsQYhCrIoHz68A>m_preview=env-1>m_cookies_win=x';f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer','GTM-MWFK8L5J'); ;window.NREUM||(NREUM={});NREUM.init={distributed_tracing:{enabled:true},privacy:{cookies_enabled:true},ajax:{deny_list:["bam.nr-data.net"]}}; ;NREUM.loader_config={accountID:"438030",trustKey:"438030",agentID:"772317073",licenseKey:"97f8f67f26",applicationID:"772317073"} ;NREUM.info={beacon:"bam.nr-data.net",errorBeacon:"bam.nr-data.net",licenseKey:"97f8f67f26",applicationID:"772317073",sa:1} ;/*! For license information please see nr-loader-spa-1.236.0.min.js.LICENSE.txt */ (()=>{"use strict";var e,t,r={5763:(e,t,r)=>{r.d(t,{P_:()=>l,Mt:()=>g,C5:()=>s,DL:()=>v,OP:()=>T,lF:()=>D,Yu:()=>y,Dg:()=>h,CX:()=>c,GE:()=>b,sU:()=>_});var n=r(8632),i=r(9567);const o={beacon:n.ce.beacon,errorBeacon:n.ce.errorBeacon,licenseKey:void 0,applicationID:void 0,sa:void 0,queueTime:void 0,applicationTime:void 0,ttGuid:void 0,user:void 0,account:void 0,product:void 0,extra:void 0,jsAttributes:{},userAttributes:void 0,atts:void 0,transactionName:void 0,tNamePlain:void 0},a={};function s(e){if(!e)throw new Error("All info objects require an agent identifier!");if(!a[e])throw new Error("Info for ".concat(e," was never set"));return a[e]}function c(e,t){if(!e)throw new Error("All info objects require an agent identifier!");a[e]=(0,i.D)(t,o),(0,n.Qy)(e,a[e],"info")}var u=r(7056);const d=()=>{const e={blockSelector:"[data-nr-block]",maskInputOptions:{password:!0}};return{allow_bfcache:!0,privacy:{cookies_enabled:!0},ajax:{deny_list:void 0,enabled:!0,harvestTimeSeconds:10},distributed_tracing:{enabled:void 0,exclude_newrelic_header:void 0,cors_use_newrelic_header:void 0,cors_use_tracecontext_headers:void 0,allowed_origins:void 0},session:{domain:void 0,expiresMs:u.oD,inactiveMs:u.Hb},ssl:void 0,obfuscate:void 0,jserrors:{enabled:!0,harvestTimeSeconds:10},metrics:{enabled:!0},page_action:{enabled:!0,harvestTimeSeconds:30},page_view_event:{enabled:!0},page_view_timing:{enabled:!0,harvestTimeSeconds:30,long_task:!1},session_trace:{enabled:!0,harvestTimeSeconds:10},harvest:{tooManyRequestsDelay:60},session_replay:{enabled:!1,harvestTimeSeconds:60,sampleRate:.1,errorSampleRate:.1,maskTextSelector:"*",maskAllInputs:!0,get blockClass(){return"nr-block"},get ignoreClass(){return"nr-ignore"},get maskTextClass(){return"nr-mask"},get blockSelector(){return e.blockSelector},set blockSelector(t){e.blockSelector+=",".concat(t)},get maskInputOptions(){return e.maskInputOptions},set maskInputOptions(t){e.maskInputOptions={...t,password:!0}}},spa:{enabled:!0,harvestTimeSeconds:10}}},f={};function l(e){if(!e)throw new Error("All configuration objects require an agent identifier!");if(!f[e])throw new Error("Configuration for ".concat(e," was never set"));return f[e]}function h(e,t){if(!e)throw new Error("All configuration objects require an agent identifier!");f[e]=(0,i.D)(t,d()),(0,n.Qy)(e,f[e],"config")}function g(e,t){if(!e)throw new Error("All configuration objects require an agent identifier!");var r=l(e);if(r){for(var n=t.split("."),i=0;i {r.d(t,{D:()=>i});var n=r(50);function i(e,t){try{if(!e||"object"!=typeof e)return(0,n.Z)("Setting a Configurable requires an object as input");if(!t||"object"!=typeof t)return(0,n.Z)("Setting a Configurable requires a model to set its initial properties");const r=Object.create(Object.getPrototypeOf(t),Object.getOwnPropertyDescriptors(t)),o=0===Object.keys(r).length?e:r;for(let a in o)if(void 0!==e[a])try{"object"==typeof e[a]&&"object"==typeof t[a]?r[a]=i(e[a],t[a]):r[a]=e[a]}catch(e){(0,n.Z)("An error occurred while setting a property of a Configurable",e)}return r}catch(e){(0,n.Z)("An error occured while setting a Configurable",e)}}},6818:(e,t,r)=>{r.d(t,{Re:()=>i,gF:()=>o,q4:()=>n});const n="1.236.0",i="PROD",o="CDN"},385:(e,t,r)=>{r.d(t,{FN:()=>a,IF:()=>u,Nk:()=>f,Tt:()=>s,_A:()=>o,il:()=>n,pL:()=>c,v6:()=>i,w1:()=>d});const n="undefined"!=typeof window&&!!window.document,i="undefined"!=typeof WorkerGlobalScope&&("undefined"!=typeof self&&self instanceof WorkerGlobalScope&&self.navigator instanceof WorkerNavigator||"undefined"!=typeof globalThis&&globalThis instanceof WorkerGlobalScope&&globalThis.navigator instanceof WorkerNavigator),o=n?window:"undefined"!=typeof WorkerGlobalScope&&("undefined"!=typeof self&&self instanceof WorkerGlobalScope&&self||"undefined"!=typeof globalThis&&globalThis instanceof WorkerGlobalScope&&globalThis),a=""+o?.location,s=/iPad|iPhone|iPod/.test(navigator.userAgent),c=s&&"undefined"==typeof SharedWorker,u=(()=>{const e=navigator.userAgent.match(/Firefox[/\s](\d+\.\d+)/);return Array.isArray(e)&&e.length>=2?+e[1]:0})(),d=Boolean(n&&window.document.documentMode),f=!!navigator.sendBeacon},1117:(e,t,r)=>{r.d(t,{w:()=>o});var n=r(50);const i={agentIdentifier:"",ee:void 0};class o{constructor(e){try{if("object"!=typeof e)return(0,n.Z)("shared context requires an object as input");this.sharedContext={},Object.assign(this.sharedContext,i),Object.entries(e).forEach((e=>{let[t,r]=e;Object.keys(i).includes(t)&&(this.sharedContext[t]=r)}))}catch(e){(0,n.Z)("An error occured while setting SharedContext",e)}}}},8e3:(e,t,r)=>{r.d(t,{L:()=>d,R:()=>c});var n=r(2177),i=r(1284),o=r(4322),a=r(3325);const s={};function c(e,t){const r={staged:!1,priority:a.p[t]||0};u(e),s[e].get(t)||s[e].set(t,r)}function u(e){e&&(s[e]||(s[e]=new Map))}function d(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"",t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"feature";if(u(e),!e||!s[e].get(t))return a(t);s[e].get(t).staged=!0;const r=[...s[e]];function a(t){const r=e?n.ee.get(e):n.ee,a=o.X.handlers;if(r.backlog&&a){var s=r.backlog[t],c=a[t];if(c){for(var u=0;s&&u {let[t,r]=e;return r.staged}))&&(r.sort(((e,t)=>e[1].priority-t[1].priority)),r.forEach((e=>{let[t]=e;a(t)})))}function f(e,t){var r=e[1];(0,i.D)(t[r],(function(t,r){var n=e[0];if(r[0]===n){var i=r[1],o=e[3],a=e[2];i.apply(o,a)}}))}},2177:(e,t,r)=>{r.d(t,{c:()=>f,ee:()=>u});var n=r(8632),i=r(2210),o=r(1284),a=r(5763),s="nr@context";let c=(0,n.fP)();var u;function d(){}function f(e){return(0,i.X)(e,s,l)}function l(){return new d}function h(){u.aborted=!0,u.backlog={}}c.ee?u=c.ee:(u=function e(t,r){var n={},c={},f={},g=!1;try{g=16===r.length&&(0,a.OP)(r).isolatedBacklog}catch(e){}var p={on:b,addEventListener:b,removeEventListener:y,emit:v,get:x,listeners:w,context:m,buffer:A,abort:h,aborted:!1,isBuffering:E,debugId:r,backlog:g?{}:t&&"object"==typeof t.backlog?t.backlog:{}};return p;function m(e){return e&&e instanceof d?e:e?(0,i.X)(e,s,l):l()}function v(e,r,n,i,o){if(!1!==o&&(o=!0),!u.aborted||i){t&&o&&t.emit(e,r,n);for(var a=m(n),s=w(e),d=s.length,f=0;fn,p:()=>i});var n=r(2177).ee.get("handle");function i(e,t,r,i,o){o?(o.buffer([e],i),o.emit(e,t,r)):(n.buffer([e],i),n.emit(e,t,r))}},4322:(e,t,r)=>{r.d(t,{X:()=>o});var n=r(5546);o.on=a;var i=o.handlers={};function o(e,t,r,o){a(o||n.E,i,e,t,r)}function a(e,t,r,i,o){o||(o="feature"),e||(e=n.E);var a=t[o]=t[o]||{};(a[r]=a[r]||[]).push([e,i])}},3239:(e,t,r)=>{r.d(t,{bP:()=>s,iz:()=>c,m$:()=>a});var n=r(385);let i=!1,o=!1;try{const e={get passive(){return i=!0,!1},get signal(){return o=!0,!1}};n._A.addEventListener("test",null,e),n._A.removeEventListener("test",null,e)}catch(e){}function a(e,t){return i||o?{capture:!!e,passive:i,signal:t}:!!e}function s(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=arguments.length>3?arguments[3]:void 0;window.addEventListener(e,t,a(r,n))}function c(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=arguments.length>3?arguments[3]:void 0;document.addEventListener(e,t,a(r,n))}},4402:(e,t,r)=>{r.d(t,{Ht:()=>u,M:()=>c,Rl:()=>a,ky:()=>s});var n=r(385);const i="xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx";function o(e,t){return e?15&e[t]:16*Math.random()|0}function a(){const e=n._A?.crypto||n._A?.msCrypto;let t,r=0;return e&&e.getRandomValues&&(t=e.getRandomValues(new Uint8Array(31))),i.split("").map((e=>"x"===e?o(t,++r).toString(16):"y"===e?(3&o()|8).toString(16):e)).join("")}function s(e){const t=n._A?.crypto||n._A?.msCrypto;let r,i=0;t&&t.getRandomValues&&(r=t.getRandomValues(new Uint8Array(31)));const a=[];for(var s=0;s {r.d(t,{Bq:()=>n,Hb:()=>o,oD:()=>i});const n="NRBA",i=144e5,o=18e5},7894:(e,t,r)=>{function n(){return Math.round(performance.now())}r.d(t,{z:()=>n})},7243:(e,t,r)=>{r.d(t,{e:()=>o});var n=r(385),i={};function o(e){if(e in i)return i[e];if(0===(e||"").indexOf("data:"))return{protocol:"data"};let t;var r=n._A?.location,o={};if(n.il)t=document.createElement("a"),t.href=e;else try{t=new URL(e,r.href)}catch(e){return o}o.port=t.port;var a=t.href.split("://");!o.port&&a[1]&&(o.port=a[1].split("/")[0].split("@").pop().split(":")[1]),o.port&&"0"!==o.port||(o.port="https"===a[0]?"443":"80"),o.hostname=t.hostname||r.hostname,o.pathname=t.pathname,o.protocol=a[0],"/"!==o.pathname.charAt(0)&&(o.pathname="/"+o.pathname);var s=!t.protocol||":"===t.protocol||t.protocol===r.protocol,c=t.hostname===r.hostname&&t.port===r.port;return o.sameOrigin=s&&(!t.hostname||c),"/"===o.pathname&&(i[e]=o),o}},50:(e,t,r)=>{function n(e,t){"function"==typeof console.warn&&(console.warn("New Relic: ".concat(e)),t&&console.warn(t))}r.d(t,{Z:()=>n})},2587:(e,t,r)=>{r.d(t,{N:()=>c,T:()=>u});var n=r(2177),i=r(5546),o=r(8e3),a=r(3325);const s={stn:[a.D.sessionTrace],err:[a.D.jserrors,a.D.metrics],ins:[a.D.pageAction],spa:[a.D.spa],sr:[a.D.sessionReplay,a.D.sessionTrace]};function c(e,t){const r=n.ee.get(t);e&&"object"==typeof e&&(Object.entries(e).forEach((e=>{let[t,n]=e;void 0===u[t]&&(s[t]?s[t].forEach((e=>{n?(0,i.p)("feat-"+t,[],void 0,e,r):(0,i.p)("block-"+t,[],void 0,e,r),(0,i.p)("rumresp-"+t,[Boolean(n)],void 0,e,r)})):n&&(0,i.p)("feat-"+t,[],void 0,void 0,r),u[t]=Boolean(n))})),Object.keys(s).forEach((e=>{void 0===u[e]&&(s[e]?.forEach((t=>(0,i.p)("rumresp-"+e,[!1],void 0,t,r))),u[e]=!1)})),(0,o.L)(t,a.D.pageViewEvent))}const u={}},2210:(e,t,r)=>{r.d(t,{X:()=>i});var n=Object.prototype.hasOwnProperty;function i(e,t,r){if(n.call(e,t))return e[t];var i=r();if(Object.defineProperty&&Object.keys)try{return Object.defineProperty(e,t,{value:i,writable:!0,enumerable:!1}),i}catch(e){}return e[t]=i,i}},1284:(e,t,r)=>{r.d(t,{D:()=>n});const n=(e,t)=>Object.entries(e||{}).map((e=>{let[r,n]=e;return t(r,n)}))},4351:(e,t,r)=>{r.d(t,{P:()=>o});var n=r(2177);const i=()=>{const e=new WeakSet;return(t,r)=>{if("object"==typeof r&&null!==r){if(e.has(r))return;e.add(r)}return r}};function o(e){try{return JSON.stringify(e,i())}catch(e){try{n.ee.emit("internal-error",[e])}catch(e){}}}},3960:(e,t,r)=>{r.d(t,{K:()=>a,b:()=>o});var n=r(3239);function i(){return"undefined"==typeof document||"complete"===document.readyState}function o(e,t){if(i())return e();(0,n.bP)("load",e,t)}function a(e){if(i())return e();(0,n.iz)("DOMContentLoaded",e)}},8632:(e,t,r)=>{r.d(t,{EZ:()=>u,Qy:()=>c,ce:()=>o,fP:()=>a,gG:()=>d,mF:()=>s});var n=r(7894),i=r(385);const o={beacon:"bam.nr-data.net",errorBeacon:"bam.nr-data.net"};function a(){return i._A.NREUM||(i._A.NREUM={}),void 0===i._A.newrelic&&(i._A.newrelic=i._A.NREUM),i._A.NREUM}function s(){let e=a();return e.o||(e.o={ST:i._A.setTimeout,SI:i._A.setImmediate,CT:i._A.clearTimeout,XHR:i._A.XMLHttpRequest,REQ:i._A.Request,EV:i._A.Event,PR:i._A.Promise,MO:i._A.MutationObserver,FETCH:i._A.fetch}),e}function c(e,t,r){let i=a();const o=i.initializedAgents||{},s=o[e]||{};return Object.keys(s).length||(s.initializedAt={ms:(0,n.z)(),date:new Date}),i.initializedAgents={...o,[e]:{...s,[r]:t}},i}function u(e,t){a()[e]=t}function d(){return function(){let e=a();const t=e.info||{};e.info={beacon:o.beacon,errorBeacon:o.errorBeacon,...t}}(),function(){let e=a();const t=e.init||{};e.init={...t}}(),s(),function(){let e=a();const t=e.loader_config||{};e.loader_config={...t}}(),a()}},7956:(e,t,r)=>{r.d(t,{N:()=>i});var n=r(3239);function i(e){let t=arguments.length>1&&void 0!==arguments[1]&&arguments[1],r=arguments.length>2?arguments[2]:void 0,i=arguments.length>3?arguments[3]:void 0;return void(0,n.iz)("visibilitychange",(function(){if(t)return void("hidden"==document.visibilityState&&e());e(document.visibilityState)}),r,i)}},1214:(e,t,r)=>{r.d(t,{em:()=>v,u5:()=>N,QU:()=>S,_L:()=>I,Gm:()=>L,Lg:()=>M,gy:()=>U,BV:()=>Q,Kf:()=>ee});var n=r(2177);const i="nr@original";var o=Object.prototype.hasOwnProperty,a=!1;function s(e,t){return e||(e=n.ee),r.inPlace=function(e,t,n,i,o){n||(n="");var a,s,c,u="-"===n.charAt(0);for(c=0;c 2?n-2:0),o=2;o {r(A[T],e,w),r(E[T],e,w)})),r(l._A,"fetch",y),t.on(y+"end",(function(e,r){var n=this;if(r){var i=r.headers.get("content-length");null!==i&&(n.rxSize=i),t.emit(y+"done",[null,r],n)}else t.emit(y+"done",[e],n)})),t}const O={},j=["pushState","replaceState"];function S(e){const t=function(e){return(e||n.ee).get("history")}(e);return!l.il||O[t.debugId]++||(O[t.debugId]=1,s(t).inPlace(window.history,j,"-")),t}var P=r(3239);const C={},R=["appendChild","insertBefore","replaceChild"];function I(e){const t=function(e){return(e||n.ee).get("jsonp")}(e);if(!l.il||C[t.debugId])return t;C[t.debugId]=!0;var r=s(t),i=/[?&](?:callback|cb)=([^&#]+)/,o=/(.*)\.([^.]+)/,a=/^(\w+)(\.|$)(.*)$/;function c(e,t){var r=e.match(a),n=r[1],i=r[3];return i?c(i,t[n]):t[n]}return r.inPlace(Node.prototype,R,"dom-"),t.on("dom-start",(function(e){!function(e){if(!e||"string"!=typeof e.nodeName||"script"!==e.nodeName.toLowerCase())return;if("function"!=typeof e.addEventListener)return;var n=(a=e.src,s=a.match(i),s?s[1]:null);var a,s;if(!n)return;var u=function(e){var t=e.match(o);if(t&&t.length>=3)return{key:t[2],parent:c(t[1],window)};return{key:e,parent:window}}(n);if("function"!=typeof u.parent[u.key])return;var d={};function f(){t.emit("jsonp-end",[],d),e.removeEventListener("load",f,(0,P.m$)(!1)),e.removeEventListener("error",l,(0,P.m$)(!1))}function l(){t.emit("jsonp-error",[],d),t.emit("jsonp-end",[],d),e.removeEventListener("load",f,(0,P.m$)(!1)),e.removeEventListener("error",l,(0,P.m$)(!1))}r.inPlace(u.parent,[u.key],"cb-",d),e.addEventListener("load",f,(0,P.m$)(!1)),e.addEventListener("error",l,(0,P.m$)(!1)),t.emit("new-jsonp",[e.src],d)}(e[0])})),t}var k=r(5763);const H={};function L(e){const t=function(e){return(e||n.ee).get("mutation")}(e);if(!l.il||H[t.debugId])return t;H[t.debugId]=!0;var r=s(t),i=k.Yu.MO;return i&&(window.MutationObserver=function(e){return this instanceof i?new i(r(e,"fn-")):i.apply(this,arguments)},MutationObserver.prototype=i.prototype),t}const z={};function M(e){const t=function(e){return(e||n.ee).get("promise")}(e);if(z[t.debugId])return t;z[t.debugId]=!0;var r=n.c,o=s(t),a=k.Yu.PR;return a&&function(){function e(r){var n=t.context(),i=o(r,"executor-",n,null,!1);const s=Reflect.construct(a,[i],e);return t.context(s).getCtx=function(){return n},s}l._A.Promise=e,Object.defineProperty(e,"name",{value:"Promise"}),e.toString=function(){return a.toString()},Object.setPrototypeOf(e,a),["all","race"].forEach((function(r){const n=a[r];e[r]=function(e){let i=!1;[...e||[]].forEach((e=>{this.resolve(e).then(a("all"===r),a(!1))}));const o=n.apply(this,arguments);return o;function a(e){return function(){t.emit("propagate",[null,!i],o,!1,!1),i=i||!e}}}})),["resolve","reject"].forEach((function(r){const n=a[r];e[r]=function(e){const r=n.apply(this,arguments);return e!==r&&t.emit("propagate",[e,!0],r,!1,!1),r}})),e.prototype=a.prototype;const n=a.prototype.then;a.prototype.then=function(){var e=this,i=r(e);i.promise=e;for(var a=arguments.length,s=new Array(a),c=0;c e())),t};function m(e,t){i.inPlace(t,["onreadystatechange"],"fn-",E)}function b(){var e=this,t=r.context(e);e.readyState>3&&!t.resolved&&(t.resolved=!0,r.emit("xhr-resolved",[],e)),i.inPlace(e,f,"fn-",E)}if(function(e,t){for(var r in e)t[r]=e[r]}(o,p),p.prototype=o.prototype,i.inPlace(p.prototype,J,"-xhr-",E),r.on("send-xhr-start",(function(e,t){m(e,t),function(e){h.push(e),a&&(y?y.then(A):u?u(A):(w=-w,x.data=w))}(t)})),r.on("open-xhr-start",m),a){var y=c&&c.resolve();if(!u&&!c){var w=1,x=document.createTextNode(w);new a(A).observe(x,{characterData:!0})}}else t.on("fn-end",(function(e){e[0]&&e[0].type===d||A()}));function A(){for(var e=0;e {r.d(t,{t:()=>n});const n=r(3325).D.ajax},6660:(e,t,r)=>{r.d(t,{A:()=>i,t:()=>n});const n=r(3325).D.jserrors,i="nr@seenError"},3081:(e,t,r)=>{r.d(t,{gF:()=>o,mY:()=>i,t9:()=>n,vz:()=>s,xS:()=>a});const n=r(3325).D.metrics,i="sm",o="cm",a="storeSupportabilityMetrics",s="storeEventMetrics"},4649:(e,t,r)=>{r.d(t,{t:()=>n});const n=r(3325).D.pageAction},7633:(e,t,r)=>{r.d(t,{Dz:()=>i,OJ:()=>a,qw:()=>o,t9:()=>n});const n=r(3325).D.pageViewEvent,i="firstbyte",o="domcontent",a="windowload"},9251:(e,t,r)=>{r.d(t,{t:()=>n});const n=r(3325).D.pageViewTiming},3614:(e,t,r)=>{r.d(t,{BST_RESOURCE:()=>i,END:()=>s,FEATURE_NAME:()=>n,FN_END:()=>u,FN_START:()=>c,PUSH_STATE:()=>d,RESOURCE:()=>o,START:()=>a});const n=r(3325).D.sessionTrace,i="bstResource",o="resource",a="-start",s="-end",c="fn"+a,u="fn"+s,d="pushState"},7836:(e,t,r)=>{r.d(t,{BODY:()=>A,CB_END:()=>E,CB_START:()=>u,END:()=>x,FEATURE_NAME:()=>i,FETCH:()=>_,FETCH_BODY:()=>v,FETCH_DONE:()=>m,FETCH_START:()=>p,FN_END:()=>c,FN_START:()=>s,INTERACTION:()=>l,INTERACTION_API:()=>d,INTERACTION_EVENTS:()=>o,JSONP_END:()=>b,JSONP_NODE:()=>g,JS_TIME:()=>T,MAX_TIMER_BUDGET:()=>a,REMAINING:()=>f,SPA_NODE:()=>h,START:()=>w,originalSetTimeout:()=>y});var n=r(5763);const i=r(3325).D.spa,o=["click","submit","keypress","keydown","keyup","change"],a=999,s="fn-start",c="fn-end",u="cb-start",d="api-ixn-",f="remaining",l="interaction",h="spaNode",g="jsonpNode",p="fetch-start",m="fetch-done",v="fetch-body-",b="jsonp-end",y=n.Yu.ST,w="-start",x="-end",A="-body",E="cb"+x,T="jsTime",_="fetch"},5938:(e,t,r)=>{r.d(t,{W:()=>o});var n=r(5763),i=r(2177);class o{constructor(e,t,r){this.agentIdentifier=e,this.aggregator=t,this.ee=i.ee.get(e,(0,n.OP)(this.agentIdentifier).isolatedBacklog),this.featureName=r,this.blocked=!1}}},9144:(e,t,r)=>{r.d(t,{j:()=>m});var n=r(3325),i=r(5763),o=r(5546),a=r(2177),s=r(7894),c=r(8e3),u=r(3960),d=r(385),f=r(50),l=r(3081),h=r(8632);function g(){const e=(0,h.gG)();["setErrorHandler","finished","addToTrace","inlineHit","addRelease","addPageAction","setCurrentRouteName","setPageViewName","setCustomAttribute","interaction","noticeError","setUserId"].forEach((t=>{e[t]=function(){for(var r=arguments.length,n=new Array(r),i=0;i 1?r-1:0),i=1;i {e.exposed&&e.api[t]&&o.push(e.api[t](...n))})),o.length>1?o:o[0]}(t,...n)}}))}var p=r(2587);function m(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},m=arguments.length>2?arguments[2]:void 0,v=arguments.length>3?arguments[3]:void 0,{init:b,info:y,loader_config:w,runtime:x={loaderType:m},exposed:A=!0}=t;const E=(0,h.gG)();y||(b=E.init,y=E.info,w=E.loader_config),(0,i.Dg)(e,b||{}),(0,i.GE)(e,w||{}),(0,i.sU)(e,x),y.jsAttributes??={},d.v6&&(y.jsAttributes.isWorker=!0),(0,i.CX)(e,y),g();const T=function(e,t){t||(0,c.R)(e,"api");const h={};var g=a.ee.get(e),p=g.get("tracer"),m="api-",v=m+"ixn-";function b(t,r,n,o){const a=(0,i.C5)(e);return null===r?delete a.jsAttributes[t]:(0,i.CX)(e,{...a,jsAttributes:{...a.jsAttributes,[t]:r}}),x(m,n,!0,o||null===r?"session":void 0)(t,r)}function y(){}["setErrorHandler","finished","addToTrace","inlineHit","addRelease"].forEach((e=>h[e]=x(m,e,!0,"api"))),h.addPageAction=x(m,"addPageAction",!0,n.D.pageAction),h.setCurrentRouteName=x(m,"routeName",!0,n.D.spa),h.setPageViewName=function(t,r){if("string"==typeof t)return"/"!==t.charAt(0)&&(t="/"+t),(0,i.OP)(e).customTransaction=(r||"http://custom.transaction")+t,x(m,"setPageViewName",!0)()},h.setCustomAttribute=function(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2];if("string"==typeof e){if(["string","number"].includes(typeof t)||null===t)return b(e,t,"setCustomAttribute",r);(0,f.Z)("Failed to execute setCustomAttribute.\nNon-null value must be a string or number type, but a type of was provided."))}else(0,f.Z)("Failed to execute setCustomAttribute.\nName must be a string type, but a type of was provided."))},h.setUserId=function(e){if("string"==typeof e||null===e)return b("enduser.id",e,"setUserId",!0);(0,f.Z)("Failed to execute setUserId.\nNon-null value must be a string type, but a type of was provided."))},h.interaction=function(){return(new y).get()};var w=y.prototype={createTracer:function(e,t){var r={},i=this,a="function"==typeof t;return(0,o.p)(v+"tracer",[(0,s.z)(),e,r],i,n.D.spa,g),function(){if(p.emit((a?"":"no-")+"fn-start",[(0,s.z)(),i,a],r),a)try{return t.apply(this,arguments)}catch(e){throw p.emit("fn-err",[arguments,this,"string"==typeof e?new Error(e):e],r),e}finally{p.emit("fn-end",[(0,s.z)()],r)}}}};function x(e,t,r,i){return function(){return(0,o.p)(l.xS,["API/"+t+"/called"],void 0,n.D.metrics,g),i&&(0,o.p)(e+t,[(0,s.z)(),...arguments],r?null:this,i,g),r?void 0:this}}function A(){r.e(439).then(r.bind(r,7438)).then((t=>{let{setAPI:r}=t;r(e),(0,c.L)(e,"api")})).catch((()=>(0,f.Z)("Downloading runtime APIs failed...")))}return["actionText","setName","setAttribute","save","ignore","onEnd","getContext","end","get"].forEach((e=>{w[e]=x(v,e,void 0,n.D.spa)})),h.noticeError=function(e,t){"string"==typeof e&&(e=new Error(e)),(0,o.p)(l.xS,["API/noticeError/called"],void 0,n.D.metrics,g),(0,o.p)("err",[e,(0,s.z)(),!1,t],void 0,n.D.jserrors,g)},d.il?(0,u.b)((()=>A()),!0):A(),h}(e,v);return(0,h.Qy)(e,T,"api"),(0,h.Qy)(e,A,"exposed"),(0,h.EZ)("activatedFeatures",p.T),T}},3325:(e,t,r)=>{r.d(t,{D:()=>n,p:()=>i});const n={ajax:"ajax",jserrors:"jserrors",metrics:"metrics",pageAction:"page_action",pageViewEvent:"page_view_event",pageViewTiming:"page_view_timing",sessionReplay:"session_replay",sessionTrace:"session_trace",spa:"spa"},i={[n.pageViewEvent]:1,[n.pageViewTiming]:2,[n.metrics]:3,[n.jserrors]:4,[n.ajax]:5,[n.sessionTrace]:6,[n.pageAction]:7,[n.spa]:8,[n.sessionReplay]:9}}},n={};function i(e){var t=n[e];if(void 0!==t)return t.exports;var o=n[e]={exports:{}};return r[e](o,o.exports,i),o.exports}i.m=r,i.d=(e,t)=>{for(var r in t)i.o(t,r)&&!i.o(e,r)&&Object.defineProperty(e,r,{enumerable:!0,get:t[r]})},i.f={},i.e=e=>Promise.all(Object.keys(i.f).reduce(((t,r)=>(i.f[r](e,t),t)),[])),i.u=e=>(({78:"page_action-aggregate",147:"metrics-aggregate",242:"session-manager",317:"jserrors-aggregate",348:"page_view_timing-aggregate",412:"lazy-feature-loader",439:"async-api",538:"recorder",590:"session_replay-aggregate",675:"compressor",733:"session_trace-aggregate",786:"page_view_event-aggregate",873:"spa-aggregate",898:"ajax-aggregate"}[e]||e)+"."+{78:"ac76d497",147:"3dc53903",148:"1a20d5fe",242:"2a64278a",317:"49e41428",348:"bd6de33a",412:"2f55ce66",439:"30bd804e",538:"1b18459f",590:"cf0efb30",675:"ae9f91a8",733:"83105561",786:"06482edd",860:"03a8b7a5",873:"e6b09d52",898:"998ef92b"}[e]+"-1.236.0.min.js"),i.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),e={},t="NRBA:",i.l=(r,n,o,a)=>{if(e[r])e[r].push(n);else{var s,c;if(void 0!==o)for(var u=document.getElementsByTagName("script"),d=0;d {s.onerror=s.onload=null,clearTimeout(h);var i=e[r];if(delete e[r],s.parentNode&&s.parentNode.removeChild(s),i&&i.forEach((e=>e(n))),t)return t(n)},h=setTimeout(l.bind(null,void 0,{type:"timeout",target:s}),12e4);s.onerror=l.bind(null,s.onerror),s.onload=l.bind(null,s.onload),c&&document.head.appendChild(s)}},i.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},i.j=364,i.p="https://js-agent.newrelic.com/",(()=>{var e={364:0,953:0};i.f.j=(t,r)=>{var n=i.o(e,t)?e[t]:void 0;if(0!==n)if(n)r.push(n[2]);else{var o=new Promise(((r,i)=>n=e[t]=[r,i]));r.push(n[2]=o);var a=i.p+i.u(t),s=new Error;i.l(a,(r=>{if(i.o(e,t)&&(0!==(n=e[t])&&(e[t]=void 0),n)){var o=r&&("load"===r.type?"missing":r.type),a=r&&r.target&&r.target.src;s.message="Loading chunk "+t+" failed.\n("+o+": "+a+")",s.name="ChunkLoadError",s.type=o,s.request=a,n[1](s)}}),"chunk-"+t,t)}};var t=(t,r)=>{var n,o,[a,s,c]=r,u=0;if(a.some((t=>0!==e[t]))){for(n in s)i.o(s,n)&&(i.m[n]=s[n]);if(c)c(i)}for(t&&t(r);u {i.r(o);var e=i(3325),t=i(5763);const r=Object.values(e.D);function n(e){const n={};return r.forEach((r=>{n[r]=function(e,r){return!1!==(0,t.Mt)(r,"".concat(e,".enabled"))}(r,e)})),n}var a=i(9144);var s=i(5546),c=i(385),u=i(8e3),d=i(5938),f=i(3960),l=i(50);class h extends d.W{constructor(e,t,r){let n=!(arguments.length>3&&void 0!==arguments[3])||arguments[3];super(e,t,r),this.auto=n,this.abortHandler,this.featAggregate,this.onAggregateImported,n&&(0,u.R)(e,r)}importAggregator(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};if(this.featAggregate||!this.auto)return;const r=c.il&&!0===(0,t.Mt)(this.agentIdentifier,"privacy.cookies_enabled");let n;this.onAggregateImported=new Promise((e=>{n=e}));const o=async()=>{let t;try{if(r){const{setupAgentSession:e}=await Promise.all([i.e(860),i.e(242)]).then(i.bind(i,3228));t=e(this.agentIdentifier)}}catch(e){(0,l.Z)("A problem occurred when starting up session manager. This page will not start or extend any session.",e)}try{if(!this.shouldImportAgg(this.featureName,t))return void(0,u.L)(this.agentIdentifier,this.featureName);const{lazyFeatureLoader:r}=await i.e(412).then(i.bind(i,8582)),{Aggregate:o}=await r(this.featureName,"aggregate");this.featAggregate=new o(this.agentIdentifier,this.aggregator,e),n(!0)}catch(e){(0,l.Z)("Downloading and initializing ".concat(this.featureName," failed..."),e),this.abortHandler?.(),n(!1)}};c.il?(0,f.b)((()=>o()),!0):o()}shouldImportAgg(r,n){return r!==e.D.sessionReplay||!1!==(0,t.Mt)(this.agentIdentifier,"session_trace.enabled")&&(!!n?.isNew||!!n?.state.sessionReplay)}}var g=i(7633),p=i(7894);class m extends h{static featureName=g.t9;constructor(r,n){let i=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];if(super(r,n,g.t9,i),("undefined"==typeof PerformanceNavigationTiming||c.Tt)&&"undefined"!=typeof PerformanceTiming){const n=(0,t.OP)(r);n[g.Dz]=Math.max(Date.now()-n.offset,0),(0,f.K)((()=>n[g.qw]=Math.max((0,p.z)()-n[g.Dz],0))),(0,f.b)((()=>{const t=(0,p.z)();n[g.OJ]=Math.max(t-n[g.Dz],0),(0,s.p)("timing",["load",t],void 0,e.D.pageViewTiming,this.ee)}))}this.importAggregator()}}var v=i(1117),b=i(1284);class y extends v.w{constructor(e){super(e),this.aggregatedData={}}store(e,t,r,n,i){var o=this.getBucket(e,t,r,i);return o.metrics=function(e,t){t||(t={count:0});return t.count+=1,(0,b.D)(e,(function(e,r){t[e]=w(r,t[e])})),t}(n,o.metrics),o}merge(e,t,r,n,i){var o=this.getBucket(e,t,n,i);if(o.metrics){var a=o.metrics;a.count+=r.count,(0,b.D)(r,(function(e,t){if("count"!==e){var n=a[e],i=r[e];i&&!i.c?a[e]=w(i.t,n):a[e]=function(e,t){if(!t)return e;t.c||(t=x(t.t));return t.min=Math.min(e.min,t.min),t.max=Math.max(e.max,t.max),t.t+=e.t,t.sos+=e.sos,t.c+=e.c,t}(i,a[e])}}))}else o.metrics=r}storeMetric(e,t,r,n){var i=this.getBucket(e,t,r);return i.stats=w(n,i.stats),i}getBucket(e,t,r,n){this.aggregatedData[e]||(this.aggregatedData[e]={});var i=this.aggregatedData[e][t];return i||(i=this.aggregatedData[e][t]={params:r||{}},n&&(i.custom=n)),i}get(e,t){return t?this.aggregatedData[e]&&this.aggregatedData[e][t]:this.aggregatedData[e]}take(e){for(var t={},r="",n=!1,i=0;i t.max&&(t.max=e),e 2&&void 0!==arguments[2])||arguments[2];super(e,r,j.t,n),c.il&&((0,t.OP)(e).initHidden=Boolean("hidden"===document.visibilityState),(0,N.N)((()=>(0,s.p)("docHidden",[(0,p.z)()],void 0,j.t,this.ee)),!0),(0,O.bP)("pagehide",(()=>(0,s.p)("winPagehide",[(0,p.z)()],void 0,j.t,this.ee))),this.importAggregator())}}var P=i(3081);class C extends h{static featureName=P.t9;constructor(e,t){let r=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];super(e,t,P.t9,r),this.importAggregator()}}var R,I=i(2210),k=i(1214),H=i(2177),L={};try{R=localStorage.getItem("__nr_flags").split(","),console&&"function"==typeof console.log&&(L.console=!0,-1!==R.indexOf("dev")&&(L.dev=!0),-1!==R.indexOf("nr_dev")&&(L.nrDev=!0))}catch(e){}function z(e){try{L.console&&z(e)}catch(e){}}L.nrDev&&H.ee.on("internal-error",(function(e){z(e.stack)})),L.dev&&H.ee.on("fn-err",(function(e,t,r){z(r.stack)})),L.dev&&(z("NR AGENT IN DEVELOPMENT MODE"),z("flags: "+(0,b.D)(L,(function(e,t){return e})).join(", ")));var M=i(6660);class B extends h{static featureName=M.t;constructor(r,n){let i=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];super(r,n,M.t,i),this.skipNext=0;try{this.removeOnAbort=new AbortController}catch(e){}const o=this;o.ee.on("fn-start",(function(e,t,r){o.abortHandler&&(o.skipNext+=1)})),o.ee.on("fn-err",(function(t,r,n){o.abortHandler&&!n[M.A]&&((0,I.X)(n,M.A,(function(){return!0})),this.thrown=!0,(0,s.p)("err",[n,(0,p.z)()],void 0,e.D.jserrors,o.ee))})),o.ee.on("fn-end",(function(){o.abortHandler&&!this.thrown&&o.skipNext>0&&(o.skipNext-=1)})),o.ee.on("internal-error",(function(t){(0,s.p)("ierr",[t,(0,p.z)(),!0],void 0,e.D.jserrors,o.ee)})),this.origOnerror=c._A.onerror,c._A.onerror=this.onerrorHandler.bind(this),c._A.addEventListener("unhandledrejection",(t=>{const r=function(e){let t="Unhandled Promise Rejection: ";if(e instanceof Error)try{return e.message=t+e.message,e}catch(t){return e}if(void 0===e)return new Error(t);try{return new Error(t+(0,D.P)(e))}catch(e){return new Error(t)}}(t.reason);(0,s.p)("err",[r,(0,p.z)(),!1,{unhandledPromiseRejection:1}],void 0,e.D.jserrors,this.ee)}),(0,O.m$)(!1,this.removeOnAbort?.signal)),(0,k.gy)(this.ee),(0,k.BV)(this.ee),(0,k.em)(this.ee),(0,t.OP)(r).xhrWrappable&&(0,k.Kf)(this.ee),this.abortHandler=this.#e,this.importAggregator()}#e(){this.removeOnAbort?.abort(),this.abortHandler=void 0}onerrorHandler(t,r,n,i,o){"function"==typeof this.origOnerror&&this.origOnerror(...arguments);try{this.skipNext?this.skipNext-=1:(0,s.p)("err",[o||new F(t,r,n),(0,p.z)()],void 0,e.D.jserrors,this.ee)}catch(t){try{(0,s.p)("ierr",[t,(0,p.z)(),!0],void 0,e.D.jserrors,this.ee)}catch(e){}}return!1}}function F(e,t,r){this.message=e||"Uncaught error with no additional information",this.sourceURL=t,this.line=r}let U=1;const q="nr@id";function G(e){const t=typeof e;return!e||"object"!==t&&"function"!==t?-1:e===c._A?0:(0,I.X)(e,q,(function(){return U++}))}function V(e){if("string"==typeof e&&e.length)return e.length;if("object"==typeof e){if("undefined"!=typeof ArrayBuffer&&e instanceof ArrayBuffer&&e.byteLength)return e.byteLength;if("undefined"!=typeof Blob&&e instanceof Blob&&e.size)return e.size;if(!("undefined"!=typeof FormData&&e instanceof FormData))try{return(0,D.P)(e).length}catch(e){return}}}var X=i(7243);class W{constructor(e){this.agentIdentifier=e,this.generateTracePayload=this.generateTracePayload.bind(this),this.shouldGenerateTrace=this.shouldGenerateTrace.bind(this)}generateTracePayload(e){if(!this.shouldGenerateTrace(e))return null;var r=(0,t.DL)(this.agentIdentifier);if(!r)return null;var n=(r.accountID||"").toString()||null,i=(r.agentID||"").toString()||null,o=(r.trustKey||"").toString()||null;if(!n||!i)return null;var a=(0,_.M)(),s=(0,_.Ht)(),c=Date.now(),u={spanId:a,traceId:s,timestamp:c};return(e.sameOrigin||this.isAllowedOrigin(e)&&this.useTraceContextHeadersForCors())&&(u.traceContextParentHeader=this.generateTraceContextParentHeader(a,s),u.traceContextStateHeader=this.generateTraceContextStateHeader(a,c,n,i,o)),(e.sameOrigin&&!this.excludeNewrelicHeader()||!e.sameOrigin&&this.isAllowedOrigin(e)&&this.useNewrelicHeaderForCors())&&(u.newrelicHeader=this.generateTraceHeader(a,s,c,n,i,o)),u}generateTraceContextParentHeader(e,t){return"00-"+t+"-"+e+"-01"}generateTraceContextStateHeader(e,t,r,n,i){return i+"@nr=0-1-"+r+"-"+n+"-"+e+"----"+t}generateTraceHeader(e,t,r,n,i,o){if(!("function"==typeof c._A?.btoa))return null;var a={v:[0,1],d:{ty:"Browser",ac:n,ap:i,id:e,tr:t,ti:r}};return o&&n!==o&&(a.d.tk=o),btoa((0,D.P)(a))}shouldGenerateTrace(e){return this.isDtEnabled()&&this.isAllowedOrigin(e)}isAllowedOrigin(e){var r=!1,n={};if((0,t.Mt)(this.agentIdentifier,"distributed_tracing")&&(n=(0,t.P_)(this.agentIdentifier).distributed_tracing),e.sameOrigin)r=!0;else if(n.allowed_origins instanceof Array)for(var i=0;i 2&&void 0!==arguments[2])||arguments[2];super(r,n,Z.t,i),(0,t.OP)(r).xhrWrappable&&(this.dt=new W(r),this.handler=(e,t,r,n)=>(0,s.p)(e,t,r,n,this.ee),(0,k.u5)(this.ee),(0,k.Kf)(this.ee),function(r,n,i,o){function a(e){var t=this;t.totalCbs=0,t.called=0,t.cbTime=0,t.end=E,t.ended=!1,t.xhrGuids={},t.lastSize=null,t.loadCaptureCalled=!1,t.params=this.params||{},t.metrics=this.metrics||{},e.addEventListener("load",(function(r){_(t,e)}),(0,O.m$)(!1)),c.IF||e.addEventListener("progress",(function(e){t.lastSize=e.loaded}),(0,O.m$)(!1))}function s(e){this.params={method:e[0]},T(this,e[1]),this.metrics={}}function u(e,n){var i=(0,t.DL)(r);i.xpid&&this.sameOrigin&&n.setRequestHeader("X-NewRelic-ID",i.xpid);var a=o.generateTracePayload(this.parsedOrigin);if(a){var s=!1;a.newrelicHeader&&(n.setRequestHeader("newrelic",a.newrelicHeader),s=!0),a.traceContextParentHeader&&(n.setRequestHeader("traceparent",a.traceContextParentHeader),a.traceContextStateHeader&&n.setRequestHeader("tracestate",a.traceContextStateHeader),s=!0),s&&(this.dt=a)}}function d(e,t){var r=this.metrics,i=e[0],o=this;if(r&&i){var a=V(i);a&&(r.txSize=a)}this.startTime=(0,p.z)(),this.listener=function(e){try{"abort"!==e.type||o.loadCaptureCalled||(o.params.aborted=!0),("load"!==e.type||o.called===o.totalCbs&&(o.onloadCalled||"function"!=typeof t.onload)&&"function"==typeof o.end)&&o.end(t)}catch(e){try{n.emit("internal-error",[e])}catch(e){}}};for(var s=0;s 1?e[1]=i:e.push(i)}else e[0]&&e[0].headers&&s(e[0].headers,n)&&(this.dt=n);function s(e,t){var r=!1;return t.newrelicHeader&&(e.set("newrelic",t.newrelicHeader),r=!0),t.traceContextParentHeader&&(e.set("traceparent",t.traceContextParentHeader),t.traceContextStateHeader&&e.set("tracestate",t.traceContextStateHeader),r=!0),r}}function x(e,t){this.params={},this.metrics={},this.startTime=(0,p.z)(),this.dt=t,e.length>=1&&(this.target=e[0]),e.length>=2&&(this.opts=e[1]);var r,n=this.opts||{},i=this.target;"string"==typeof i?r=i:"object"==typeof i&&i instanceof Y?r=i.url:c._A?.URL&&"object"==typeof i&&i instanceof URL&&(r=i.href),T(this,r);var o=(""+(i&&i instanceof Y&&i.method||n.method||"GET")).toUpperCase();this.params.method=o,this.txSize=V(n.body)||0}function A(t,r){var n;this.endTime=(0,p.z)(),this.params||(this.params={}),this.params.status=r?r.status:0,"string"==typeof this.rxSize&&this.rxSize.length>0&&(n=+this.rxSize);var o={txSize:this.txSize,rxSize:n,duration:(0,p.z)()-this.startTime};i("xhr",[this.params,o,this.startTime,this.endTime,"fetch"],this,e.D.ajax)}function E(t){var r=this.params,n=this.metrics;if(!this.ended){this.ended=!0;for(var o=0;o 2&&void 0!==arguments[2])||arguments[2];super(e,t,we.t,r),this.importAggregator()}}new class{constructor(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:(0,_.ky)(16);c._A?(this.agentIdentifier=t,this.sharedAggregator=new y({agentIdentifier:this.agentIdentifier}),this.features={},this.desiredFeatures=new Set(e.features||[]),this.desiredFeatures.add(m),Object.assign(this,(0,a.j)(this.agentIdentifier,e,e.loaderType||"agent")),this.start()):(0,l.Z)("Failed to initial the agent. Could not determine the runtime environment.")}get config(){return{info:(0,t.C5)(this.agentIdentifier),init:(0,t.P_)(this.agentIdentifier),loader_config:(0,t.DL)(this.agentIdentifier),runtime:(0,t.OP)(this.agentIdentifier)}}start(){const t="features";try{const r=n(this.agentIdentifier),i=[...this.desiredFeatures];i.sort(((t,r)=>e.p[t.featureName]-e.p[r.featureName])),i.forEach((t=>{if(r[t.featureName]||t.featureName===e.D.pageViewEvent){const n=function(t){switch(t){case e.D.ajax:return[e.D.jserrors];case e.D.sessionTrace:return[e.D.ajax,e.D.pageViewEvent];case e.D.sessionReplay:return[e.D.sessionTrace];case e.D.pageViewTiming:return[e.D.pageViewEvent];default:return[]}}(t.featureName);n.every((e=>r[e]))||(0,l.Z)("".concat(t.featureName," is enabled but one or more dependent features has been disabled (").concat((0,D.P)(n),"). This may cause unintended consequences or missing data...")),this.features[t.featureName]=new t(this.agentIdentifier,this.sharedAggregator)}})),(0,T.Qy)(this.agentIdentifier,this.features,t)}catch(e){(0,l.Z)("Failed to initialize all enabled instrument classes (agent aborted) -",e);for(const e in this.features)this.features[e].abortHandler?.();const r=(0,T.fP)();return delete r.initializedAgents[this.agentIdentifier]?.api,delete r.initializedAgents[this.agentIdentifier]?.[t],delete this.sharedAggregator,r.ee?.abort(),delete r.ee?.get(this.agentIdentifier),!1}}}({features:[J,m,S,class extends h{static featureName=oe;constructor(t,r){if(super(t,r,oe,!(arguments.length>2&&void 0!==arguments[2])||arguments[2]),!c.il)return;const n=this.ee;let i;(0,k.QU)(n),this.eventsEE=(0,k.em)(n),this.eventsEE.on(se,(function(e,t){this.bstStart=(0,p.z)()})),this.eventsEE.on(ae,(function(t,r){(0,s.p)("bst",[t[0],r,this.bstStart,(0,p.z)()],void 0,e.D.sessionTrace,n)})),n.on(ce+ne,(function(e){this.time=(0,p.z)(),this.startPath=location.pathname+location.hash})),n.on(ce+ie,(function(t){(0,s.p)("bstHist",[location.pathname+location.hash,this.startPath,this.time],void 0,e.D.sessionTrace,n)}));try{i=new PerformanceObserver((t=>{const r=t.getEntries();(0,s.p)(te,[r],void 0,e.D.sessionTrace,n)})),i.observe({type:re,buffered:!0})}catch(e){}this.importAggregator({resourceObserver:i})}},C,xe,B,class extends h{static featureName=de;constructor(e,r){if(super(e,r,de,!(arguments.length>2&&void 0!==arguments[2])||arguments[2]),!c.il)return;if(!(0,t.OP)(e).xhrWrappable)return;try{this.removeOnAbort=new AbortController}catch(e){}let n,i=0;const o=this.ee.get("tracer"),a=(0,k._L)(this.ee),s=(0,k.Lg)(this.ee),u=(0,k.BV)(this.ee),d=(0,k.Kf)(this.ee),f=this.ee.get("events"),l=(0,k.u5)(this.ee),h=(0,k.QU)(this.ee),g=(0,k.Gm)(this.ee);function m(e,t){h.emit("newURL",[""+window.location,t])}function v(){i++,n=window.location.hash,this[ve]=(0,p.z)()}function b(){i--,window.location.hash!==n&&m(0,!0);var e=(0,p.z)();this[pe]=~~this[pe]+e-this[ve],this[ye]=e}function y(e,t){e.on(t,(function(){this[t]=(0,p.z)()}))}this.ee.on(ve,v),s.on(be,v),a.on(be,v),this.ee.on(ye,b),s.on(ge,b),a.on(ge,b),this.ee.buffer([ve,ye,"xhr-resolved"],this.featureName),f.buffer([ve],this.featureName),u.buffer(["setTimeout"+le,"clearTimeout"+fe,ve],this.featureName),d.buffer([ve,"new-xhr","send-xhr"+fe],this.featureName),l.buffer([me+fe,me+"-done",me+he+fe,me+he+le],this.featureName),h.buffer(["newURL"],this.featureName),g.buffer([ve],this.featureName),s.buffer(["propagate",be,ge,"executor-err","resolve"+fe],this.featureName),o.buffer([ve,"no-"+ve],this.featureName),a.buffer(["new-jsonp","cb-start","jsonp-error","jsonp-end"],this.featureName),y(l,me+fe),y(l,me+"-done"),y(a,"new-jsonp"),y(a,"jsonp-end"),y(a,"cb-start"),h.on("pushState-end",m),h.on("replaceState-end",m),window.addEventListener("hashchange",m,(0,O.m$)(!0,this.removeOnAbort?.signal)),window.addEventListener("load",m,(0,O.m$)(!0,this.removeOnAbort?.signal)),window.addEventListener("popstate",(function(){m(0,i>1)}),(0,O.m$)(!0,this.removeOnAbort?.signal)),this.abortHandler=this.#e,this.importAggregator()}#e(){this.removeOnAbort?.abort(),this.abortHandler=void 0}}],loaderType:"spa"})})(),window.NRBA=o})(); window.jQuery || document.write(' ') CKEDITOR_BASEPATH='https://f1000research.com/js/vendor/ckeditor/' window.reactTheme = 'research'; window.MathJax = { CommonHTML: { linebreaks: { automatic: true } }, 'HTML-CSS': { linebreaks: { automatic: true } }, SVG: { linebreaks: { automatic: true } }, AuthorInit: function() { MathJax.Hub.Register.MessageHook('End Process', function () { let timeout = false; // holder for timeout id const delay = 250; // delay after event is "complete" to run callback const reflowMath = function() { const dispFormulas = document.querySelectorAll('.disp-formula.panel'); if (!dispFormulas) { return; } for (const dispFormula of dispFormulas) { const child = dispFormula.querySelector('.MathJax_Preview').nextSibling.firstChild; const isMultiline = MathJax.Hub.getAllJax(dispFormula)[0].root.isMultiline; if (dispFormula.offsetWidth < child.offsetWidth || isMultiline) { MathJax.Hub.Queue(['Rerender', MathJax.Hub, dispFormula]); } } }; window.addEventListener('resize', function() { clearTimeout(timeout); // clear the timeout timeout = setTimeout(reflowMath, delay); // start timing for event "completion" }); }); }, }; if (window.location.hash == '#_=_'){ window.location = window.location.href.split('#')[0] } !function(f,b,e,v,n,t,s){if(f.fbq)return;n=f.fbq=function() {n.callMethod? n.callMethod.apply(n,arguments):n.queue.push(arguments)} ;if(!f._fbq)f._fbq=n; n.push=n;n.loaded=!0;n.version='2.0';n.queue=[];t=b.createElement(e);t.async=!0; t.src=v;s=b.getElementsByTagName(e)[0];s.parentNode.insertBefore(t,s)}(window, document,'script','https://connect.facebook.net/en_US/fbevents.js'); fbq('init', '1641728616063202'); fbq('track', "PixelInitialized", {}); (function(h,o,t,j,a,r){ h.hj=h.hj||function(){(h.hj.q=h.hj.q||[]).push(arguments)}; h._hjSettings={hjid:2318163,hjsv:6}; a=o.getElementsByTagName('head')[0]; r=o.createElement('script');r.async=1; r.src=t+h._hjSettings.hjid+j+h._hjSettings.hjsv; a.appendChild(r); })(window,document,'https://static.hotjar.com/c/hotjar-','.js?sv='); search file_upload Submit your research search menu close search Browse Gateways & Collections How to Publish Submit your Research My Submissions Article Guidelines Article Guidelines (New Versions) Open Data, Software and Code Guidelines Open Data and Accessible Source Materials Guidelines (HSS) Open Data, Software and Code Guidelines (PSE) Prepublication Checks Production Process Posters and Slides Guidelines Document Guidelines Article Processing Charges Peer Review Finding Article Reviewers About How it Works For Reviewers Our Advisors Policies Glossary FAQs For Developers Newsroom Contact My Research Submissions Content and Tracking Alerts My Details Sign In file_upload Submit your research { "@context": "https://schema.org", "@type": "ScholarlyArticle", "mainEntityOfPage": { "@type": "WebPage", "@id": "https://f1000research.com/articles/14-182" }, "headline": "Li-ideals of implicative almost distributive lattices", "datePublished": "2025-02-10T16:52:24", "dateModified": "2025-02-10T16:52:24", "author": [ { "@type": "Person", "name": "Alachew Amaneh Mechderso" }, { "@type": "Person", "name": "Tilahun Mekonnen Munie" } ], "publisher": { "@type": "Organization", "name": "F1000Research", "logo": { "@type": "ImageObject", "url": "https://f1000research.com/img/AMP/F1000Research_image.png", "height": 480, "width": 60 } }, "image": { "@type": "ImageObject", "url": "https://f1000research.com/img/AMP/F1000Research_image.png", "height": 1200, "width": 150 }, "description": " Background In this paper, we introduce the concept of H-implicative almost distributive lattices, which are a special class of lattices with both implicative and almost distributive properties. This study is aimed at extending the understanding of lattice structures and their ideals, particularly focusing on LI-ideals, a novel concept within H-implicative almost distributive lattices. Methods We define an LI-ideal of an implicative almost distributive lattice L and investigate its properties. The paper demonstrates that every LI-ideal in L is an almost distributive lattice ideal of L. Additionally, we explore the relationship between filters and LI-ideals, and we study the process of generating an LI-ideal from a given set. Lastly, we examine the construction of quotient structures via LI-ideals. Results We present several examples showing that every almost distributive lattice ideal is also an LI-ideal in an H-implicative almost distributive lattice. The study establishes key relationships between the concepts of filters and LI-ideals. Furthermore, we provide a method for generating an LI-ideal from a set and construct a quotient structure using an LI-ideal. Conclusions The paper introduces new concepts and relationships within the study of H-implicative almost distributive lattices. Our findings demonstrate the interconnection between almost distributive lattice ideals and LI-ideals and offer insights into how these ideals can be generated and used to construct quotient structures. This work provides a deeper understanding of lattice theory and opens new avenues for further research in the area of lattice ideals. " } { "@context": "http://schema.org", "@type": "BreadcrumbList", "itemListElement": [ { "@type": "ListItem", "position": "1", "item": { "@id": "https://f1000research.com/", "name": "Home" } }, { "@type": "ListItem", "position": "2", "item": { "@id": "https://f1000research.com/browse/articles", "name": "Browse" } }, { "@type": "ListItem", "position": "3", "item": { "@id": "https://f1000research.com/articles/14-182", "name": "Li-ideals of implicative almost distributive lattices" } } ] } Home Browse Li-ideals of implicative almost distributive lattices ALL Metrics - Views Downloads Get PDF Get XML Cite How to cite this article Mechderso AA and Munie TM. Li-ideals of implicative almost distributive lattices [version 1; peer review: 1 approved, 1 approved with reservations] . F1000Research 2025, 14 :182 ( https://doi.org/10.12688/f1000research.159175.1 ) NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article. Close Copy Citation Details Export Export Citation Sciwheel EndNote Ref. Manager Bibtex ProCite Sente EXPORT Select a format first Track Share ▬ ✚ Research Article Li-ideals of implicative almost distributive lattices [version 1; peer review: 1 approved, 1 approved with reservations] Alachew Amaneh Mechderso https://orcid.org/0009-0007-9566-9901 1 , Tilahun Mekonnen Munie 2 Alachew Amaneh Mechderso https://orcid.org/0009-0007-9566-9901 1 , Tilahun Mekonnen Munie 2 PUBLISHED 10 Feb 2025 Author details Author details 1 Department of Mathematics, University of KabriDahar, Kabri Dahar, Somalie, Ethiopia 2 Department of Mathematics, Bahir Dar University College of Science, Bahir Dar, Amhara, 6000, Ethiopia Alachew Amaneh Mechderso Roles: Conceptualization, Writing – Original Draft Preparation, Writing – Review & Editing Tilahun Mekonnen Munie Roles: Conceptualization, Visualization, Writing – Review & Editing OPEN PEER REVIEW DETAILS REVIEWER STATUS Abstract Background In this paper, we introduce the concept of H-implicative almost distributive lattices, which are a special class of lattices with both implicative and almost distributive properties. This study is aimed at extending the understanding of lattice structures and their ideals, particularly focusing on LI-ideals, a novel concept within H-implicative almost distributive lattices. Methods We define an LI-ideal of an implicative almost distributive lattice L and investigate its properties. The paper demonstrates that every LI-ideal in L is an almost distributive lattice ideal of L. Additionally, we explore the relationship between filters and LI-ideals, and we study the process of generating an LI-ideal from a given set. Lastly, we examine the construction of quotient structures via LI-ideals. Results We present several examples showing that every almost distributive lattice ideal is also an LI-ideal in an H-implicative almost distributive lattice. The study establishes key relationships between the concepts of filters and LI-ideals. Furthermore, we provide a method for generating an LI-ideal from a set and construct a quotient structure using an LI-ideal. Conclusions The paper introduces new concepts and relationships within the study of H-implicative almost distributive lattices. Our findings demonstrate the interconnection between almost distributive lattice ideals and LI-ideals and offer insights into how these ideals can be generated and used to construct quotient structures. This work provides a deeper understanding of lattice theory and opens new avenues for further research in the area of lattice ideals. READ ALL READ LESS Keywords Filter, H-implicative almost distributive lattice, LI-ideals and implicative almost distributive lattice.. Corresponding Author(s) Alachew Amaneh Mechderso ( [email protected] ) Close Corresponding author: Alachew Amaneh Mechderso Competing interests: No competing interests were disclosed. Grant information: The author(s) declared that no grants were involved in supporting this work. Copyright: © 2025 Mechderso AA and Munie TM. This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. How to cite: Mechderso AA and Munie TM. Li-ideals of implicative almost distributive lattices [version 1; peer review: 1 approved, 1 approved with reservations] . F1000Research 2025, 14 :182 ( https://doi.org/10.12688/f1000research.159175.1 ) First published: 10 Feb 2025, 14 :182 ( https://doi.org/10.12688/f1000research.159175.1 ) Latest published: 10 Feb 2025, 14 :182 ( https://doi.org/10.12688/f1000research.159175.1 ) Introduction In order to research the logical system whose propositional value is given in a lattice, Xu, Y. 8 proposed the concept of lattice implication algebras and discussed some of their properties. Xu, Y. and Qin, K. Y. 7 discussed the properties of lattice H-implication algebras. Jun, Y. B. and Xu, et al. 3 , 9 introduced the notions of a filters in a lattice implication algebra and investigate their properties. Jun, Y. B. et al. 4 proposed the concept of an LI-ideal of lattice implication algebra. They discussed the relationship between filters and LI-ideals and studied how to generate an LI-ideal by a set. They constructed quotient structure by using an LI-ideal. Kolluru,V. and Bekele, B. 5 the concept of implicative algebras was introduced, and several key properties were established. It was also proven that every implicative algebra is lattice implication algebra. In 1981, Swamy, U. M., and Rao, G. C. introduced the concept of an almost distributive lattice (ADL) as a common abstraction for many of the existing lattice structure. 6 The existing ring-theoretic and lattice-theoretic generalizations of Boolean algebra have been explored in various studies. Berhanu Assaye, Mihret Alamneh, and Tilahun Mekonnen 1 introduced the concept of implicative almost distributive lattices (IADLs) as a generalization of implicative algebras within the class of almost distributive lattices (ADLs). In this paper, we prove several properties and equivalence conditions within the framework of IADLs. We also introduced filter, implicative filter in IADL. 2 In this paper we discuss H-implicative almost distributive lattice (in short, H-IADL) and give equivalent conditions. We introduce LI-ideals in IADL and show that every LI-ideal is an ADL ideal. We give an example that an ADL ideal may not be an LI-ideal, and show that every ADL ideal is an LI-ideal in H-IADL. We discuss the relationship between filters and LI-ideal, and study how to generate an LI-ideal by a set. We construct quotient structure by using an LI-ideal. In the following, we give some important definitions and results that will be useful in this study. Preliminaries Definition 2.1 6 An algebra ( L , ∨ , ∧ , 0 ) of type ( 2 , 2 , 0 ) is called an almost distributive lattice (ADL) with 0 if it satisfies the following axioms: 1. ( x ∨ y ) ∧ z = ( x ∧ z ) ∨ ( y ∧ z ) 2. x ∧ ( y ∨ z ) = ( x ∧ y ) ∨ ( x ∧ z ) 3. ( x ∨ y ) ∧ y = y 4. ( x ∨ y ) ∧ x = x 5. x ∨ ( x ∧ y ) = x 6. 0 ∧ x = 0 , for all x , y , z ∈ L . If (L, ∨, ∧, 0) is an ADL, for any x , y ∈ L , define x ≤ y if and only if x = x ∧ y or equivalently x ∨ y = y , then ≤ is a partial ordering on L. Definition 2.2 6 Let L be an ADL. An element m ∈ L is called maximal if for any x ∈ L , m ≤ x implies m = x . Definition 2.3 6 A non-empty subset I of an ADL L is called an ideal of L, if it satisfies the following: i. x , y ∈ I implies x ∨ y ∈ I . ii. x ∈ I and y ∈ L implies that x ∧ y ∈ I . we call I as an ADL ideal of L . The following important property of the ideals is very useful to develop the algebra of ideals. If I is an ideal of ADL L and a , b ∈ L , then a ∧ b ∈ I if and only if b ∧ a ∈ I . Definition 2.4 6 Let L be an ADL. For any a ∈ L , principal filter of L generated by a is [ a ) = { x ∨ a : x ∈ L } Definition 2.5 [6] A non-empty subset F of an ADL L is called a filter of L if it satisfies the following: i. x , y ∈ F implies x ∧ y ∈ F . ii. x ∈ F and y ∈ L implies that y ∨ x ∈ F . Definition 2.6 6 A non-empty subset S of an ADL L is called a sub ADL of L if 1. 0 ∈ S 2. x ∧ y ∈ S and x ∨ y ∈ S , for any x , y ∈ S . Theorem 2.7 6 Let F is filter of an ADL L and x , y ∈ L . Then x ∨ y ∈ F if and only if y ∨ x ∈ F . Lemma 2.8 6 Every ideal (filter) of L is a sub ADL of ADL L. Definition 2.9 5 An algebra ( L , → , ′ , 0 , 1 ) of type ( 2 , 1 , 0 , 0 ) is called implicative algebra if it satisfies the following conditions: 1. x → ( y → z ) = y → ( x → z ) 2. 1 → x = x 3. x → 1 = 1 4. x → y = y ′ → x ′ 5. ( x → y ) → y = ( y → x ) → x 6. 0 ′ = 1 , for x , y , z ∈ L Theorem 2.10 5 Let ( L , → , ′ , 0 , 1 ) be an implicative algebra. Then ( L , ∨ , ∧ , → , ′ , 0 , 1 ) is a lattice implication algebra. Definition 2.11 1 Let ( L , ∨ , ∧ , 0 , m ) be an ADL with 0 and maximal element m. Then an algebra ( L , ∨ , ∧ , → , ′ , 0 , m ) of type ( 2 , 2 , 2 , 1 , 0 , 0 ) is called implicative almost distributive lattice (IADL) if it satisfies the following conditions: 1. x ∨ y = ( x → y ) → y 2. x ∧ y = [ ( x → y ) → x ′ ] ′ 3. x → ( y → z ) = y → ( x → z ) 4. m → x = x 5. x → m = m 6. x → y = y ′ → x ′ 7. 0 ′ = m , for all x , y , z ∈ L . Now we define the relation ≤ on an IADL L as follows: x ≤ y ⇔ x → y = m , for all x , y ∈ L . The relation ≤ on L is a partial ordering.Thus ( L , ≤ ) is a poset. Theorem 2.12 1 In an IADL L, for all x , y , z ∈ L the following conditions hold: 1. [ ( x → y ) → y ] ∧ m = [ ( y → x ) → x ] ∧ m 2. [ ( ( x → y ) → x ′ ) ′ ] ∧ m = [ ( ( y → x ) → y ′ ) ′ ] ∧ m 3. x → x = m 4. m ′ = 0 5. ( x ′ ) ′ = x 6. x ′ = x → 0 7. 0 → x = m 8. x → y = m = y → x implies x = y . 9. If x → y = m and y → z = m , then x → z = m 10. x ≤ y if and only if z → x ≤ z → y and y → z ≤ x → z 11. ( ( x → y ) → y ) → y = x → y 12. ( x → y ) → ( ( y → z ) → ( x → z ) ) = m , ( x → y ) → ( ( z → x ) → ( z → y ) ) = m 13. ( x → z ) → ( x → y ) = ( z → x ) → ( z → y ) = ( x ∧ z ) → y . 14. x → y ≤ ( y → z ) → ( x → z ) 15. ( x ∧ y ) ′ = x ′ ∨ y ′ , ( x ∨ y ) ′ = x ′ ∧ y ′ 16. x ≤ y implies y ′ ≤ x ′ . 17. ( x ∨ y ) → z = ( x → z ) ∧ ( y → z ) 18. ( x ∧ y ) → z = ( x → z ) ∨ ( y → z ) 19. x → ( y ∧ z ) = ( x → y ) ∧ ( x → z ) 20. x → ( y ∨ z ) = ( x → y ) ∨ ( x → z ) . Definition 2.13 2 Let L be an IADL. 1. A subset F of L is called a filter of L if it satisfies: ( F 1 ) m ∈ F ( F 2 ) x ∈ F and x → y ∈ F implies y ∈ F , for all x , y ∈ L . 2. A subset F of L is called implicative filter of L if it satisfies ( F 1 ) m ∈ F ( I ) x → y ∈ F and x → ( y → z ) ∈ F implies x → z ∈ F , for all x , y , z ∈ L . Lemma 2.14 2 Let F be a non-empty subset of an IADL L. Then F is a filter of L if and only if it satisfies for all x , y ∈ F and z ∈ L : x ≤ y → z implies z ∈ F Lemma 2.15 2 Every filter F of an IADL L has the following property: x ≤ y and x ∈ F implies y ∈ F . Definition 2.16 7 A lattice implication algebra L is called a lattice H-implication algebra, if for any x , y , z ∈ L , x ∨ y ∨ ( ( x ∧ y ) → z ) = 1 . Theorem 2.17 7 Let L be a lattice H-implication algebra. Then for any x , y , z ∈ L , x → ( y → z ) = ( x → y ) → ( x → z ) . Theorem 2.18 1 Let L be an IADL, then for any x , y , z ∈ L , ( x → ( y → z ) ) → ( ( x → y ) → ( x → z ) ) = x ∨ y ∨ ( ( x ∧ y ) → z ) . Definition 2.19 4 Let L be a lattice implication algebra. An LI-ideal A of L is a non-empty subset of L such that 1. 0 ∈ A , 2. y ∈ A and ( x → y ) ′ ∈ A implies x ∈ A , for x , y ∈ L . Theorem 2.20 4 , 9 Let L be a lattice implication algebra. Every LI-ideal of L is a lattice ideal. Theorem 2.21 4 In lattice H-implication algebra, every lattice ideal is an LI-ideal. Definition 2.22 6 An ADL ( L , ∨ , ∧ ) is said to be associative if the operation ∨ in L is associative. Definition 2.23 6 An equivalence relation θ on an ADL L is called a congruence relation on L if for all a , b , c , d ∈ L , ( a , b ) , ( c , d ) ∈ θ implies ( a ∧ c , b ∧ d ) ; ( a ∨ c , b ∨ d ) ∈ θ . LI-ideals in implicative almost distributive lattices In this section first we introduce H-implicative almost distributive lattice (H-IADL). Then we introduce LI-ideals in IADLs and discuss some of their properties. Finally, we give some characterizations of LI-ideals. H-implicative almost distributive lattices In this subsection we introduce H-implicative almost distributive lattice (H-IADL) and study the conditions of IADL being H-IADL. Definition 3.1 An implicative almost distributive lattice (IADL) L is called H-implicative almost distributive lattice (H-IADL) if it satisfies: x ∨ y ∨ ( ( x ∧ y ) → z ) = m , for all x , y , z ∈ L Example 3.2 Let L = { 0 , x , y , m } be a set. Define the partially ordered relation on L as ≤ = { ( 0 , x ) , ( 0 , m ) , ( 0 , y ) , ( x , m ) , ( y , m ) , ( 0 , 0 ) , ( x , x ) , ( y , y ) , ( m , m ) } and also define x ∧ y = min { x , y } , x ∨ y = max { x , y } for all x , y , z ∈ L . Define the unary operation ′ and binary operation → as shown in the tables below respectively. Table 1. a a 0 m x y y x m 0 Table 2. → 0 x y m 0 m m m m x y m y m y x x m m m 0 x y m Then clearly ( L , ∨ , ∧ , → , ′ , 0 , m ) is an IADL and hence it can be easily verified that L is an H-IADL. In the following some properties of H-IADLs are discussed. Theorem 3.3 Let L be an H-IADL. Then x → ( y → z ) = ( x → y ) → ( x → z ) for any x , y , z ∈ L . Proof. Let L be an H-IADL and x , y , z ∈ L . Now ( x → ( y → z ) ) → ( ( x → y ) → ( x → z ) ) = ( ( x → ( y → z ) ) → ( ( y ′ → x ′ ) → ( z ′ → x ′ ) ) = ( y ′ → x ′ ) → ( ( y → ( x → z ) ) → ( x → z ) ) = ( x → y ) → ( y ∨ ( x → z ) ) = ( x → ( y → y ) ) ∨ ( ( x → y ) → ( x → z ) ) = x ∨ y ∨ ( ( x ∧ y ) z ) = m (by Definition 3.1 and Theorem 2.12 ). Therefore ( x → ( y → z ) ) ≤ ( ( x → y ) → ( x → z ) ) . (1). On the other hand, ( ( x → y ) → ( x → z ) ) → ( x → ( y → z ) ) = y → ( ( x → y ) → ( x → z ) ) → ( x → z ) ) = y → ( ( x → y ) ∨ ( x → z ) ) = ( y → ( x → y ) ) ∨ ( y → ( x → z ) ) = m ∨ ( y → ( x → z ) ) = m . Therefore, ( ( x → y ) → ( x → z ) ) ≤ ( x → ( y → z ) ) … . ( 2 ) . Hence by (1) and (2), we get x → ( y → z ) = ( x → y ) → ( x → z ) . □ Corollary 3.4 Let L be an IADL. Then the following are equivalent: 1. L is an H-IADL; 2. For any x , y ∈ L , x → ( x → y ) = x → y 3. For any x , y , z ∈ L , x → ( y → z ) = ( x → y ) → ( x → z ) 4. For any x , y , z ∈ L , x → ( y → z ) = ( x ∧ y ) → z 5. For any x , y , z ∈ L , ( x → ( y → z ) ) → ( ( x → y ) → ( x → z ) ) = m . Proof. Let L be an IADL and x , y , z ∈ L . ( 1 ) ⇒ ( 2 ) . Suppose L is an H-IADL. Then using Theorem 3.3 , we have x → ( x → y ) = ( x → x ) → ( x → y ) = m → ( x → y ) = x → y . ( 1 ) ⇒ ( 4 ) . Suppose x → ( x → y ) = x → y . By assumption and Theorem 2.12 , ( x ∧ y ) → z = ( x ∧ y ) → [ ( x ∧ y ) → z ] = [ ( x ∧ y ) → ( x → z ) ] ∨ [ ( x ∧ y ) → ( y → z ) ] = [ ( x ∧ y ) → ( x → z ) ] ∨ [ ( x ∧ y ) → ( y → z ) = [ ( x → ( x → z ) ) ∨ ( ( y → ( x → z ) ) ] ∨ [ ( x → ( y → z ) ] ∨ [ ( y → ( y → z ) = [ ( x → z ) ∨ ( y → ( x → z ) ) ] ∨ [ ( x → ( y → z ) ∨ ( y → z ) ] = [ ( x → z ) → ( y → ( x → z ) ) → ( y → ( x → z ) ] ∨ [ ( ( x → ( y → z ) ) → ( y → z ) ) → ( y → z ) ] = [ y → ( ( x → z ) → ( x → z ) ) ] ∨ [ ( x → ( y → z ) ) ] = [ y → m ) → ( y → ( x → z ) ) ∨ [ x → ( y → z ) ] = [ m → ( y → ( x → z ) ] ∨ [ x → ( y → z ) ] = [ y → ( x → z ) ] ∨ [ x → ( y → z ) ] = [ x → ( y → z ) ] ∨ [ x → ( y → z ) ] = x → ( y → z ) . (4) ⇒ (3). Suppose x → ( y → z ) = ( x ∧ y ) → z . Now ( x ∧ y ) → z = [ ( x → y ) → x ′ ] ′ → z = z ′ → [ ( x → y ) → x ′ ] = ( x → y ) → ( z ′ → x ′ ) = ( x → y ) → ( x → z ) = x → ( y → z ) . ( 3 ) ⇒ ( 4 ) . Suppose x → ( y → z ) = ( x → y ) → ( x → z ) . Now ( x ∧ y ) → z = [ ( x → y ) → x ′ ] ′ → z = z ′ → ( ( x → y ) → x ′ ) = ( x → y ) → ( x → z ) = x → ( y → z ) (by Theorem 3.3 ). ( 3 ) ⇒ ( 5 ) . Suppose x → ( y → z ) = ( x ∧ y ) → z . Now ( x → ( y → z ) ) → ( ( x → y ) → ( x → z ) ) = ( ( x ∧ y ) → z ) → ( ( x → y ) → ( x → z ) ) = ( ( x → y ) → ( x → z ) ) → ( ( x → y ) → ( x → z ) ) = m . Therefore [ x → ( y → z ) ] → [ ( x → y ) → ( x → z ) ] = m . Hence (5) holds. ( 3 ) ⇒ ( 1 ) . Suppose ( x → ( y → z ) ) → [ ( x → y ) → ( x → z ) ] . Then using Theorem 2.12 and Definition 3.1 , ( x → ( y → z ) ) → ( ( x → y ) → ( x → z ) ) = ( x → y ) → ( y → ( ( x → z ) → ( x → z ) ) = ( x → y ) → ( y ∨ ( x → z ) ) = ( ( x → y ) → y ) ∨ ( ( x → y ) → ( x → z ) ) = x ∨ y ∨ ( ( x → y ) → ( x → z ) ) = x ∨ y ∨ ( ( x ∧ y ) → z ) = m . Therefore, L is an H-IADL. □ Definition 3.5 An IADL ( L , ∨ , ∧ , → , ′ , 0 , m ) is said to be associative IADL if ∨ in L is assocative Theorem 3.6 Let L be an associative IADL. Then the following statements are equivalent. 1. L is an H-IADL; 2. for any x , y ∈ L and z ∈ [ x , m ] , z → ( x → y ) = x → y ; 3. for any x , y ∈ L , ( x → y ) → x = x . 4. for any x ∈ L , x ∨ x ′ = m Proof. Let L be an IADL and x , y , z ∈ L . ( 1 ) ⇒ ( 2 ). Suppose L is an H-IADL. Let z ∈ [ x, m ]. Then we have x ≤ z . From Theorem 2.12 , we have z → ( x → y ) ≤ x → ( x → y ) . This implies again x → y ≤ z → ( x → y ) ≤ x → ( x → y ) = x → y (by Theorem 2.12 and Corollary 3.4 ), i.e., z → ( x → y ) = x → y . Therefore (2) holds. ( 2 ) ⇒ ( 1 ) . Putting z = x, we have x → ( x → y ) = x → y. Then it follows from Corollary 3.4 that L is an H-IADL. ( 3 ) → ( 1 ) . Suppose ( x → y ) → x = x . Now ( x → ( x → y ) ) → ( x → y ) = ( ( ( x → y ) → x ) → x ) = x → x = m . It follows that x → ( x → y ) ≤ x → y but we know from Theorem 2.12 that x → y ≤ x → ( x → y ) . Therefore x → y = x → ( x → y ) , it follows from Corollary 3.4 that L is an H-IADL. ( 1 ) ⇒ ( 3 ) . Suppose L is an H-IADL. Using Corollary 3.4 and Theorem 2.12 , we have (( x → y ) → x ) → x = ( x → ( x → y )) → ( x → y ) = ( x → y ) → ( x → y ) = m. Therefore ( x → y ) → x ≤ x and clearly x → ( ( x → y ) → x ) = m . This implies x → ( x → y ) ≤ x . Hence ( x → y ) → x = x . ( 3 ) ⇒ ( 4 ) . Suppose ( x → y ) → x = x . Now x ′ = ( x ′ → 0 ) → x ′ = x → x ′ (by supposition), it follows x ∨ x ′ = ( x → x ′ ) → x ′ = x ′ → x ′ = m . That is (4) holds. ( 4 ) ⇒ ( 3 ) . Suppose x ∨ x ′ = m . Then ( x ∨ x ′ ) ′ = x ′ ∧ x = m ′ = 0 . Therefore L is complemented IADL. Hence ∨ is associative. Now using Theorem 2.12 and our assumption we get ( x → y ) → ( x ′ ∨ y ) = ( ( x → y ) → x ′ ) ∨ ( ( x → y ) → y ) = y ′ ∨ x ′ ∨ x ∨ y = m and ( x ′ ∨ y ) → ( x → y ) = ( ( ( x → 0 ) → y ) → y ) → ( x → y ) = x → ( ( ( ( x → 0 ) → y ) → y ) → y ) = x → ( ( x → 0 ) → y ) = x → ( ( y → 0 ) → x ) = y ′ → ( x → x ) = y ′ → m = m (by Theorem 3.3 ). Hence x → y = x ′ ∨ y . It follows that ( x → y ) → x = ( x ′ ∨ y ) → x = ( x ′ ∨ y ) ′ ∨ x = ( x ∧ y ′ ) ∨ x = ( ( x ∧ y ′ ) → x ) → x = [ ( x → x ) ∨ ( y ′ → x ) ] → x = m → x = x , that is (3) holds. □ Corollary 3.7 Let L be an H-IADL. Then for any x , y ∈ L , y ∨ ( x → y ) ′ = x ∨ y . Proof. Let L be an H-IADL and x , y ∈ L . Now ( y ∨ ( x → y ) ′ ) → ( x ∨ y ) = ( y ∨ ( x → y ) ′ ) → [ ( x → y ) → y ] = ( x → y ) → [ ( y ∨ ( x → y ) ′ ) → y ) ] = ( x → y ) → [ ( y → y ) ∧ ( ( x → y ) ′ → y ) ] = ( x → y ) → [ ( x → y ) ′ → y ] = y ′ → [ ( x → y ) → ( x → y ) ] = m . This implies y ∨ ( x → y ) ′ → ( x ∨ y ) = m . Therefore, y ∨ ( x → y ) ′ ≤ x ∨ y …(1). Conversely ( x ∨ y ) → [ y ∨ ( x → y ) ′ ] = ( ( x ∨ y ) → y ) ∨ [ ( x ∨ y ) → ( x → y ) ′ ] = ( x → y ) ∨ [ ( x → y ) → ( x ′ ∧ y ′ ) ] = ( x → y ) ∨ [ ( ( x → y ) → x ′ ) ∧ ( ( x → y ) → y ′ ) ] = [ ( x → y ) ∨ ( ( x → y ) → x ′ ] ∧ [ ( x → y ) ∨ ( ( x → y ) → y ′ ) ] = [ ( x → y ) → ( ( x → y ) → x ′ ) → ( ( x → y ) → x ′ ) ] ∧ [ ( x → y ) → ( ( x → y ) → y ′ ) → ( ( x → y ) → y ′ ) ] = [ ( x → y ) → x ′ ) → ( ( x → y ) → x ′ ) ] ∧ [ ( ( x → y ) → y ′ ) → ( ( x → y ) → y ′ ) ] = m ∧ m = m . This implies x ∨ y ≤ y ∨ ( x → y ) ′ .... (2). Hence by (1) and (2), we have y ∨ ( x → y ) ′ = x ∨ y . □ LI-ideals in implicative almost distributive lattices In this section we introduce LI-ideal in IADL. We discuss some characterization of LI-ideal with that of H-IADL. We observe relation between LI-ideal and filters in IADL, construction of LI-ideal using a set and lastly we discuss quotient structure of LI-ideal in IADL. Definition 3.8 Let L be an IADL. An LI-ideal A of L is a subset of L such that ( I 1 ) 0 ∈ A and ( I 2 ) y ∈ A and ( x → y ) ′ ∈ A implies that x ∈ A . In this case if A ≠ L ,then A is proper LI-ideal of L. A proper LI-ideal A of L is said to be maximal if it is not properly contained in any other proper LI-ideal of L. That is, if I is any other LI-ideal of L such that A ⊆ I ⊆ L implies either A = I or I = L , then A is maximal LI-ideal of L. Remark 3.9 From the above definition we observe that {0} and L are trivial examples of LI-ideals. The following example shows that there is a proper LI-ideal in IADL. Example 3.10 Let L = { 0 , x , y , z , w , m } be the underlining set with partial ordering ≤ = { ( 0 , w ) , ( 0 , x ) , ( 0 , m ) , ( 0 , z ) , ( 0 , y ) , ( w , x ) , ( w , m ) , ( w , y ) , ( z , y ) , ( z , m ) , ( y , m ) , ( 0 , 0 ) , ( w , w ) , ( x , x ) , ( z , z ) ( y , y ) , ( m , m ) } . Define the unary operation ′ and binary operation → as shown in the tables below respectively. Table 3. a a 0 m x z y w z x w y m 0 Table 4. –→ 0 x y z w m 0 m m m m m m x z m y z y m y w x m y x m z x x m m x m w y m m y m m m 0 x y z w m Define the binary operation ∨ and ∧ by x ∨ y = ( x → y ) → y ∧ y = [ ( x → y ) → x ′ ] ′ for all x , y ∈ L . Then clearly ( L , ∨ , ∧ , → , ′ , 0 , m ) is an IADL. We can easily verify that A = { 0 , z } is an LI-ideal of L. Theorem 3.11 Let A be an LI-ideal of IADL L. If x ∈ A and y ≤ x for some ∈ L , then y ∈ A . Proof. Let A be an LI-ideal of IADL L. Suppose x ∈ A and y ≤ x for some y ∈ L . Claim: y ∈ A for some y ∈ L . Since y ≤ x implies ( y → x ) ′ = m ′ = 0 ∈ A then by definition of LI-ideal ( I 2 ) we have y ∈ A . □ Theorem 3.12 Let A be a non-empty subset of IADL L. Then A is an LI-ideal of L if and only if it satisfies for all x , y ∈ A and z ∈ L , ( z → x ) ′ ≤ y implies z ∈ A . Proof. Suppose that A is an LI-ideal and x , y ∈ A , z ∈ L . If ( z → x ) ′ ≤ y , then ( z → x ) ′ ∈ A by Theorem 3.11 . Using definition 3.8 ( I 2 ) we obtain z ∈ A . Conversely, suppose that for all x , y ∈ A and z ∈ L , ( z → x ) ′ ≤ y implies z ∈ A . Since A is a non empty subset of L, we assume x ∈ A . Because ( 0 → x ) ′ ≤ x , we have 0 ∈ A , and so I 1 holds for A. Let ( x → y ) ′ ∈ A and y ∈ A . Since ( x → y ) ′ ≤ ( x → y ) ′, we have x ∈ A , and so ( I 2 ) holds for A. Hence, A is an LI-ideal of L. □ Theorem 3.13 Let L be an IADL. Every LI-ideal of L is an ADL ideal of L. Proof. Let A be an LI-ideal of IADL L. i. Let x , y ∈ A . Claim: x ∨ y ∈ A . Now ( ( x ∨ y ) → y ) ′ = ( ( ( x → y ) → y ) → y ) ′ = ( x → y ) ′ ≤ ( x ′ ) ′ = x (since ( x → y ) ′ → x = x ′ → ( x → y ) = x → ( x ′ → y ) = y ′ → ( x → x ) = m ) . This implies ( ( x ∨ y ) → y ) ′ ∈ A (by Theorem 3.11 ). Thus x ∨ y ∈ A (by Definition 3.8 ( I 2 )). ii. Suppose a ∈ A and x ∈ L . Claim: a ∧ x ∈ A . Now ( ( a ∧ x ) → a ) ′ = ( ( a → a ) ∨ ( x → a ) ) ′ = ( m ∨ ( x → a ) ) ′ = m ′ = 0 ∈ A . This implies a ∧ x ∈ A . Hence, from (i) and (ii) A is an ADL ideal of L. □ Remark 3.14 The converse of Theorem 3.13 is not true. Consider Example 3.10 . The set A = { 0 , w} is an ADL ideal. But it is not an LI-ideal since ( x → w ) ′ = w ∈ A and ∉ A . □ Now we have the following characterization. Theorem 3.15 In H-IADL L, every ADL ideal is an LI-ideal. Proof. Let x , y ∈ L and A be an ADL ideal of H-IADL L. Assume that y ∈ A and ( x → y ) ′ ∈ A . We want to show that x ∈ A . Clearly 0 ∈ A . From Corollary 3.7 , we have x ∨ y = y ∨ ( x → y ) ′ . Then it follows from Definition 2.3 (ii) that x ∨ y = y ∨ ( x → y ) ′ ∈ A . Since x = ( x ∨ y ) ∧ x ∈ A , then we have x ∈ A . Hence A is an LI-ideal of L. □ Lemma 3.16 Let A be a non empty subset of H-IADL L. Then A is an LI-ideal of L if and only if for every x , y ∈ L , x , y ∈ A if and only if x ∨ y ∈ A . Proof. Suppose A is an LI-ideal of H-IADL L. Let x , y ∈ A . Since ( ( x ∨ y ) → y ) ′ = ( ( x → y ) ∧ ( y → y ) ) ′ = 0 ∈ A and A is an LI-ideal, then we have x ∨ y ∈ A . Also ( x → ( x ∨ y ) ) ′ = m ′ = 0 ∈ A implies x ∈ A as A is an LI-ideal. Conversely suppose x , y ∈ A if and only if x ∨ y ∈ A and ( x → y ) ′ ∈ A trivially x ∈ A . Hence, A is an LI-ideal. For any A and B of IADL L we set A ∧ B = { a ∧ b | a ∈ A and b ∈ B }. Theorem 3.17 If A and B are LI-ideals of an H-IADL of L, then so is A ∧ B . Proof. Let A and B be two LI-ideals of H-IADL L. Let x , y ∈ A ∧ B . Then x = a 1 ∧ b 1 for a 1 ∈ A and b 1 ∈ B and y = a 2 ∧ b 2 for a 2 ∈ A and b 2 ∈ B . Now x ∨ y = ( a 1 ∧ b 1 ) ∨ ( a 2 ∧ b 2 ) = (( a 1 ∧ b 1 ) ∨ a 2 ) ∧ (( a 1 ∧ b 1 ) ∨ b 2 ) ∈ A ∧ B as (( a 1 ∧ b 1 ) ∨ a 2 ∈ A and ( ( a 1 ∧ b 1 ) ∨ b 2 ) ∈ B . Thus , x ∨ y ∈ A ∧ B . Conversely assume x ∨ y ∈ A ∧ B for all x , y ∈ L . Then x ∨ y = a ∧ b for some a ∈ A and b ∈ B . We observe that x = x ∧ ( x ∨ y ) = x ∧ ( a ∧ b ) ≤ a ∈ A implies x ∈ A . Similarly one can show that x ∈ B and that y ∈ A and y ∈ B . Thus x , y ∈ A ∧ B . Hence, A ∧ B is an LI-ideal of L . □ Theorem 3.18 If A and B are LI-ideals of an H-IADL L, then A ∧ B = A ∩ B . Proof. Let x ∈ A ∧ B . Then x = a ∧ b for some a ∈ A and b ∈ B . Since x = b ∧ a ≤ a ∈ A implies a ∧ b ∈ A (as A is an ADL ideal by Theorem 3.15 and properties of ideal in ADL) and x = a ∧ b ≤ b ∈ B , then from Theorem 3.11 , x ∈ A and also x ∈ B and hence x ∈ A ∩ B . Therefore, A ∧ B ⊆ A ∩ B . Conversely suppose x ∈ A ∩ B then x = x ∧ x ∈ A ∧ B . Therefore, A ∩ B ⊆ A ∧ B . Hence, A ∧ B = A ∩ B . □ Theorem 3.19 If A is an LI-ideal of an H-IADL L and a ∈ L , then the set K = { x ∈ L | x ′ → a ∈ A } is an LI-idel of L. Proof Let x , y ∈ K . Then x ′ → a ∈ A and y ′ → a ∈ A . Using Theorem 2.13 that ( x ∨ y ) ′ → a = ( x ′ ∧ y ′ ) → a = ( x ′ → a ) ∨ ( y ′ → a ) ∈ A (by Theorem 3.24) so that x ∨ y ∈ K . Conversely let x , y ∈ L be such that x ∨ y ∈ K . Then ( x ∨ y ) ′ → a ∈ A . Using Theorem 2.12 and Theorem 3.3 , we have ( x ∨ y ) ′ → a = a ′ → ( x ∨ y ) ) = a ′ → ( ( x → y ) → y ) = ( a ′ → ( x → y ) ) → ( a ′ → y ) = ( a ′ → x ) → ( a ′ → y ) → ( a ′ → y ) = ( a ′ → x ) ∨ ( a ′ → y ) = ( x ′ → a ) ∨ ( y ′ → a ) . Thus ( x ′ → a ) ∨ ( y ′ → a ) ∈ A which implies that x ′ → a ∈ A and y ′ → a ∈ A because A is an LI-ideal of H-IADL and Lemma 3.16 . This implies that x ∈ K and y ∈ K . Hence by Theorem 2.13, K is an LI-ideal of L. Proposition 3.20 Let L be an H-IADL and a ∈ L .Then there is no proper LI-ideal of L containing a and a ′ simultaneously. Proof. Let A be a proper LI-ideal of H-IADL L containing a and a′ simultaneously. Then m = a ∨ a ′ ∈ A , and hence A = L a contradiction. Therefore, A is not a proper LI-ideal of H-IADL L containing a and a′ simultaneously. □ For any non-empty subset A of an IADL L, we define A ′ = { x ′ | x ∈ A } . It is obvious that every non empty subset A of IADL L is not a filter. Similarly the set A ′ for every subset A of L is not an LI-ideal in general. In fact the dual concept of a filter is one of an LI-ideal in IADL. Then we have the following theorem to verify this ideal. Theorem 3.21 Let A be a non empty subset of IADL L. Then A is a filter of L if and only if A′ is an LI-ideal of L. Proof. Assume that A is a filter of IADL L. Then m ∈ A , and so m ′ = 0 ∈ A ′ . Let ( x → y ) ′ ∈ A ′ and y ∈ A ′ for all x , y ∈ L . Then ( x → y ) ′ = u ′ and y = v ′ for some u , v ∈ A . Thus v → x ′ = x → v ′ = x → y = ( ( x → y ) ′ ) ′ = ( u ′ ) ′ = u ∈ A . Since A is a filter, we have x ′ ∈ A and so x = ( x ′ ) ′ ∈ A ′ . This proves that A′ is an LI-ideal of L. Conversely let x , y ∈ L be such that x ∈ A and x → y ∈ A . We want to show y ∈ A . Suppose that A′ is an LI-ideal of L. Then x ′ ∈ A ′ and ( y ′ → x ′ ) ′ = ( x → y ) ′ ∈ A ′. As A′ is an LI-ideal, it follows from Definition 3.8 ( I 2 ) that y ′ ∈ A ′ or y ∈ A . Also 0 ′ = m ∈ A . Hence, A is a filter of L. □ Theorem 3.22 Suppose { B i : i ∈ J } for index set J is a non-empty family of LI-ideal of IADL L. Then A = ∩ i ∈ J B i is also an LI-ideal of L, for any i ∈ J of index set J. Proof. Let A = { B i : B i is an LI − ideal of L } . We need to show A = ∩ i∈J B i is also an LI-ideal of L . 1. Clearly 0 ∈ B i for each ∈ J . This implies 0 ∈ ∩ i ∈ J B i 2. Since ( x → y ) ′ ∈ B i and y ∈ B i implies x ∈ B i for each i ∈ J , then ( x → y ) ′ ∈ ∩ i ∈ J Bi and y ∈ ∩ i ∈ J B i implies x ∈ ∩ i ∈ J B i . Therefore, A = ∩ i ∈ J B i is an LI-ideal of L .□ Let A be a subset of an IADL L . Then the least LI-ideal containing A is called the LI-ideal generated by A , written ⟨ A ⟩ . From Remark 3.14 , L is clearly an LI- ideal Containing A . If A = { a } , ⟨ { a } ⟩ is written ⟨ a ⟩ . In short we shall write [ a 1 , a 2 , a 3 , · · ·, a n , x ] for a 1 → ( a 2 → (· · · → ( a n → x ) · · ·), and write [ a n , x ] if a 1 = a 2 = · · · = a n = a. So in our case we define ⟨ A ⟩ = { x ∈ L | a n ′ → ( · · ( a 1 ′ → x ′ ) ⋯ ) = m for some a 1 , · · ·, a n ∈ A } and ⟨ a ⟩ = { x ∈ L [ ( a ′ ) n , x ′ ] = m for some n ∈ N } . For any natural number n we define n ( x ) → y recursively as follows: 1( x ) → y = x → y and ( n + 1)( x ) → y = x → ( n ( x ) → y ). Using definition 2.11 (3) repeatedly, we know that the following identity in IADL holds: i. z → ( y 1 → ( y 2 → (· · · ( y n → x ) · · ·))) = y 1 → ( y 2 → (· · · ( y n → ( z → x ) · · ·)). As a special case of (i) we have ii. z → ( n ( y ) → x ) = n ( y ) → ( z → x ) . □ In the following theorem we can describe elements of ⟨ A ⟩ . Theorem 3.23 If A is a non-empty subset of an IADL L, then ⟨ A ⟩ = {x ∈ L | a 1 ′ → ⋯ ( a ′ 1 → x ′ ) · · ·) = m for some a 1 , · · ·, a n ∈ A } is the least LI-idea of L containing. Proof. Let us denote U = { x ∈ L | ( a ′ n → (· · · ( a 1 ′ → x′ ) · · · ) = m for some a 1 , · · ·, a n ∈ A }. We claim U = ⟨ A ⟩ . That is, we need to prove 1) ⊆ U , 2) U is an LI-ideal, 3) U ⊆ V for any LI-ideal V containing A. To prove (1). Since A is non-empty there exists a ∈ A such a ′ → a ′ = m . This is implies a ∈ 1 U. Therefore, ⊆ U . To prove 2) For a ∈ A , a ′ → 0 ′ = m implies 0 ∈ U . Let ( x → y ) ′ ∈ U and y ∈ U , then there exists a i ∈ A ( i = 1 , 2 , 3 , ⋯ , n ) and b j ∈ A ( j = 1 , 2 , 3 , · · ·, p ) such that a′ → ( · · · ( a′ → (( x → y )′) ′ · · · ) = m …( ∗ ) . b p ′ → ( · · · ( b 1 ′ → y′ ) · · · ) = m …( ∗ ∗ ) . From ( ∗ ) , we have a n ′ → (· · · (a′ →(( y′ → x′ ) · · · ) = m … ( ∗ ∗ ∗ ) . This implies y′ ≤ a n ′ → ( · · · ( a1 ′ → x′ ) · · · ) … ( ∗ ∗ ∗ ∗ ) Combining ( ∗ ∗ ) , ( ∗ ∗ ∗ ∗ ) and properties of IADL, we get m = b p ′ → ( · · · ( b 1 ′ →y′ ) · · · ) ≤ b p ′ → ( · · · ( b 1 ′ →→ ( · · · ( a 1 ′ → x′ ) · · · ))) · · · ) and hence b p ′ → (· · · ( b 1 ′ →( a n ′ → ( ·· · ( a′→ x′ ) · · · ))) · · · ) = m. This shows that ∈ U . Therefore, U is an LI-ideal of L containing A. To prove 3) Let V be an LI- ideal containing A and let ∈ U . Then ( a n ′ → ( · · · ( a 1 ′ → x′ ) · · · ) = m for some a 1 , ⋯ , a n ∈ A . Thus m = ( a n ′ → (( a n − 1 ′ → ( · · · ( a 1 ′ → x′ ) · · · ))= ( a n ′ → (( a n − 1 ′ → ( · · · ( a 1 ′ → x′ ) · · · ))) = ( a n − 1 ′ → a 1 ′ → ( · · a 1 ′ → x ′ ) · · )) →a n , which implies that (( a n − 1 ′ → ( · · · ( a 1 ′ → x′ ) · · · )) ′ → a n )′ = m ′ = 0 ∈ V . Since a n ∈ A ⊆ V and V is an LI-ideal of L, we have ( a n − 1 ′ → ( · · · ( a 1 ′ →x′ ) · · · ) ) ′ ) ′ ∈ V . Now ( a n − 1 ′ → ( · · · ( a 1 ′ → x′ ) · · · ))′ = ( a n − 2 ′ → ( · · · ( a 1 ′ → x′ ) → a n− 1 ) · · · ))′, since a n − 1 ∈ A ⊆ V , it follows from Definition 3.16 I 2 that ( a n − 2 ′ → ( · · · ( a′→ x′ ) · · · ) ) ′ ∈ V . Repeating the process we conclude that ( x → a ) ′ = m ′ = 0 ∈ V and ∈ V . As V is an LI-ideal of L we have ∈ V . This proves that U ⊆ V , hence U = ⟨ A ⟩ . That is, U is the least LI-ideal containing A . □ The following corollary is immediate from Theorem 3.23 . Corollary 3.24 For any element a of an IADL L, we have ⟨ a ⟩ = { x ∈ L : n ( a ′ ) → x ′ = m for some natural number n }. Theorem 3.25 Let A be an an LI-ideal of IADL L and a ∈ L . Then ⟨ A ∪ { a } ⟩ = { x ∈ L | ( n ( a ′ ) → x ′ ) ′ ∈ A for some n ∈ N } . Proof. Let A be an LI-ideal of IADL L and a ∈ L . Consider A a = { x ∈ L | ( n ( a ′ ) → x ′ ) ′ ∈ A for some n ∈ N } . Since ( n ( a ′ ) → 0 ′ ) ′ = 0 ∈ A , then 0 ∈ A a . Let ( y → x ) ′ ∈ A a and x ∈ A a . Then there exist m , n ∈ N such that ( n ( a ′ ) → ( ( y → x ) ′ ) ′ ) ′ ∈ A and ( m ( a ′ ) → x ′ ) ′ ∈ A . It follows that ( n ( a ′ ) → ( y → x ) ) ′ = u and ( m ( a ′ ) → x ′ ) ′ = v for some u , v ∈ A , so that u ′ = n ( a ′ ) → ( y → x ) and v ′ = m ( a ′ ) → x ′ . Then m = u ′ → u ′ = u ′ → ( n ( a ′ ) → ( y → x ) ) = u ′ → ( n ( a ′ ) → ( x ′ → y ′ ) ) = u ′ → ( x ′ → ( n ( a ′ ) → y ′ ) ) = x ′ → ( u ′ → ( n ( a ′ ) → y ′ ) ) , i . e . , x ′ ≤ u ′ → ( n ( a ′ ) → y ′ ) . Using Theorem 2.12 v ′ = m ( a ′ ) → x ′ ≤ m ( a ′ ) → ( u ′ → ( n ( a ′ ) → y ′ ) ) = u ′ → ( m ( a ′ ) → ( n ( a ′ ) → y ′ ) ) = u ′ → ( ( m + n ) ( a ′ ) → y ′ ) , which implies that v ′ → ( u ′ → ( ( ( m + n ) ( a ′ ) → y ′ ) ′ ) ′ ) = v ′ → ( u ′ → ( ( m + n ) ( a ′ ) → y ′ ) ) = m . Since u , v ∈ A , it follows from Theorem 3.23 that ( ( m + n ) ( a ′ ) → y ′ ) ′ ∈ ⟨ A ⟩ = A . Hence y ∈ Aa and A a is LI-ideal of L. Since ( n ( a ′ ) → a ′ ) ′ = m ′ = 0 ∈ A , then a ∈ A a . Let x ∈ A . Since x ′ ≤ a ′ → x ′ = ( ( a ′ → x ′ ) ′ ) ′ , it follows from Theorem 3.19 that ( a ′ → x ′ ) ′ ∈ A i.e., x ∈ A a and so A ⊆ A a . Thus A ∪ { a } ⊆ A a . Finally we show that A a is the least LI-ideal containing A and a. Let B be any LI-ideal containing A and a, and let x ∈ A a . Then ( n ( a ′ ) → x ′ ) ′ ∈ A ⊆ B for some n ∈ N , and hence ( ( ( n − 1 ) ( a ′ ) → x ′ ) ) ′ → a ) ′ = ( a ′ → ( ( n − 1 ) ( a ′ ) → x ′ ) ) ′ = ( n ( a ′ ) → x ′ ) ′ ∈ B . Since a ∈ B it follows from definition of LI-ideal we have ( n − 1 ) ( a ′ ) → x ′ ) ′ ∈ B . Repeating this process we obtain x = ( x ′ ) ′ ∈ B . Therefore, A a is the least LI- ideal containing A a and a , i.e., ⟨ A ∪ { a } ⟩ = A a . Lemma 3.26 Let L be an IADL and a , b , x ∈ L .If n ( a ) → x = m and m ( b ) → x = m for some n , m ∈ N , then there exists k ∈ N such that k ( a ∨ b ) → x = m Theorem 3.27 Let A be an LI-ideal of an IADL L. Then ⟨ A ∪ { a } ⟩ ∩ ⟨ A ∪ { b } ⟩ = ⟨ A ∪ { a ∧ b } ⟩ for all a , b ∈ L . Proof. Let x ∈ ⟨ A ∪ { a } ⟩ ∩ ⟨ A ∪ { b } ⟩ . By Theorem 3.23 , there are m , n ∈ N such that ( n ( a ′ ) → x ′ ) ′ ∈ A and ( m ( b ′ ) → x ′ ) ′ ∈ A . Hence (n(a′) → x′)′ = u and (m(b′) → x′)′ = v for some u , v ∈ A . It follows that n ( a ′ ) → x ′ = u ′ and m ( b ′ ) → x ′ = v ′ so that m = v ′ → ( u ′ → ( n ( a ′ ) → x ′ ) ) = m ( a ′ ) → ( v ′ → ( u ′ → x ′ ) ) and m = u ′ → ( v ′ → ( m ( b ′ ) → x ′ ) ) = m ( b ′ ) → ( v ′ → ( u ′ → x ′ ) ) . Using Lemma 3.26 , there exists k ∈ N such that k ( a ′ ∨ b ′ ) → ( v ′ → ( u ′ → x ′ ) ) = m . Since a ′ ∨ b ′ = ( a ∧ b ) ′ , we have m = k ( a ′ ∨ b ′ ) → ( v ′ → ( u ′ → x ′ ) ) = k ( a ∧ b ) ′ → ( v ′ → ( u ′ → x ′ ) ) = v ′ → ( u ′ → ( k ( ( a ∧ b ) ′ → x ′ ) ) . Applying Theorem 3.21 we get ( k ( ( a ∧ b ) ′ ) ′ ) ′ ∈ ⟨ A ⟩ = A and hence x ∈ ⟨ A ∪ { a ∧ b } ⟩ by Theorem 3.23 . Thus, ⟨ A ∪ { a } ⟩ ∩ ⟨ A ∪ { b } ⟩ ⊆ ⟨ A ∪ { a ∧ b } ⟩ . Conversely if x ∈ ⟨ A ∪ { a ∧ b } ⟩ , then ( n ( a ∧ b ) ′ → x ′ ) ′ ∈ A for some ∈ N . Since a ∧ b ≤ a , b , then a ′ ≤ ( a ∧ b ) ′ and b ′ ≤ ( a ∧ b ) ′ . Using Theorem 2.12 (10) repeatedly, we get n ( ( a ∧ b ) ′ ) → x ′ ≤ n ( a ′ ) → x ′ and n ( ( a ∧ b ) ′ ) → x ′ ≤ n ( b ′ ) → x ′ , which imply that ( n ( a ′ ) → x ′ ) ′ ≤ ( n ( ( a ∧ b ) ′ ) → x ′ ) ′ and ( n ( b ′ ) → x ′ ) ′ ≤ ( n ( ( a ∧ b ) ′ → x ′ ) ′ . Applying Theorem 3.19 , we get ( n ( a ′ ) → x ′ ) ′ ∈ A and n ( b ′ ) → x ′ ) ′ ∈ A , i.e., x ∈ ⟨ A ∪ { a } ⟩ and x ∈ ⟨ A ∪ { b } ⟩ . Hence, x ∈ ⟨ A ∪ { a } ⟩ ∩ ⟨ A ∪ { b } ⟩ and so ⟨ A ∪ { a ∧ b } ⟩ ⊆ ⟨ A ∪ { a } ⟩ ∩ ⟨ A ∪ { b } ⟩ . □ Let A be an LI-ideal of IADL L. We define a binary relation “ ∼ ” on L as follows: x ∼ y if and only if ( x → y ) ′ ∈ A and ( y → x ) ′ ∈ A for all x , y ∈ L . Lemma 3.28 The binary relation “∼” on IADL L is an equivalent relation on L. Proof. Let L be an IADL L such that x , y , z ∈ L and A be an LI-ideal of L . Then 1. x ∼ x ⇔ ( x → x ) ′ = m ′ = 0 ∈ A . This implies ∼ is reflexive on L . 2. x ∼ y ⇔ ( x → y ) ′ ∈ A and ( y → x ) ′ ∈ A if and only if ( y → x ) ′ ∈ A and ( x → y ) ′ ∈ A if and only if y ∼ x . Therefore ∼ is symmetric on L . 3. Assume x ∼ y and y ∼ z . We need to show that x ∼ z . Now x ∼ y and y ∼ z implies ( x → y ) ′ ∈ A and ( y → x ) ′ ∈ A , ( y → z ) ′ ∈ A and ( z → y ) ′ ∈ A . Since ( ( x → z ) ′ → ( x → y ) ′ ) ′ = ( ( x → y ) → ( x → z ) ) ′ ≤ ( y → z ) ′ it follows from Theorem 3.19 that ( ( x → y ) → ( x → z ) ) ′ ∈ A . Since ( x → y ) ′ ∈ A and A is LI-ideal of L , we have ( x → z ) ′ ∈ A . Similarly, ( ( z → x ) ′ → ( z → y ) ′ ) ′ = ( ( z → y ) → ( z → x ) ) ′ ≤ ( y → x ) ′ it also follows from Theorem 3.19 that ( z → x ) ′ ∈ A . Therefore x ∼ z . Hence ∼ is transitive on L . □ Proposition 3.29 If x ∼ u and y ∼ v in an LI-ideal A of IADL L, then ( x → y ) ∼ ( u → v ) for any x , y , u , v ∈ L . Proof. Let L be an IADL and x , y , u , v ∈ L . Assume that x ∼ u and y ∼ v of an LI-ideal A. Then ( x → u ) ′ ∈ A and ( u → x ) ′ ∈ A , ( y → v ) ′ ∈ A and ( v → y ) ′ ∈ A . Since ( ( x → y ) → ( x → v ) ) ′ ≤ ( y → v ) ′ and ( ( x → v ) → ( x → y ) ) ′ ≤ ( v → y ) ′ , it follows from Theorem 3.19 that ( ( x → y ) → ( x → v ) ) ′ ∈ A and ( ( x → v ) → ( x → y ) ) ′ ∈ A . This implies that ( x → y ) ∼ ( x → v ) … ( 1 ) . Similarly Since ( ( x → v ) → ( u → v ) ) ′ ≤ ( u → x ) ′ ∈ A and ( ( u → v ) → ( x → v ) ) ′ ≤ ( x → u ) ′ ∈ A , it follows from Theorem 3.19 that ( ( x → v ) → ( u → v ) ) ′ ∈ A and ( ( u → v ) → ( x → v ) ) ′ ∈ A . This implies ( x → v ) ∼ ( ( u → v ) …(2). From (1), (2) and transitivity of ∼ , We conclude that ( x → y ) ∼ ( u → v ) . □ Corollary 3.30 Let a ∼ b and c ∼ d . Then 1. a ′ ∼ b ′ 2. ( a ∨ c ) ∼ ( b ∨ d ) 3. ( a ∧ c ) ∼ ( b ∧ d ) Proof. Let a , b , c , d ∈ L for an LI-ideal A of IADL L. Assume a ∼ b and c ∼ d . Then 1. a ∼ b iff ( a → b ) ′ ∈ A and ( b → a ) ′ ∈ A iff ( b ′ → a ′ ) ′ ∈ A and ( a ′ → b ′ ) ′ ∈ A iff a ′ ∼ b ′ . 2. a ∼ b and c ∼ d implies ( a → c ) ∼ ( b → d ) from proposition 3.28. we also implies ( ( a → c ) → c ) ∼ ( ( b → d ) → d ) . Therefore a ∨ c ) ∼ ( b → d ) . 3. a ∼ b and c ∼ d implies ( a → c ) ∼ ( b → d ) . We also imply ( ( a → c ) → a ′ ) ∼ ( ( b → d ) → b ′ ) . Again we imply ( [ ( a → c ) → a ′ ] ′ ) ∼ ( [ b → d ) → b ′ ] ′ ) . Therefore ( a ∧ c ) ∼ ( b ∧ d ) . □ Theorem 3.31 The binary relation ∼ is a congruence relation on an IADL L. Proof. Using Lemma 3.28 , Proposition 3.29 and Corollary 3.30 , it is clear that ~ is a congruence relation on L . □ Now we have the following definition. Let A be an LI-ideal of IADL L . Then the equivalent class containing x is denoted by A x such that Ax = { y ∈ L | x ∼ y } and the set of all equivalent classes of L is denoted by L | A such that L | A = { Ax | x ∈ L } . Lemma 3.32 A 0 = A and A m = { y ∈ L | y ′ ∈ A } . Proof. ( y → 0 ) ′ = y ∈ A and ( 0 → y ) ′ ∈ A for all y ∈ L implies 0 ∼ y . This implies y ∈ A 0 . Therefore A ⊆ A 0 . Conversely, x ∈ A 0 ⇒ ( 0 → x ) ′ ∈ A and ( x → 0 ) ′ ∈ A ⇒ 0 ∈ A and x ∈ A ⇒ x ∈ A . Therefore, A 0 ⊆ A . Hence, A 0 = A. A m = { y ∈ L | m ∼ y } = { y ∈ L : ( m → y ) ′ ∈ A and ( y → m ) ′ ∈ A } = { y ∈ L : y ′ ∈ A and 0 ∈ A } = { y ∈ L : y ′ ∈ A } . □ Define binary operations “∪”, “∩”, “⇒” and unary operation “ N ” on L / A as follows: A x ∪ A y = A x ∨ y A x ∩ A y = A x ∧ y , A x ⇒ A y = A x → y , A x N = A x ′ for all A x , A y ∈ L | A . Then we have the following lemma. Lemma 3.33 Let L be an IADL and A be an LI-ideal of L. Then 1. ( L | A , ∪ , ∩ , A 0 , A m ) is a bounded ADL. 2. ( L | A , ∪ , ∩ , ⇒ , N , A 0 , A m ) is an IADL which is called quotient implicative ADL. Proof. Let L be an IADL and A be an LI-ideal of L. Let A x , A y , A z ∈ L | A for all x , y , z ∈ L . Then 1. Since A 0 ∪ A x = A 0∨ x = A x and A 0 ∩ A x = A 0∧ x = A 0 , for all x ∈ L . This implies A 0 is the least element of L|A. Also A m ∪ A x = A m∨ x = A m and A m ∩ A x = A m ∧ x = A x , for all x ∈ L . This implies A m is the greatest element of L|A. Therefore, ( L | A , ∪ , ∩ , A 0 , A m ) is bounded. we can easily verify that ( L | A , ∪ , ∩ , A 0 , A m ) is an ADL. 2. To show ( L | A , ∪ , ∩ , ⇒ , N , A 0 , A m ) is an IADL, (a) A x ∪ A y = A x∨y = A (x→y)→y = ( A x ⇒ A y ) ⇒ A y (b) A x ∩ A y = A x ∧ y = [ A ( x → y ) → x ′ ] = A (x→y)→x ′ = ( Ax ⇒ Ay ) ⇒ Ax ′ = [( A x ⇒ A y ) ⇒ A N ] x N (c) A x ⇒ ( A y ⇒ A z ) = A x→(y→z) = A y→(x→z) = A y ⇒ ( A x ⇒ A z ) (d) A m ⇒ A x = A m→x = A x (e) A x ⇒ A m = A x→m = A m (f ) A x ⇒ A y = A x→y = A y ′ →x ′ = A y ′ ⇒ A x ′ = A y N ⇒ A x N (g) A 0 N = A 0 ′ = A m Therefore, ( L | A , ∪ , ∩ , ⇒ , N , A 0 , A m ) is quotient IADL. □ Conclusion Many scholars investigated ideals in lattice and ADL. Furthermore, LI-ideals in Lattice implication algebras are discussed by different researchers. For the advancement of many valued logical algebra we extend this notion to ADL concept. That is, first we investigated H-implicative almost distributive lattice. Then we discussed LI-ideals in IADL. Lastly, we found an interesting result that set theoretic LI-ideals is an LI-ideal and some characterization of LI-ideals in IADL. In the future we will have fuzzy version of this notion. Author contributions All the authors are contributed equally in this manuscript and also both authors read and approved the final manuscript. Ethics and consent Ethics and consent were not required. Data availability No data are associated with this article. References 1. Assaye B, Alamneh M, Mekonnen T: Implicative Almost Distributive Lattice. Int. J. Comput. Sci. Appl. Math. 2018; 4 (1): 19–22. 2. Assaye B, Alamneh M, Mekonnen T: Positive implicative and associative filters of implicative almost distributive lattice. Bull. Inter. Math. Virtual Inst. 2019; 9 (1): 111–119. 3. Jun YB: Implicative filters of lattice implication algebras. Bull. Korean Math. Soc. 1997; 34 (2): 193–198. 4. Jun YB, Roh EH, Xu Y: LI-ideals in lattice implication algebras. Bull. Korean Math. Soc. 1998; 35 (1): 13–24. 5. Kolluru V, Bekele B: Implicative algebras. Momona Ethiop. J. Sci. 2012; 4 (1): 90–101. Publisher Full Text 6. Swamy UM, Rao GC: Almost Distributive Lattices. J. Aust. Math. Soc. (Series A). 1981; 31 (1): 77–91. Publisher Full Text 7. Xu Y, Qin KY: Lattice H-implication algebras and lattice implication algebra classes. J. Hebin Mining Civil Eng. Institute. 1992; 2 : 139–143. 8. Xu Y: Lattice implication algebras. J. South West Jiaotong University. 1993; 28 (1): 20–27. 9. Xu Y, Ruan D, Qin KY, et al. : Lattice-Valued Logic: An Alternative Approach to Treat Fuzziness and Incomparability. Berlin: Springer; 2003. Comments on this article Comments (0) Version 1 VERSION 1 PUBLISHED 10 Feb 2025 ADD YOUR COMMENT Comment Author details Author details 1 Department of Mathematics, University of KabriDahar, Kabri Dahar, Somalie, Ethiopia 2 Department of Mathematics, Bahir Dar University College of Science, Bahir Dar, Amhara, 6000, Ethiopia Alachew Amaneh Mechderso Roles: Conceptualization, Writing – Original Draft Preparation, Writing – Review & Editing Tilahun Mekonnen Munie Roles: Conceptualization, Visualization, Writing – Review & Editing Competing interests No competing interests were disclosed. Grant information The author(s) declared that no grants were involved in supporting this work. Article Versions (1) version 1 Published: 10 Feb 2025, 14:182 https://doi.org/10.12688/f1000research.159175.1 Copyright © 2025 Mechderso AA and Munie TM. This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Download Export To Sciwheel Bibtex EndNote ProCite Ref. Manager (RIS) Sente metrics Views Downloads F1000Research - - PubMed Central info_outline Data from PMC are received and updated monthly. - - Citations open_in_new 0 open_in_new 0 open_in_new SEE MORE DETAILS CITE how to cite this article Mechderso AA and Munie TM. Li-ideals of implicative almost distributive lattices [version 1; peer review: 1 approved, 1 approved with reservations] . F1000Research 2025, 14 :182 ( https://doi.org/10.12688/f1000research.159175.1 ) NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS track receive updates on this article Track an article to receive email alerts on any updates to this article. TRACK THIS ARTICLE Share Open Peer Review Current Reviewer Status: ? Key to Reviewer Statuses VIEW HIDE Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Version 1 VERSION 1 PUBLISHED 10 Feb 2025 Views 0 Cite How to cite this report: Pelaitay G. Reviewer Report For: Li-ideals of implicative almost distributive lattices [version 1; peer review: 1 approved, 1 approved with reservations] . F1000Research 2025, 14 :182 ( https://doi.org/10.5256/f1000research.174866.r421472 ) The direct URL for this report is: https://f1000research.com/articles/14-182/v1#referee-response-421472 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 14 Oct 2025 Gustavo Pelaitay , Universidad Nacional de San Juan, San Juan, Argentina Approved with Reservations VIEWS 0 https://doi.org/10.5256/f1000research.174866.r421472 COMPREHENSIVE REVIEW REPORT The article "Li-ideals of implicative almost distributive lattices" presents a thoughtful and valuable investigation into lattice ideals within implicative almost distributive lattices. The authors have successfully extended the concept of LI-ideals from lattice ... Continue reading READ ALL COMPREHENSIVE REVIEW REPORT The article "Li-ideals of implicative almost distributive lattices" presents a thoughtful and valuable investigation into lattice ideals within implicative almost distributive lattices. The authors have successfully extended the concept of LI-ideals from lattice implication algebras to IADLs, introducing H-implicative almost distributive lattices and establishing important relationships between different algebraic structures. The work demonstrates strong mathematical reasoning and makes a genuine contribution to the field. DETAILED RESPONSES TO REVIEW QUESTIONS: 1. CLARITY OF PRESENTATION AND LITERATURE: The mathematical content is well-structured and technically sound. To make the work even more accessible, we suggest enhancing the transitions between sections and adding brief explanatory notes to help readers follow the technical developments. The reference list could be strengthened by including some recent work on ideals in residuated lattices, which would provide additional context for your contributions. 2. STUDY DESIGN AND TECHNICAL SOUNDNESS: The research approach is appropriate and the proofs are rigorous. The logical progression from definitions to main results follows good mathematical practice, and the examples effectively illustrate the concepts. 3. METHODS AND REPRODUCIBILITY: The paper contains all necessary mathematical elements. To help other researchers build upon this work, consider adding a brief overview in the introduction that outlines how the main results connect. Breaking down some of the more complex proofs into intermediate steps and including additional examples of key constructions would make the work even more approachable. 4. STATISTICAL ANALYSIS: Not applicable - this is appropriately a theoretical mathematical work. 5. SOURCE DATA AVAILABILITY: All necessary information is contained within the paper. 6. CONCLUSIONS: The conclusions are well-supported by the results and accurately reflect the research findings. SUGGESTIONS FOR ENHANCEMENT: We believe these adjustments would further strengthen your already solid work: - Expand the literature review to include connections to contemporary work in related algebraic structures - Add transitional explanations to guide readers through the technical developments - Consider providing additional examples that illustrate the practical implications of your theoretical results - Ensure consistent notation throughout the document OVERALL RECOMMENDATION: ACCEPT AFTER MINOR REVISIONS This paper makes a valuable contribution to lattice theory and algebraic logic. The mathematical foundation is strong and the results are meaningful. With attention to the suggested enhancements, this work will be an excellent addition to the literature and will be well-received by the research community. Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? No If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes Competing Interests: No competing interests were disclosed. Reviewer Expertise: Algebraic Logic I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Pelaitay G. Reviewer Report For: Li-ideals of implicative almost distributive lattices [version 1; peer review: 1 approved, 1 approved with reservations] . F1000Research 2025, 14 :182 ( https://doi.org/10.5256/f1000research.174866.r421472 ) The direct URL for this report is: https://f1000research.com/articles/14-182/v1#referee-response-421472 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Respond or Comment COMMENT ON THIS REPORT Views 0 Cite How to cite this report: Xu Y and Yi L. Reviewer Report For: Li-ideals of implicative almost distributive lattices [version 1; peer review: 1 approved, 1 approved with reservations] . F1000Research 2025, 14 :182 ( https://doi.org/10.5256/f1000research.174866.r368840 ) The direct URL for this report is: https://f1000research.com/articles/14-182/v1#referee-response-368840 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 21 Mar 2025 Yang Xu , Southwest Jiaotong University, Chengdu, China Liu Yi , College of Mathematics and Information Sciences, Neijiang Normal University, Neijiang, Sichuan, China Approved VIEWS 0 https://doi.org/10.5256/f1000research.174866.r368840 Ideals and Filters of two basic research direction in logical algebra. In current paper, authors investigated the LI-ideals of ADL concepts. For the advancement of many valued logical algebra we extend this notion to ADL concept. Firstly, authors investigated H-implicative almost distributive ... Continue reading READ ALL Ideals and Filters of two basic research direction in logical algebra. In current paper, authors investigated the LI-ideals of ADL concepts. For the advancement of many valued logical algebra we extend this notion to ADL concept. Firstly, authors investigated H-implicative almost distributive lattice; LI-ideals in IADL are discussed. Authors also found that set theoretic LI-ideals is an LI-ideal and some characterizations of LI-ideals in IADL. All results are soundness. The proofs are correct. So I think this paper can be accepted subjected to a minor revised. Some references regarding the ideals and filters in residued lattices should be added. Is the work clearly and accurately presented and does it cite the current literature? Partly Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? No If applicable, is the statistical analysis and its interpretation appropriate? I cannot comment. A qualified statistician is required. Are all the source data underlying the results available to ensure full reproducibility? No source data required Are the conclusions drawn adequately supported by the results? Yes Competing Interests: No competing interests were disclosed. Reviewer Expertise: logical algebras We confirm that we have read this submission and believe that we have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Xu Y and Yi L. Reviewer Report For: Li-ideals of implicative almost distributive lattices [version 1; peer review: 1 approved, 1 approved with reservations] . F1000Research 2025, 14 :182 ( https://doi.org/10.5256/f1000research.174866.r368840 ) The direct URL for this report is: https://f1000research.com/articles/14-182/v1#referee-response-368840 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Respond or Comment COMMENT ON THIS REPORT Comments on this article Comments (0) Version 1 VERSION 1 PUBLISHED 10 Feb 2025 ADD YOUR COMMENT Comment keyboard_arrow_left keyboard_arrow_right Open Peer Review Reviewer Status info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Reviewer Reports Invited Reviewers 1 2 Version 1 10 Feb 25 read read Yang Xu , Southwest Jiaotong University, Chengdu, China Liu Yi , Neijiang Normal University, Neijiang, China Gustavo Pelaitay , Universidad Nacional de San Juan, San Juan, Argentina Comments on this article All Comments (0) Add a comment Sign up for content alerts Sign Up You are now signed up to receive this alert Browse by related subjects keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2025 Pelaitay G. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 14 Oct 2025 | for Version 1 Gustavo Pelaitay , Universidad Nacional de San Juan, San Juan, Argentina 0 Views copyright © 2025 Pelaitay G. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (0) Approved With Reservations info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions COMPREHENSIVE REVIEW REPORT The article "Li-ideals of implicative almost distributive lattices" presents a thoughtful and valuable investigation into lattice ideals within implicative almost distributive lattices. The authors have successfully extended the concept of LI-ideals from lattice implication algebras to IADLs, introducing H-implicative almost distributive lattices and establishing important relationships between different algebraic structures. The work demonstrates strong mathematical reasoning and makes a genuine contribution to the field. DETAILED RESPONSES TO REVIEW QUESTIONS: 1. CLARITY OF PRESENTATION AND LITERATURE: The mathematical content is well-structured and technically sound. To make the work even more accessible, we suggest enhancing the transitions between sections and adding brief explanatory notes to help readers follow the technical developments. The reference list could be strengthened by including some recent work on ideals in residuated lattices, which would provide additional context for your contributions. 2. STUDY DESIGN AND TECHNICAL SOUNDNESS: The research approach is appropriate and the proofs are rigorous. The logical progression from definitions to main results follows good mathematical practice, and the examples effectively illustrate the concepts. 3. METHODS AND REPRODUCIBILITY: The paper contains all necessary mathematical elements. To help other researchers build upon this work, consider adding a brief overview in the introduction that outlines how the main results connect. Breaking down some of the more complex proofs into intermediate steps and including additional examples of key constructions would make the work even more approachable. 4. STATISTICAL ANALYSIS: Not applicable - this is appropriately a theoretical mathematical work. 5. SOURCE DATA AVAILABILITY: All necessary information is contained within the paper. 6. CONCLUSIONS: The conclusions are well-supported by the results and accurately reflect the research findings. SUGGESTIONS FOR ENHANCEMENT: We believe these adjustments would further strengthen your already solid work: - Expand the literature review to include connections to contemporary work in related algebraic structures - Add transitional explanations to guide readers through the technical developments - Consider providing additional examples that illustrate the practical implications of your theoretical results - Ensure consistent notation throughout the document OVERALL RECOMMENDATION: ACCEPT AFTER MINOR REVISIONS This paper makes a valuable contribution to lattice theory and algebraic logic. The mathematical foundation is strong and the results are meaningful. With attention to the suggested enhancements, this work will be an excellent addition to the literature and will be well-received by the research community. Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? No If applicable, is the statistical analysis and its interpretation appropriate? Not applicable Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes Competing Interests No competing interests were disclosed. Reviewer Expertise Algebraic Logic I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. reply Respond to this report Responses (0) Pelaitay G. Peer Review Report For: Li-ideals of implicative almost distributive lattices [version 1; peer review: 1 approved, 1 approved with reservations] . F1000Research 2025, 14 :182 ( https://doi.org/10.5256/f1000research.174866.r421472) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/14-182/v1#referee-response-421472 keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2025 Xu Y et al. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 21 Mar 2025 | for Version 1 Yang Xu , Southwest Jiaotong University, Chengdu, China Liu Yi , College of Mathematics and Information Sciences, Neijiang Normal University, Neijiang, Sichuan, China 0 Views copyright © 2025 Xu Y et al. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (0) Approved info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Ideals and Filters of two basic research direction in logical algebra. In current paper, authors investigated the LI-ideals of ADL concepts. For the advancement of many valued logical algebra we extend this notion to ADL concept. Firstly, authors investigated H-implicative almost distributive lattice; LI-ideals in IADL are discussed. Authors also found that set theoretic LI-ideals is an LI-ideal and some characterizations of LI-ideals in IADL. All results are soundness. The proofs are correct. So I think this paper can be accepted subjected to a minor revised. Some references regarding the ideals and filters in residued lattices should be added. Is the work clearly and accurately presented and does it cite the current literature? Partly Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? No If applicable, is the statistical analysis and its interpretation appropriate? I cannot comment. A qualified statistician is required. Are all the source data underlying the results available to ensure full reproducibility? No source data required Are the conclusions drawn adequately supported by the results? Yes Competing Interests No competing interests were disclosed. Reviewer Expertise logical algebras We confirm that we have read this submission and believe that we have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. reply Respond to this report Responses (0) Xu Y and Yi L. Peer Review Report For: Li-ideals of implicative almost distributive lattices [version 1; peer review: 1 approved, 1 approved with reservations] . F1000Research 2025, 14 :182 ( https://doi.org/10.5256/f1000research.174866.r368840) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/14-182/v1#referee-response-368840 Alongside their report, reviewers assign a status to the article: Approved - the paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations - A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved - fundamental flaws in the paper seriously undermine the findings and conclusions Adjust parameters to alter display View on desktop for interactive features Includes Interactive Elements View on desktop for interactive features Competing Interests Policy Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list: Examples of 'Non-Financial Competing Interests' Within the past 4 years, you have held joint grants, published or collaborated with any of the authors of the selected paper. You have a close personal relationship (e.g. parent, spouse, sibling, or domestic partner) with any of the authors. You are a close professional associate of any of the authors (e.g. scientific mentor, recent student). You work at the same institute as any of the authors. You hope/expect to benefit (e.g. favour or employment) as a result of your submission. You are an Editor for the journal in which the article is published. Examples of 'Financial Competing Interests' You expect to receive, or in the past 4 years have received, any of the following from any commercial organisation that may gain financially from your submission: a salary, fees, funding, reimbursements. You expect to receive, or in the past 4 years have received, shared grant support or other funding with any of the authors. You hold, or are currently applying for, any patents or significant stocks/shares relating to the subject matter of the paper you are commenting on. Stay Updated Sign up for content alerts and receive a weekly or monthly email with all newly published articles Register with F1000Research Already registered? Sign in Not now, thanks close PLEASE NOTE If you are an AUTHOR of this article, please check that you signed in with the account associated with this article otherwise we cannot automatically identify your role as an author and your comment will be labelled as a “User Comment”. If you are a REVIEWER of this article, please check that you have signed in with the account associated with this article and then go to your account to submit your report, please do not post your review here. If you do not have access to your original account, please contact us . All commenters must hold a formal affiliation as per our Policies . The information that you give us will be displayed next to your comment. User comments must be in English, comprehensible and relevant to the article under discussion. We reserve the right to remove any comments that we consider to be inappropriate, offensive or otherwise in breach of the User Comment Terms and Conditions . Commenters must not use a comment for personal attacks. When criticisms of the article are based on unpublished data, the data should be made available. I accept the User Comment Terms and Conditions Please confirm that you accept the User Comment Terms and Conditions. Affiliation ✕ refresh Please enter your institution. Note: To add your institution or organisation, start typing the name and then select the correct name from the list. Where applicable, the name will appear in both the original language and in English. Do not paste in the name. If the name does not appear in the drop-down list, we will display the information you have entered. ✕ refresh Country/Region * USA UK Canada China France Germany Afghanistan Aland Islands Albania Algeria American Samoa Andorra Angola Anguilla Antarctica Antigua and Barbuda Argentina Armenia Aruba Australia Austria Azerbaijan Bahamas Bahrain Bangladesh Barbados Belarus Belgium Belize Benin Bermuda Bhutan Bolivia Bosnia and Herzegovina Botswana Bouvet Island Brazil British Indian Ocean Territory British Virgin Islands Brunei Bulgaria Burkina Faso Burundi Cambodia Cameroon Canada Cape Verde Cayman Islands Central African Republic Chad Chile China Christmas Island Cocos (Keeling) Islands Colombia Comoros Congo Cook Islands Costa Rica Cote d'Ivoire Croatia Cuba Cyprus Czech Republic Democratic Republic of the Congo Denmark Djibouti Dominica Dominican Republic Ecuador Egypt El Salvador Equatorial Guinea Eritrea Estonia Ethiopia Falkland Islands Faroe Islands Federated States of Micronesia Fiji Finland France French Guiana French Polynesia French Southern Territories Gabon Georgia Germany Ghana Gibraltar Greece Greenland Grenada Guadeloupe Guam Guatemala Guernsey Guinea Guinea-Bissau Guyana Haiti Heard Island and Mcdonald Islands Holy See (Vatican City State) Honduras Hong Kong Hungary Iceland India Indonesia Iran Iraq Ireland Israel Italy Jamaica Japan Jersey Jordan Kazakhstan Kenya Kiribati Kosovo (Serbia and Montenegro) Kuwait Kyrgyzstan Lao People's Democratic Republic Latvia Lebanon Lesotho Liberia Libya Liechtenstein Lithuania Luxembourg Macao Madagascar Malawi Malaysia Maldives Mali Malta Marshall Islands Martinique Mauritania Mauritius Mayotte Mexico Minor Outlying Islands of the United States Moldova Monaco Mongolia Montenegro Montserrat Morocco Mozambique Myanmar Namibia Nauru Nepal Netherlands Antilles New Caledonia New Zealand Nicaragua Niger Nigeria Niue Norfolk Island North Korea North Macedonia Northern Mariana Islands Norway Oman Pakistan Palau Palestinian Territory Panama Papua New Guinea Paraguay Peru Philippines Pitcairn Poland Portugal Puerto Rico Qatar Reunion Romania Russian Federation Rwanda Saint Helena Saint Kitts and Nevis Saint Lucia Saint Pierre and Miquelon Saint Vincent and the Grenadines Samoa San Marino Sao Tome and Principe Saudi Arabia Senegal Serbia Seychelles Sierra Leone Singapore Slovakia Slovenia Solomon Islands Somalia South Africa South Georgia and the South Sandwich Is South Korea South Sudan Spain Sri Lanka Sudan Suriname Svalbard and Jan Mayen Swaziland Sweden Switzerland Syria Taiwan Tajikistan Tanzania Thailand The Gambia The Netherlands Timor-Leste Togo Tokelau Tonga Trinidad and Tobago Tunisia Turkey Turkmenistan Turks and Caicos Islands Tuvalu UK USA Uganda Ukraine United Arab Emirates United States Virgin Islands Uruguay Uzbekistan Vanuatu Venezuela Vietnam Wallis and Futuna West Bank and Gaza Strip Western Sahara Yemen Zambia Zimbabwe Please select your country/region. You must enter a comment. Competing Interests Please disclose any competing interests that might be construed to influence your judgment of the article's or peer review report's validity or importance. Competing Interests Policy Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list: Examples of 'Non-Financial Competing Interests' Within the past 4 years, you have held joint grants, published or collaborated with any of the authors of the selected paper. You have a close personal relationship (e.g. parent, spouse, sibling, or domestic partner) with any of the authors. You are a close professional associate of any of the authors (e.g. scientific mentor, recent student). You work at the same institute as any of the authors. You hope/expect to benefit (e.g. favour or employment) as a result of your submission. You are an Editor for the journal in which the article is published. Examples of 'Financial Competing Interests' You expect to receive, or in the past 4 years have received, any of the following from any commercial organisation that may gain financially from your submission: a salary, fees, funding, reimbursements. You expect to receive, or in the past 4 years have received, shared grant support or other funding with any of the authors. You hold, or are currently applying for, any patents or significant stocks/shares relating to the subject matter of the paper you are commenting on. Please state your competing interests The comment has been saved. An error has occurred. Please try again. Cancel Post var lTitle = "Li-ideals of implicative almost distributive...".replace("'", ''); var linkedInUrl = "http://www.linkedin.com/shareArticle?url=https://f1000research.com/articles/14-182/v1" + "&title=" + encodeURIComponent(lTitle) + "&summary=" + encodeURIComponent('Read the article by '); var deliciousUrl = "https://del.icio.us/post?url=https://f1000research.com/articles/14-182/v1&title=" + encodeURIComponent(lTitle); var redditUrl = "http://reddit.com/submit?url=https://f1000research.com/articles/14-182/v1" + "&title=" + encodeURIComponent(lTitle); linkedInUrl += encodeURIComponent('Mechderso AA and Munie TM'); var offsetTop = /chrome/i.test( navigator.userAgent ) ? 4 : -10; var addthis_config = { ui_offset_top: offsetTop, services_compact : "facebook,twitter,www.linkedin.com,www.mendeley.com,reddit.com", services_expanded : "facebook,twitter,www.linkedin.com,www.mendeley.com,reddit.com", services_custom : [ { name: "LinkedIn", url: linkedInUrl, icon:"/img/icon/at_linkedin.svg" }, { name: "Mendeley", url: "http://www.mendeley.com/import/?url=https://f1000research.com/articles/14-182/v1/mendeley", icon:"/img/icon/at_mendeley.svg" }, { name: "Reddit", url: redditUrl, icon:"/img/icon/at_reddit.svg" }, ] }; var addthis_share = { url: "https://f1000research.com/articles/14-182", templates : { twitter : "Li-ideals of implicative almost distributive lattices. Mechderso AA and Munie TM, published by " + "@F1000Research" + ", https://f1000research.com/articles/14-182/v1" } }; if (typeof(addthis) != "undefined"){ addthis.addEventListener('addthis.ready', checkCount); addthis.addEventListener('addthis.menu.share', checkCount); } $(".f1r-shares-twitter").attr("href", "https://twitter.com/intent/tweet?text=" + addthis_share.templates.twitter); $(".f1r-shares-facebook").attr("href", "https://www.facebook.com/sharer/sharer.php?u=" + addthis_share.url); $(".f1r-shares-linkedin").attr("href", addthis_config.services_custom[0].url); $(".f1r-shares-reddit").attr("href", addthis_config.services_custom[2].url); $(".f1r-shares-mendelay").attr("href", addthis_config.services_custom[1].url); function checkCount(){ setTimeout(function(){ $(".addthis_button_expanded").each(function(){ var count = $(this).text(); if (count !== "" && count != "0") $(this).removeClass("is-hidden"); else $(this).addClass("is-hidden"); }); }, 1000); } close How to cite this report {{reportCitation}} Cancel Copy Citation Details $(function(){R.ui.buttonDropdowns('.dropdown-for-downloads');}); $(function(){R.ui.toolbarDropdowns('.toolbar-dropdown-for-downloads');}); $.get("/articles/acj/159175/174866") new F1000.Clipboard(); new F1000.ThesaurusTermsDisplay("articles", "article", "174866"); $(document).ready(function() { $( "#frame1" ).on('load', function() { var mydiv = $(this).contents().find("div"); var h = mydiv.height(); console.log(h) }); var tooltipLivingFigure = jQuery(".interactive-living-figure-label .icon-more-info"), titleLivingFigure = tooltipLivingFigure.attr("title"); tooltipLivingFigure.simpletip({ fixed: true, position: ["-115", "30"], baseClass: 'small-tooltip', content:titleLivingFigure + " " }); tooltipLivingFigure.removeAttr("title"); $("body").on("click", ".cite-living-figure", function(e) { e.preventDefault(); var ref = $(this).attr("data-ref"); $(this).closest(".living-figure-list-container").find("#" + ref).fadeIn(200); }); $("body").on("click", ".close-cite-living-figure", function(e) { e.preventDefault(); $(this).closest(".popup-window-wrapper").fadeOut(200); }); $(document).on("mouseup", function(e) { var metricsContainer = $(".article-metrics-popover-wrapper"); if (!metricsContainer.is(e.target) && metricsContainer.has(e.target).length === 0) { $(".article-metrics-close-button").click(); } }); var articleId = $('#articleId').val(); if($("#main-article-count-box").attachArticleMetrics) { $("#main-article-count-box").attachArticleMetrics(articleId, { articleMetricsView: true }); } }); var figshareWidget = $(".new_figshare_widget"); if (figshareWidget.length > 0) { window.figshare.load("f1000", function(Widget) { // Select a tag/tags defined in your page. In this tag we will place the widget. _.map(figshareWidget, function(el){ var widget = new Widget({ articleId: $(el).attr("figshare_articleId") //height:300 // this is the height of the viewer part. [Default: 550] }); widget.initialize(); // initialize the widget widget.mount(el); // mount it in a tag that's on your page // this will save the widget on the global scope for later use from // your JS scripts. This line is optional. //window.widget = widget; }); }); } close Error Close Add Reset F1000.MICROSERVICES.AFFILIATION = ''; $(document).ready(function () { $('.js-affiliations-form').each((index, form) => { new AffiliationForm({ formId: form.id, institutionErrorSelector: '.comment-enter-institution', departmentErrorSelector: '.comment-enter-department', placeSelector: '.js-add-comment-place', stateSelector: '.js-add-comment-state', zipCodeSelector: '.js-add-comment-zipcode', countrySelector: '.js-add-comment-country', countryErrorSelector: '.comment-enter-country', }); }); }); $(document).ready(function () { var reportIds = { "367749": 0, "367751": 0, "367750": 0, "367757": 0, "367756": 0, "367758": 0, "367753": 0, "367752": 0, "367755": 0, "367754": 0, "418590": 0, "370205": 0, "418591": 0, "370204": 0, "370207": 0, "370206": 0, "370201": 0, "370200": 0, "370203": 0, "370202": 0, "418598": 0, "418596": 0, "418597": 0, "418594": 0, "370209": 0, "418595": 0, "370208": 0, "418592": 0, "418593": 0, "366133": 0, "366135": 0, "366134": 0, "366141": 0, "366140": 0, "366142": 0, "366137": 0, "366136": 0, "366139": 0, "366138": 0, "368839": 0, "368845": 0, "368844": 0, "368847": 0, "368846": 0, "368841": 0, "368840": 6, "368843": 0, "368842": 0, "368848": 0, "421470": 0, "421471": 0, "421469": 0, "421478": 0, "421476": 0, "421477": 0, "421474": 0, "421475": 0, "421472": 10, "421473": 0, }; $(".referee-response-container,.js-referee-report").each(function(index, el) { var reportId = $(el).attr("data-reportid"), reportCount = reportIds[reportId] || 0; $(el).find(".comments-count-container,.js-referee-report-views").html(reportCount); }); var uuidInput = $("#article_uuid"), oldUUId = uuidInput.val(), newUUId = "0e4ed011-9b57-43ea-9603-a1f62cbd1b06"; uuidInput.val(newUUId); $("a[href*='article_uuid=']").each(function(index, el) { var newHref = $(el).attr("href").replace(oldUUId, newUUId); $(el).attr("href", newHref); }); }); An innovative open access publishing platform offering rapid publication and open peer review, whilst supporting data deposition and sharing. Browse Gateways Collections How it Works Contact For Developers Cookie Notice Privacy Notice RSS Submit Your Research Follow us © 2012-2026 F1000 Research Ltd. ISSN 2046-1402 | Legal | Partner of Research4Life • CrossRef • ORCID • FAIRSharing R.templateTests.simpleTemplate = R.template(' $text $text $text $text $text '); R.templateTests.runTests(); var F1000platform = new F1000.Platform({ name: "f1000research", displayName: "F1000Research", hostName: "f1000research.com", id: "1", editorialEmail: "[email protected]", infoEmail: "[email protected]", usePmcStats: true }); $(function(){R.ui.dropdowns('.dropdown-for-authors, .dropdown-for-about, .dropdown-for-myresearch');}); // $(function(){R.ui.dropdowns('.dropdown-for-referees');}); $(document).ready(function () { if ($(".cookie-warning").is(":visible")) { $(".sticky").css("margin-bottom", "35px"); $(".devices").addClass("devices-and-cookie-warning"); } $(".cookie-warning .close-button").click(function (e) { $(".devices").removeClass("devices-and-cookie-warning"); $(".sticky").css("margin-bottom", "0"); }); $("#tweeter-feed .tweet-message").each(function (i, message) { var self = $(message); self.html(linkify(self.html())); }); $(".partner").on("mouseenter mouseleave", function() { $(this).find(".gray-scale, .colour").toggleClass("is-hidden"); }); }); Sign In Remember me Forgotten your password? Sign In Cancel Email or password not correct. Please try again Please wait... $(function(){ // Note: All the setup needs to run against a name attribute and *not* the id due the clonish // nature of facebox... $("a[id=googleSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("GOOGLE"); $("form[id=oAuthForm]").submit(); }); $("a[id=facebookSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("FACEBOOK"); $("form[id=oAuthForm]").submit(); }); $("a[id=orcidSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("ORCID"); $("form[id=oAuthForm]").submit(); }); }); If you've forgotten your password, please enter your email address below and we'll send you instructions on how to reset your password. The email address should be the one you originally registered with F1000. Email address not valid, please try again You registered with F1000 via Google, so we cannot reset your password. To sign in, please click here . If you still need help with your Google account password, please click here . You registered with F1000 via Facebook, so we cannot reset your password. To sign in, please click here . If you still need help with your Facebook account password, please click here . Code not correct, please try again Reset password Cancel Email us for further assistance. Server error, please try again. If your email address is registered with us, we will email you instructions to reset your password. If you think you should have received this email but it has not arrived, please check your spam filters and/or contact for further assistance. Please wait... Register $(document).ready(function () { signIn.createSignInAsRow($("#sign-in-form-gfb-popup")); $(".target-field").each(function () { var uris = $(this).val().split("/"); if (uris.pop() === "login") { $(this).val(uris.toString().replace(",","/")); } }); });