Switch to: References

Add citations

You must login to add citations.
  1. What Paradoxes Depend on.Ming Hsiung - 2018 - Synthese:1-27.
    This paper gives a definition of self-reference on the basis of the dependence relation given by Leitgeb (2005), and the dependence digraph by Beringer & Schindler (2015). Unlike the usual discussion about self-reference of paradoxes centering around Yablo's paradox and its variants, I focus on the paradoxes of finitary characteristic, which are given again by use of Leitgeb's dependence relation. They are called 'locally finite paradoxes', satisfying that any sentence in these paradoxes can depend on finitely many sentences. I prove (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A microscopic approach to Souslin-tree constructions, Part I.Ari Meir Brodsky & Assaf Rinot - 2017 - Annals of Pure and Applied Logic 168 (11):1949-2007.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Forcing with finite conditions.Gregor Dolinar & Mirna Džamonja - 2013 - Annals of Pure and Applied Logic 164 (1):49-64.
    We give a construction of the square principle by means of forcing with finite conditions.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On countably perfectly meager and countably perfectly null sets.Tomasz Weiss & Piotr Zakrzewski - 2024 - Annals of Pure and Applied Logic 175 (1):103357.
    Download  
     
    Export citation  
     
    Bookmark  
  • On weak filters and ultrafilters: Set theory from (and for) knowledge representation.Costas D. Koutras, Christos Moyzes, Christos Nomikos, Konstantinos Tsaprounis & Yorgos Zikos - 2023 - Logic Journal of the IGPL 31 (1):68-95.
    Weak filters were introduced by K. Schlechta in the ’90s with the aim of interpreting defaults via a generalized ‘most’ quantifier in first-order logic. They arguably represent the largest class of structures that qualify as a ‘collection of large subsets’ of a given index set |$I$|⁠, in the sense that it is difficult to think of a weaker, but still plausible, definition of the concept. The notion of weak ultrafilter naturally emerges and has been used in epistemic logic and other (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Families of sets related to Rosenthal’s lemma.Damian Sobota - 2019 - Archive for Mathematical Logic 58 (1-2):53-69.
    A family \ is called Rosenthal if for every Boolean algebra \, bounded sequence \ of measures on \, antichain \ in \, and \, there exists \ such that \<\varepsilon \) for every \. Well-known and important Rosenthal’s lemma states that \ is a Rosenthal family. In this paper we provide a necessary condition in terms of antichains in \}\) for a family to be Rosenthal which leads us to a conclusion that no Rosenthal family has cardinality strictly less (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation