<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0477040</ARLID> <utime>20250112195326.3</utime><mtime>20170815235959.9</mtime>   <SCOPUS>85026497280</SCOPUS> <WOS>000428317500011</WOS>  <DOI>10.1007/s00153-017-0577-0</DOI>           <title language="eng" primary="1">Implicational (semilinear) logics III: completeness properties</title>  <specification> <page_count>30 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>57</volume_id><page_num>391-420</page_num><publisher><place/><name>Springer</name><year/></publisher></serial>    <keyword>abstract algebraic logic</keyword>   <keyword>protoalgebraic logics</keyword>   <keyword>implicational logics</keyword>   <keyword>disjunctional logics</keyword>   <keyword>semilinear logics</keyword>   <keyword>non-classical logics</keyword>   <keyword>completeness theorems</keyword>   <keyword>rational completeness</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*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>                  <cas_special> <project> <project_id>GA13-14654S</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0292719</ARLID> </project> <project> <project_id>689176</project_id> <agency>EC</agency> <country>XE</country>   <ARLID>cav_un_auth*0339025</ARLID> </project>  <abstract language="eng" primary="1">This paper presents an abstract study of completeness properties of non-classical logics with respect to matricial semantics. Given a class of reduced matrix models we define three completeness properties of increasing strength and characterize them in several useful ways. Some of these characterizations hold in absolute generality and others are for logics with generalized implication or disjunction connectives, as considered in the previous papers. Finally, we consider completeness with respect to matrices with a linear dense order and characterize it in terms of an extension property and a syntactical metarule. This is the final part of the investigation started and developed in the papers (Cintula and Noguera in Arch Math Logic 49(4):417–446, 2010 and Arch Math Logic 53(3):353–372, 2016).</abstract>     <RIV>BA</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10101</FORD2>     <reportyear>2019</reportyear>     <unknown tag="mrcbC47"> UTIA-B 10000 10100 10101 </unknown> <unknown tag="mrcbC52"> 4 A hod 4ah 4o 20250112195136.8 20250112195326.3 </unknown> <unknown tag="mrcbC55"> UTIA-B BA </unknown> <inst_support> RVO:67985807 </inst_support> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0273436</permalink>  <unknown tag="mrcbC64"> 1 Department of Theoretical Computer Science UIVT-O 10100 LOGIC </unknown>  <confidential>S</confidential>  <unknown tag="mrcbC86"> 1 Article Mathematics|Logic </unknown>        <unknown tag="mrcbT16-e">MATHEMATICS|LOGIC</unknown> <unknown tag="mrcbT16-f">0.506</unknown> <unknown tag="mrcbT16-g">0.255</unknown> <unknown tag="mrcbT16-h">18.9</unknown> <unknown tag="mrcbT16-i">0.00198</unknown> <unknown tag="mrcbT16-j">0.589</unknown> <unknown tag="mrcbT16-k">401</unknown> <unknown tag="mrcbT16-s">0.768</unknown> <unknown tag="mrcbT16-5">0.500</unknown> <unknown tag="mrcbT16-6">51</unknown> <unknown tag="mrcbT16-7">Q3</unknown> <unknown tag="mrcbT16-B">51.318</unknown> <unknown tag="mrcbT16-C">37.8</unknown> <unknown tag="mrcbT16-D">Q2</unknown> <unknown tag="mrcbT16-E">Q1</unknown> <unknown tag="mrcbT16-M">0.74</unknown> <unknown tag="mrcbT16-N">Q2</unknown> <unknown tag="mrcbT16-P">47.5</unknown> <arlyear>2018</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: dodatecne_citace_k_0477040.pdf, a0477040.pdf, 0477040.pdf </unknown>    <unknown tag="mrcbU14"> 85026497280 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000428317500011 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0256186 Archive for Mathematical Logic 0933-5846 1432-0665 Roč. 57 3-4 2018 391 420 Springer </unknown> </cas_special> </bibitem>