<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-29T18:09:28Z</responseDate><request verb="GetRecord" identifier="oai:repisalud.isciii.es:20.500.12105/23734" metadataPrefix="marc">https://repisalud.isciii.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:repisalud.isciii.es:20.500.12105/23734</identifier><datestamp>2024-11-28T19:31:11Z</datestamp><setSpec>com_20.500.12105_15322</setSpec><setSpec>com_20.500.12105_2051</setSpec><setSpec>col_20.500.12105_16967</setSpec></header><metadata><record xmlns="http://www.loc.gov/MARC21/slim" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd">
   <leader>00925njm 22002777a 4500</leader>
   <datafield ind2=" " ind1=" " tag="042">
      <subfield code="a">dc</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="720">
      <subfield code="a">Munar, Marc</subfield>
      <subfield code="e">author</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="720">
      <subfield code="a">Massanet, Sebastia</subfield>
      <subfield code="e">author</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="720">
      <subfield code="a">Ruiz-Aguilera, Daniel</subfield>
      <subfield code="e">author</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="260">
      <subfield code="c">2023</subfield>
   </datafield>
   <datafield ind2=" " ind1=" " tag="520">
      <subfield code="a">The computation of a closed formula for the cardinality of some discrete connectives has received the interest of the research community since the beginning of this class of operators. This paper constitutes a substantial progress in this topic. First, monotonicities and other properties of discrete connectives are related to plane partitions, a concept deeply studied in the field of combinatorics. Second, the already known expressions on the cardinality of plane partitions are adapted to the concrete properties of discrete connectives. With this, we establish closed formulas for discrete negations and some binary discrete connectives; concretely, discrete conjunctions, disjunctions and implications. As well, we establish formulas for the cardinality of some sets of implications satisfying several additional properties known in the literature.</subfield>
   </datafield>
   <datafield ind1="8" ind2=" " tag="024">
      <subfield code="a">Munar M, Massanet S, Ruiz-Aguilera D. On the cardinality of some families of discrete connectives. Inf Sci (Ny). 2023 Apr;621:708-28.</subfield>
   </datafield>
   <datafield ind1="8" ind2=" " tag="024">
      <subfield code="a">10.1016/j.ins.2022.10.121</subfield>
   </datafield>
   <datafield ind1="8" ind2=" " tag="024">
      <subfield code="a">0020-0255</subfield>
   </datafield>
   <datafield ind1="8" ind2=" " tag="024">
      <subfield code="a">Information Sciences</subfield>
   </datafield>
   <datafield ind1="8" ind2=" " tag="024">
      <subfield code="a">https://hdl.handle.net/20.500.13003/18692</subfield>
   </datafield>
   <datafield ind1="8" ind2=" " tag="024">
      <subfield code="a">https://hdl.handle.net/20.500.12105/23734</subfield>
   </datafield>
   <datafield ind1="8" ind2=" " tag="024">
      <subfield code="a">901785200017</subfield>
   </datafield>
   <datafield ind2="0" ind1="0" tag="245">
      <subfield code="a">On the cardinality of some families of discrete connectives</subfield>
   </datafield>
</record></metadata></record></GetRecord></OAI-PMH>