<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0395361</ARLID> <utime>20250112215648.7</utime><mtime>20130910235959.9</mtime>   <WOS>000323167200002</WOS> <SCOPUS>84882309468</SCOPUS>  <DOI>10.1017/S1755020313000099</DOI>           <title language="eng" primary="1">Nonassociative Substructural Logics and Their Semilinear Extensions: Axiomatization and Completeness Properties</title>  <specification> <page_count>30 s.</page_count> </specification>   <serial><ARLID>cav_un_epca*0343866</ARLID><ISSN>1755-0203</ISSN><title>Review of Symbolic Logic</title><part_num/><part_title/><volume_id>6</volume_id><volume>3 (2013)</volume><page_num>394-423</page_num><publisher><place/><name>Cambridge University Press</name><year/></publisher></serial>    <keyword>nonassociative full Lambek calculus</keyword>   <keyword>deduction theorem</keyword>   <keyword>standard 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>  <garant>K</garant> <fullinstit>Ústav informatiky AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0208971</ARLID> <name1>Horčík</name1> <name2>Rostislav</name2> <institution>UIVT-O</institution> <full_dept language="cz">Oddělení teoretické informatiky</full_dept> <full_dept>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>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>                                             <cas_special> <project> <project_id>GBP202/12/G061</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0285549</ARLID> </project> <project> <project_id>I143-G15</project_id> <agency>ESF/Austrian Science Foundation project</agency> <country>AT</country> <ARLID>cav_un_auth*0301464</ARLID> </project>      <RIV>BA</RIV>     <reportyear>2014</reportyear>     <unknown tag="mrcbC52"> 4 A 4a 4a 4o 20250112215648.8 </unknown> <inst_support> RVO:67985807 </inst_support> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0223397</permalink>         <unknown tag="mrcbT16-e">LOGIC|MATHEMATICS|MATHEMATICSAPPLIED</unknown> <unknown tag="mrcbT16-f">0.626</unknown> <unknown tag="mrcbT16-g">0.139</unknown> <unknown tag="mrcbT16-i">0.00108</unknown> <unknown tag="mrcbT16-j">0.438</unknown> <unknown tag="mrcbT16-k">97</unknown> <unknown tag="mrcbT16-l">36</unknown> <unknown tag="mrcbT16-s">0.779</unknown> <unknown tag="mrcbT16-z">ScienceCitationIndexExpanded</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-B">33.819</unknown> <unknown tag="mrcbT16-C">45.477</unknown> <unknown tag="mrcbT16-D">Q3</unknown> <unknown tag="mrcbT16-E">Q1</unknown> <arlyear>2013</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: dodatecne_citace_k_0395361.pdf, a0395361.pdf, 0395361.pdf </unknown>    <unknown tag="mrcbU14"> 84882309468 SCOPUS </unknown> <unknown tag="mrcbU34"> 000323167200002 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0343866 Review of Symbolic Logic 1755-0203 1755-0211 Roč. 6 č. 3 2013 394 423 Cambridge University Press </unknown> </cas_special> </bibitem>