Switch to: References

Add citations

You must login to add citations.
  1. Decidability of Admissibility: On a Problem by Friedman and its Solution by Rybakov.Jeroen P. Goudsmit - 2021 - Bulletin of Symbolic Logic 27 (1):1-38.
    Rybakov (1984a) proved that the admissible rules of IPC are decidable. We give a proof of the same theorem, using the same core idea, but couched in the many notions that have been developed in the mean time. In particular, we illustrate how the argument can be interpreted as using refinements of the notions of exactness and extendibility.
    Download  
     
    Export citation  
     
    Bookmark  
  • Decidability of admissibility: On a problem by Friedman and its solution by Rybakov.Jeroen P. Goudsmit - 2021 - Bulletin of Symbolic Logic 27 (1):1-38.
    Rybakov proved that the admissible rules of $\mathsf {IPC}$ are decidable. We give a proof of the same theorem, using the same core idea, but couched in the many notions that have been developed in the mean time. In particular, we illustrate how the argument can be interpreted as using refinements of the notions of exactness and extendibility.
    Download  
     
    Export citation  
     
    Bookmark