On a Problem of Friedman and its Solution by Rybakov

Bulletin of Symbolic Logic:1-48 (forthcoming)
  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.

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

A simple solution to Friedman's fourth problem.Xavier Caicedo - 1986 - Journal of Symbolic Logic 51 (3):778-784.
Thomson's Trolley Problem.Peter Graham - 2017 - Journal of Ethics and Social Philosophy 12 (2):168-190.
The bayesian treatment of auxiliary hypotheses.Michael Strevens - 2001 - British Journal for the Philosophy of Science 52 (3):515-537.
Das strukturalistische Problem der theoretischen Begriffe und seine Lösung.Hanspeter Rings - 1987 - Zeitschrift Für Allgemeine Wissenschaftstheorie 18 (1-2):296-312.
A Gruesome Problem for the Curve-Fitting Solution.Scott DeVito - 1997 - British Journal for the Philosophy of Science 48 (3):391-396.
Kant’s Response to Hume in the Second Analogy: A Critique of Gerd Buchdahl’s and Michael Friedman’s Accounts.Saniye Vatansever - 2018 - Hopos: The Journal of the International Society for the History of Philosophy of Science 8 (2):310–346.

Analytics

Added to PP
2020-10-06

Downloads
25 (#628,404)

6 months
10 (#261,437)

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

No references found.

Add more references