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 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.

Categories

Keywords

Reprint years

DOI

10.1017/bsl.2020.43

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

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

Through your library

My notes

Similar books and articles

On a Problem of Friedman and its Solution by Rybakov.Jeroen P. Goudsmit - forthcoming - Bulletin of Symbolic Logic:1-48.
Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus.V. V. Rybakov - 1990 - Annals of Pure and Applied Logic 50 (1):71-106.
Inference Rules in Nelson’s Logics, Admissibility and Weak Admissibility.Sergei Odintsov & Vladimir Rybakov - 2015 - Logica Universalis 9 (1):93-120.
Rules of inference with parameters for intuitionistic logic.Vladimir V. Rybakov - 1992 - Journal of Symbolic Logic 57 (3):912-923.
Logical equations and admissible rules of inference with parameters in modal provability logics.V. V. Rybakov - 1990 - Studia Logica 49 (2):215 - 239.
On the decidability of implicational ticket entailment.Katalin Bimbó & J. Michael Dunn - 2013 - Journal of Symbolic Logic 78 (1):214-236.
Discrete linear temporal logic with current time point clusters, deciding algorithms.V. Rybakov - 2008 - Logic and Logical Philosophy 17 (1-2):143-161.
Review: Sy. D. Friedman, $beta$-Recursion Theory; Sy D. Friedman, Post's Problem without Admissibility. [REVIEW]Steven Homer - 1981 - Journal of Symbolic Logic 46 (3):664-665.
Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property.Vladimir V. Rybakov - 1994 - Studia Logica 53 (2):203 - 225.
Sy D. Friedman, β-recursion theory. Transactions of the American Mathematical Society, vol. 255 , pp. 173–200. - Sy D. Friedman. Post's problem without admissibility. Advances in mathematics, vol. 35 , pp. 30–49. [REVIEW]Steven Homer - 1981 - Journal of Symbolic Logic 46 (3):664-665.
Unification and admissible rules for paraconsistent minimal Johanssonsʼ logic J and positive intuitionistic logic IPC.Sergei Odintsov & Vladimir Rybakov - 2013 - Annals of Pure and Applied Logic 164 (7-8):771-784.
Linear Temporal Logic with Non-transitive Time, Algorithms for Decidability and Verification of Admissibility.Vladimir Rybakov - 2018 - In Sergei Odintsov (ed.), Larisa Maksimova on Implication, Interpolation, and Definability. Springer Verlag.
Decidability: theorems and admissible rules.Vladimir Rybakov - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):293-308.
Book Review: V. V. Rybakov. Admissibility of Logical Inference Rules. [REVIEW]Marcus Kracht - 1999 - Notre Dame Journal of Formal Logic 40 (4):578-587.
Common reasoning about admissibility.Cristina Bicchieri & Oliver Schulte - 1996 - Erkenntnis 45 (2-3):299 - 325.

Analytics

Added to PP
2021-11-03

Downloads
19 (#781,160)

6 months
10 (#255,509)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Modal Logic.Yde Venema, Alexander Chagrov & Michael Zakharyaschev - 2000 - Philosophical Review 109 (2):286.
Constructivism in Mathematics, An Introduction.A. Troelstra & D. Van Dalen - 1991 - Tijdschrift Voor Filosofie 53 (3):569-570.
Unification in intuitionistic logic.Silvio Ghilardi - 1999 - Journal of Symbolic Logic 64 (2):859-880.
One hundred and two problems in mathematical logic.Harvey Friedman - 1975 - Journal of Symbolic Logic 40 (2):113-129.

View all 58 references / Add more references