<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0537231</ARLID> <utime>20240103225102.3</utime><mtime>20210111235959.9</mtime>   <WOS>000744508900001</WOS> <SCOPUS>85050989071</SCOPUS>  <DOI>10.1093/jigpal/jzaa027</DOI>           <title language="eng" primary="1">Saturated models of first-order many-valued logics</title>  <specification> <page_count>22 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0258358</ARLID><ISSN>1367-0751</ISSN><title>Logic Journal of the IGPL</title><part_num/><part_title/><volume_id>30</volume_id><volume>1 (2022)</volume><page_num>1-20</page_num><publisher><place/><name>Oxford University Press</name><year/></publisher></serial>    <keyword>mathematical fuzzy logic</keyword>   <keyword>first-order graded logics</keyword>   <keyword>uninorms</keyword>    <author primary="1"> <ARLID>cav_un_auth*0382241</ARLID> <name1>Badia</name1> <name2>G.</name2> <country>AU</country>  <share>50</share> </author> <author primary="0"> <ARLID>cav_un_auth*0293476</ARLID> <name1>Noguera</name1> <name2>Carles</name2> <institution>UTIA-B</institution> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept>Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department>MTR</department> <full_dept>Department of Decision Making Theory</full_dept>  <share>50</share> <garant>A</garant> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2021/MTR/noguera-0537231.pdf</url> </source> <source> <url>https://academic.oup.com/jigpal/article-abstract/30/1/1/5879257?redirectedFrom=fulltext</url>  </source>        <cas_special> <project> <project_id>GA17-04630S</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0349495</ARLID> </project>  <abstract language="eng" primary="1">This paper is devoted to the problem of existence of saturated models for first-order many-valued logics. We consider a general notion of type as pairs of sets of formulas in one free variable that express properties that an element of a model should, respectively, satisfy and falsify. By means of an elementary chains construction, we prove that each model can be elementarily extended to a κ-saturated model, i.e. a model where as many types as possible are realized. In order to prove this theorem we obtain, as by-products, some results on tableaux (understood as pairs of sets of formulas) and their consistency and satisfiability and a generalization of the Tarski-Vaught theorem on unions of elementary chains. Finally, we provide a structural characterization of κ-saturation in terms of the completion of a diagram representing a certain configuration of models and mappings.</abstract>     <result_subspec>WOS</result_subspec> <RIV>BA</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10102</FORD2>    <reportyear>2022</reportyear>      <num_of_auth>2</num_of_auth>  <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0315000</permalink>  <unknown tag="mrcbC61"> 1 </unknown>  <confidential>S</confidential>  <unknown tag="mrcbC86"> 3+4 Article Mathematics Applied|Mathematics|Logic </unknown> <unknown tag="mrcbC91"> C </unknown>         <unknown tag="mrcbT16-e">MATHEMATICS|MATHEMATICS.APPLIED|LOGIC</unknown> <unknown tag="mrcbT16-f">0.9</unknown> <unknown tag="mrcbT16-g">0.2</unknown> <unknown tag="mrcbT16-h">6.7</unknown> <unknown tag="mrcbT16-i">0.00087</unknown> <unknown tag="mrcbT16-j">0.349</unknown> <unknown tag="mrcbT16-k">615</unknown> <unknown tag="mrcbT16-s">0.411</unknown> <unknown tag="mrcbT16-5">0.900</unknown> <unknown tag="mrcbT16-6">93</unknown> <unknown tag="mrcbT16-7">Q1</unknown> <unknown tag="mrcbT16-C">61.2</unknown> <unknown tag="mrcbT16-D">Q4</unknown> <unknown tag="mrcbT16-E">Q2</unknown> <unknown tag="mrcbT16-M">0.9</unknown> <unknown tag="mrcbT16-N">Q1</unknown> <unknown tag="mrcbT16-P">88.1</unknown> <arlyear>2022</arlyear>       <unknown tag="mrcbU14"> 85050989071 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000744508900001 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0258358 Logic Journal of the IGPL 1367-0751 1368-9894 Roč. 30 č. 1 2022 1 20 Oxford University Press </unknown> </cas_special> </bibitem>