Decidability of Admissibility: On a Problem by Friedman and its Solution by Rybakov

Bulletin of Symbolic Logic 27 (1):1-38 (2021)
  Copy   BIBTEX

Abstract

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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2020-10-06

Downloads
38 (#596,272)

6 months
9 (#497,927)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations