Results for 'Agata Jałosińska'

4 found
Order:
  1.  23
    Obóz Kultury 2.0.Mirosław Filiciak, Alek Tarkowski, Agata Jałosińska, Andrzej Klimczuk, Maciej Rynarzewski, Jacek Seweryn, Stunża M., D. Grzegorz, Marcin Wilkowski & Anna Orlik - 2010 - Fundacja Ortus.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  2.  59
    Quantified Propositional Gödel Logics.Matthias Baaz, Agata Ciabattoni & Richard Zach - 2000 - In Andrei Voronkov & Michel Parigot (eds.), Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000. Berlin: Springer. pp. 240-256.
    It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, is decidable. This result is obtained by reduction to Büchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  15
    Digitalizacja Dziedzictwa.Andrzej Klimczuk - 2010 - Fundacja Ortus.
    More Info: M. Filiciak, A. Tarkowski, A. Jałosińska, A. Klimczuk, M. Rynarzewski, J.M. Seweryn, G.D. Stunża, M. Wilkowski, A. Orlik, Digitalizacja dziedzictwa (Digitisation of Heritage), Fundacja Ortus, Warszawa 2010. -/- .
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  4.  17
    From Display to Labelled Proofs for Tense Logics.Agata Ciabattoni, Tim Lyon & Revantha Ramanayake - 2018 - In Anil Nerode & Sergei Artemov (eds.), Logical Foundations of Computer Science. Springer International Publishing. pp. 120 - 139.
    We introduce an effective translation from proofs in the display calculus to proofs in the labelled calculus in the context of tense logics. We identify the labelled calculus proofs in the image of this translation as those built from labelled sequents whose underlying directed graph possesses certain properties. For the basic normal tense logic Kt, the image is shown to be the set of all proofs in the labelled calculus G3Kt.
    Download  
     
    Export citation  
     
    Bookmark