<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0395571</ARLID> <utime>20250112210505.2</utime><mtime>20130913235959.9</mtime>   <WOS>000323437800004</WOS> <SCOPUS>84881617144</SCOPUS>  <DOI>10.1007/s11225-013-9496-1</DOI>           <title language="eng" primary="1">The Proof by Cases Property and its Variants in Structural Consequence Relations</title>  <specification> <page_count>35 s.</page_count> </specification>   <serial><ARLID>cav_un_epca*0292190</ARLID><ISSN>0039-3215</ISSN><title>Studia Logica</title><part_num/><part_title/><volume_id>101</volume_id><volume>4 (2013)</volume><page_num>713-747</page_num><publisher><place/><name>Springer</name><year/></publisher></serial>    <keyword>Abstract Algebraic Logic</keyword>   <keyword>Generalized disjunction</keyword>   <keyword>Proof by cases properties</keyword>   <keyword>Consequence relations</keyword>   <keyword>Filter-distributive logics</keyword>   <keyword>Protoalgebraic logics</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*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>1M0545</project_id> <agency>GA MŠk</agency> <country>CZ</country> <ARLID>cav_un_auth*0203502</ARLID> </project> <project> <project_id>247584</project_id> <agency>EC</agency> <country>XE</country>   <ARLID>cav_un_auth*0323440</ARLID> </project> <research> <research_id>CEZ:AV0Z1030915</research_id> </research>  <abstract language="eng" primary="1">This paper is a contribution to the study of the role of disjunction in Abstract Algebraic Logic. Several kinds of (generalized) disjunctions, usually defined using a suitable variant of the proof by cases property, were introduced and extensively studied in the literature mainly in the context of finitary logics. The goals of this paper are to extend these results to all logics, to systematize the multitude of notions of disjunction (both those already considered in the literature and those introduced in this paper), and to show several interesting applications allowed by the presence of a suitable disjunction in a given logic.</abstract>     <RIV>BA</RIV>     <reportyear>2014</reportyear>     <unknown tag="mrcbC52"> 4 A O 4a 4o 20231122135753.2 20250112210505.2 </unknown> <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0223575</permalink>         <unknown tag="mrcbT16-e">LOGIC</unknown> <unknown tag="mrcbT16-g">0.058</unknown> <unknown tag="mrcbT16-h">&gt;10.0</unknown> <unknown tag="mrcbT16-i">0.00174</unknown> <unknown tag="mrcbT16-k">564</unknown> <unknown tag="mrcbT16-l">52</unknown> <unknown tag="mrcbT16-s">0.426</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-C">18.121</unknown> <unknown tag="mrcbT16-E">Q3</unknown> <arlyear>2013</arlyear>    <unknown tag="mrcbTft">  Soubory v repozitáři: dodatecne_citace_k_0395571.pdf, a0395571.pdf, 0395571.pdf </unknown>    <unknown tag="mrcbU14"> 84881617144 SCOPUS </unknown> <unknown tag="mrcbU34"> 000323437800004 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0292190 Studia Logica 0039-3215 1572-8730 Roč. 101 č. 4 2013 713 747 Springer </unknown> </cas_special> </bibitem>