<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0411462</ARLID> <utime>20240103182329.4</utime><mtime>20060210235959.9</mtime>        <title language="eng" primary="1">Sufficient triangular norms in many-valued logics with standard negation</title>  <specification> <page_count>21 s.</page_count> </specification>   <serial><ARLID>cav_un_epca*0256186</ARLID><ISSN>0933-5846</ISSN><title>Archive for Mathematical Logic</title><part_num/><part_title/><volume_id>14</volume_id><volume>44 (2005)</volume><page_num>829-849</page_num><publisher><place/><name>Springer</name><year/></publisher></serial>   <title language="cze" primary="0">Postačující triangulární normy v mnohahodnotových logikách se standardní negací</title>    <keyword>many-valued logic</keyword>   <keyword>sufficient t-norm</keyword>   <keyword>involution negation</keyword>   <keyword>admisible function</keyword>   <keyword>t-norm based tribe</keyword>    <author primary="1"> <ARLID>cav_un_auth*0213273</ARLID> <name1>Butnariu</name1> <name2>D.</name2> <country>IL</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0208902</ARLID> <name1>Klement</name1> <name2>E.P.</name2> <country>AT</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0101163</ARLID> <name1>Mesiar</name1> <name2>Radko</name2> <institution>UTIA-B</institution> <full_dept>Department of Econometrics</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0019127</ARLID> <name1>Navara</name1> <name2>M.</name2> <country>CZ</country>  </author>     <COSATI>12A</COSATI>    <cas_special> <project> <project_id>GA402/04/1026</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0001809</ARLID> </project> <research> <research_id>CEZ:AV0Z10750506</research_id> </research>  <abstract language="eng" primary="1">In many-valued logics with the unit interval as the set of truth values, from the standard negation and the product all measurable logical functions can be derived, provided that also operations with countable arity are allowed. The question remained open whether there are other t-norms with this property or whether all strict t-norms possess this property. We give a full solution to this problem (in the case of strict t-norms) together with convenient sufficient conditions.</abstract> <abstract language="cze" primary="0">V mnohahodnotových logikách s jednotkovým intervalem pravdivých hodnot je možné odvodit všechny měřitelné logické funkce ze standardní negace a logického součinu, pokud jsou přípustné také operace se spočetnou aritou. Otevřeným problémem zůstává existence dalších t-norem se stejnou vlastností, případně, zda ji splňují všechny striktní t-normy. Řešní tohoto problému je v práci formulováno.</abstract>      <RIV>BA</RIV> <reportyear>2006</reportyear>      <department>E</department>   <permalink>http://hdl.handle.net/11104/0131543</permalink>    <ID_orig>UTIA-B 20050192</ID_orig>      <arlyear>2005</arlyear>       <unknown tag="mrcbU63"> cav_un_epca*0256186 Archive for Mathematical Logic 0933-5846 1432-0665 Roč. 14 č. 44 2005 829 849 Springer </unknown> </cas_special> </bibitem>