15 found
Order:
  1. (1 other version)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 (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  2.  64
    Boolean Paradoxes and Revision Periods.Ming Hsiung - 2017 - Studia Logica 105 (5):881-914.
    According to the revision theory of truth, the paradoxical sentences have certain revision periods in their valuations with respect to the stages of revision sequences. We find that the revision periods play a key role in characterizing the degrees of paradoxicality for Boolean paradoxes. We prove that a Boolean paradox is paradoxical in a digraph, iff this digraph contains a closed walk whose height is not any revision period of this paradox. And for any finitely many numbers greater than 1, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  3.  62
    Designing Paradoxes: A Revision-theoretic Approach.Ming Hsiung - 2022 - Journal of Philosophical Logic 51 (4):739-789.
    According to the revision theory of truth, the binary sequences generated by the paradoxical sentences in revision sequence are always unstable. In this paper, we work backwards, trying to reconstruct the paradoxical sentences from some of their binary sequences. We give a general procedure of constructing paradoxes with specific binary sequences through some typical examples. Particularly, we construct what Herzberger called “unstable statements with unpredictably complicated variations in truth value.” Besides, we also construct those paradoxes with infinitely many finite primary (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4. Equiparadoxicality of Yablo’s Paradox and the Liar.Ming Hsiung - 2013 - Journal of Logic, Language and Information 22 (1):23-31.
    It is proved that Yablo’s paradox and the Liar paradox are equiparadoxical, in the sense that their paradoxicality is based upon exactly the same circularity condition—for any frame ${\mathcal{K}}$ , the following are equivalent: (1) Yablo’s sequence leads to a paradox in ${\mathcal{K}}$ ; (2) the Liar sentence leads to a paradox in ${\mathcal{K}}$ ; (3) ${\mathcal{K}}$ contains odd cycles. This result does not conflict with Yablo’s claim that his sequence is non-self-referential. Rather, it gives Yablo’s paradox a new significance: (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  5. Jump Liars and Jourdain’s Card via the Relativized T-scheme.Ming Hsiung - 2009 - Studia Logica 91 (2):239-271.
    A relativized version of Tarski's T-scheme is introduced as a new principle of the truth predicate. Under the relativized T-scheme, the paradoxical objects, such as the Liar sentence and Jourdain's card sequence, are found to have certain relative contradictoriness. That is, they are contradictory only in some frames in the sense that any valuation admissible for them in these frames will lead to a contradiction. It is proved that for any positive integer n, the n-jump liar sentence is contradictory in (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  6.  49
    Unwinding Modal Paradoxes on Digraphs.Ming Hsiung - 2020 - Journal of Philosophical Logic 50 (2):319-362.
    The unwinding that Cook, 767–774 2004) proposed is a simple but powerful method of generating new paradoxes from known ones. This paper extends Cook’s unwinding to a larger class of paradoxes and studies further the basic properties of the unwinding. The unwinding we study is a procedure, by which when inputting a Boolean modal net together with a definable digraph, we get a set of sentences in which we have a ‘counterpart’ for each sentence of the Boolean modal net and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  57
    Tarski's theorem and liar-like paradoxes.Ming Hsiung - 2014 - Logic Journal of the IGPL 22 (1):24-38.
    Tarski's theorem essentially says that the Liar paradox is paradoxical in the minimal reflexive frame. We generalise this result to the Liar-like paradox $\lambda^\alpha$ for all ordinal $\alpha\geq 1$. The main result is that for any positive integer $n = 2^i(2j+1)$, the paradox $\lambda^n$ is paradoxical in a frame iff this frame contains at least a cycle the depth of which is not divisible by $2^{i+1}$; and for any ordinal $\alpha \geq \omega$, the paradox $\lambda^\alpha$ is paradoxical in a frame (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  8.  36
    In what sense is the no-no paradox a paradox?Ming Hsiung - 2021 - Philosophical Studies 179 (6):1915-1937.
    Cook regards Sorenson’s so-called ‘the no-no paradox’ as only a kind of ‘meta-paradox’ or ‘quasi-paradox’ because the symmetry principle that Sorenson imposes on the paradox is meta-theoretic. He rebuilds this paradox at the object-language level by replacing the symmetry principle with some ‘background principles governing the truth predicate’. He thus argues that the no-no paradox is a ‘new type of paradox’ in that its paradoxicality depends on these principles. This paper shows that any theory is inconsistent with the T-schema instances (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9. An Introduction to Gupta's Acceptable Models.Ming Hsiung - manuscript
    This article is a lecture note I wrote for my philosophy of mathematics course. Its main task is to explain the main ideas of Gupta's acceptable model proposed in his paper [J. Philos. Logic 11(1), 1–60, 1982]. I aim to provide detailed information on a result established by Gupta. On the one hand, I hope this explanation can be helpful for those who are learning Gupta's acceptable model, and on the other hand, I also hope to provide a guide for (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  10.  45
    The Elimination of Direct Self-reference.Qianli Zeng & Ming Hsiung - 2023 - Studia Logica 111 (6):1037-1055.
    This paper provides a procedure which, from any Boolean system of sentences, outputs another Boolean system called the ‘_m_-cycle unwinding’ of the original Boolean system for any positive integer _m_. We prove that for all \(m>1\), this procedure eliminates the direct self-reference in that the _m_-cycle unwinding of any Boolean system must be indirectly self-referential. More importantly, this procedure can preserve the primary periods of Boolean paradoxes: whenever _m_ is relatively prime to all primary periods of a Boolean paradox, this (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11. Some Open Questions about Degrees of Paradoxes.Ming Hsiung - manuscript
    We can classify the (truth-theoretic) paradoxes according to their degrees of paradoxicality. Roughly speaking, two paradoxes have the same degrees of paradoxicality, if they lead to a contradiction under the same conditions, and one paradox has a (non-strictly) lower degree of paradoxicality than another, if whenever the former leads to a contradiction under a condition, the latter does so under the same condition. In this paper, we outline some results and questions around the degrees of paradoxicality and summarize recent progress.
    Direct download  
     
    Export citation  
     
    Bookmark  
  12.  27
    Necessity predicate versus truth predicate from the perspective of paradox.Ming Hsiung - 2023 - Synthese 202 (1):1-23.
    This paper aims to explore the relationship between the necessity predicate and the truth predicate by comparing two possible-world interpretations. The first interpretation, proposed by Halbach et al. (J Philos Log 32(2):179–223, 2003), is for the necessity predicate, and the second, proposed by Hsiung (Stud Log 91(2):239–271, 2009), is for the truth predicate. To achieve this goal, we examine the connections and differences between paradoxical sentences that involve either the necessity predicate or the truth predicate. A primary connection is established (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13.  47
    From Paradoxicality to Paradox.Ming Hsiung - 2024 - Erkenntnis 89 (7):2545-2569.
    In various theories of truth, people have set forth many definitions to clarify in what sense a set of sentences is paradoxical. But what, exactly, is _a_ paradox per se? It has not yet been realized that there is a gap between ‘being paradoxical’ and ‘being a paradox’. This paper proposes that a paradox is a minimally paradoxical set meeting some closure property. Along this line of thought, we give five tentative definitions based upon the folk notion of paradoxicality implied (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  14.  3
    Reference Digraphs of Non-Self-Referential Paradoxes.Ming Hsiung - forthcoming - Review of Symbolic Logic:1-19.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  63
    An intuitionistic characterization of classical logic.Ming Hsiung - 2008 - Journal of Philosophical Logic 37 (4):299 - 317.
    By introducing the intensional mappings and their properties, we establish a new semantical approach of characterizing intermediate logics. First prove that this new approach provides a general method of characterizing and comparing logics without changing the semantical interpretation of implication connective. Then show that it is adequate to characterize all Kripke_complete intermediate logics by showing that each of these logics is sound and complete with respect to its (unique) ‘weakest characterization property’ of intensional mappings. In particular, we show that classical (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark