Abstract
Rybakov (1984a) proved that the admissible rules of 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.
| Original language | English |
|---|---|
| Article number | 1 |
| Pages (from-to) | 1-38 |
| Number of pages | 38 |
| Journal | Bulletin of Symbolic Logic |
| Volume | 27 |
| Issue number | 1 |
| Early online date | 5 Oct 2020 |
| DOIs | |
| Publication status | Published - Mar 2021 |
Bibliographical note
Funding Information:Support by the Netherlands Organisation for Scientific Research under grant 639.032.918 is gratefully acknowledged.
Publisher Copyright:
© 2021 Cambridge University Press. All rights reserved.
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
Funding
Support by the Netherlands Organisation for Scientific Research under grant 639.032.918 is gratefully acknowledged.
Keywords
- 2020 Mathematics Subject Classification 03B20 03B22 03B55