<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0491819</ARLID> <utime>20240103220301.8</utime><mtime>20180727235959.9</mtime>   <SCOPUS>85049671436</SCOPUS> <WOS>000461580400009</WOS>  <DOI>10.1007/s00500-018-3369-5</DOI>           <title language="eng" primary="1">Toward a general frame semantics for modal many-valued logics</title>  <specification> <page_count>9 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0258368</ARLID><ISSN>1432-7643</ISSN><title>Soft Computing</title><part_num/><part_title/><volume_id>23</volume_id><volume>7 (2019)</volume><page_num>2233-2241</page_num><publisher><place/><name>Springer</name><year/></publisher></serial>    <keyword>Modal many-valued logics</keyword>   <keyword>Mathematical fuzzy logic</keyword>   <keyword>Neighborhood frames</keyword>   <keyword>Kripke semantics</keyword>   <keyword>General frames</keyword>    <author primary="1"> <ARLID>cav_un_auth*0100737</ARLID> <name1>Cintula</name1> <name2>Petr</name2> <institution>UIVT-O</institution> <full_dept language="cz">Oddělení teoretické informatiky</full_dept> <full_dept language="eng">Department of Theoretical Computer Science</full_dept> <full_dept>Department of Theoretical Computer Science</full_dept> <fullinstit>Ústav informatiky AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0362702</ARLID> <name1>Menchón</name1> <name2>P.</name2> <country>AR</country> </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> <garant>K</garant> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source>  <url>http://dx.doi.org/10.1007/s00500-018-3369-5</url> </source>        <cas_special> <project> <ARLID>cav_un_auth*0349495</ARLID> <project_id>GA17-04630S</project_id> <agency>GA ČR</agency> </project>  <abstract language="eng" primary="1">Frame semantics, given by Kripke or neighborhood frames, do not give completeness theorems for all modal logics extending, respectively, K and E. Such shortcoming can be overcome by means of general frames, i.e., frames equipped with a collection of admissible sets of worlds (which is the range of possible valuations over such frame). We export this approach from the classical paradigm to modal many-valued logics by defining general A-frames over a given residuated lattice   AA  (i.e., the usual frames with a collection of admissible A-valued sets). We describe in detail the relation between general Kripke and neighborhood A-frames and prove that, if the logic of A is finitary, all extensions of the corresponding logic E of  A are complete w.r.t. general neighborhood frames. Our work provides a new approach to the current research trend of generalizing relational semantics for non-classical modal logics to circumvent axiomatization problems.</abstract>     <RIV>BA</RIV> <FORD0>10000</FORD0> <FORD1>10200</FORD1> <FORD2>10201</FORD2>     <reportyear>2020</reportyear>     <unknown tag="mrcbC47"> UTIA-B 10000 10100 10101 </unknown> <unknown tag="mrcbC52"> 4 A O 4a 4o 4a 20231122143315.9 </unknown> <inst_support> RVO:67985807 </inst_support> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0285436</permalink>   <confidential>S</confidential>  <unknown tag="mrcbC86"> 1* Article Biochemistry Molecular Biology|Chemistry Multidisciplinary </unknown> <unknown tag="mrcbC91"> C </unknown>         <unknown tag="mrcbT16-e">COMPUTERSCIENCE.INTERDISCIPLINARYAPPLICATIONS|COMPUTERSCIENCE.ARTIFICIALINTELLIGENCE</unknown> <unknown tag="mrcbT16-f">2.988</unknown> <unknown tag="mrcbT16-g">1.125</unknown> <unknown tag="mrcbT16-h">3</unknown> <unknown tag="mrcbT16-i">0.01198</unknown> <unknown tag="mrcbT16-j">0.499</unknown> <unknown tag="mrcbT16-k">8859</unknown> <unknown tag="mrcbT16-q">120</unknown> <unknown tag="mrcbT16-s">0.705</unknown> <unknown tag="mrcbT16-y">40.95</unknown> <unknown tag="mrcbT16-x">3.41</unknown> <unknown tag="mrcbT16-3">5282</unknown> <unknown tag="mrcbT16-4">Q2</unknown> <unknown tag="mrcbT16-5">2.638</unknown> <unknown tag="mrcbT16-6">893</unknown> <unknown tag="mrcbT16-7">Q2</unknown> <unknown tag="mrcbT16-B">32.106</unknown> <unknown tag="mrcbT16-C">63.5</unknown> <unknown tag="mrcbT16-D">Q3</unknown> <unknown tag="mrcbT16-E">Q4</unknown> <unknown tag="mrcbT16-M">0.87</unknown> <unknown tag="mrcbT16-N">Q2</unknown> <unknown tag="mrcbT16-P">63.761</unknown> <arlyear>2019</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: 0491819a2.pdf, a0491819prep.pdf, a0491819.pdf </unknown>    <unknown tag="mrcbU14"> 85049671436 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000461580400009 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0258368 Soft Computing 1432-7643 1433-7479 Roč. 23 č. 7 2019 2233 2241 Springer </unknown> </cas_special> </bibitem>