Switch to: References

Add citations

You must login to add citations.
  1. Is Classical Mathematics Appropriate for Theory of Computation?Farzad Didehvar - manuscript
    Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic.Corey Edward Mulvihill - 2015 - Dissertation, University of Waterloo
    Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Localizing finite-depth Kripke models.Mojtaba Mojtahedi - 2019 - Logic Journal of the IGPL 27 (3):239-251.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Varieties of monadic Heyting algebras. Part III.Guram Bezhanishvili - 2000 - Studia Logica 64 (2):215-256.
    This paper is the concluding part of [1] and [2], and it investigates the inner structure of the lattice (MHA) of all varieties of monadic Heyting algebras. For every n , we introduce and investigate varieties of depth n and cluster n, and present two partitions of (MHA), into varieties of depth n, and into varieties of cluster n. We pay a special attention to the lower part of (MHA) and investigate finite and critical varieties of monadic Heyting algebras in (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The Admissible Rules of ${{mathsf{BD}_{2}}}$ and ${mathsf{GSc}}$.Jeroen P. Goudsmit - 2018 - Notre Dame Journal of Formal Logic 59 (3):325-353.
    The Visser rules form a basis of admissibility for the intuitionistic propositional calculus. We show how one can characterize the existence of covers in certain models by means of formulae. Through this characterization, we provide a new proof of the admissibility of a weak form of the Visser rules. Finally, we use this observation, coupled with a description of a generalization of the disjunction property, to provide a basis of admissibility for the intermediate logics BD2 and GSc.
    Download  
     
    Export citation  
     
    Bookmark   2 citations