In Tractatus 5.132 Wittgenstein argues that inferential justification depends solely on the understanding of the premises and conclusion, and is not mediated by any further act. On this basis he argues that Frege’s and Russell’s rules of inference are “senseless” and “superfluous”. This line of argument is puzzling, since it is unclear that there could be any viable account of inference according to which no such mediation takes place. I show that Wittgenstein’s rejection of rules of (...) inference can be motivated by taking account of his holistic construal of the relation between inference and understanding. (shrink)

In the theory of meaning, it is common to contrast truth-conditional theories of meaning with theories which identify the meaning of an expression with its use. One rather exact version of the somewhat vague use-theoretic picture is the view that the standard rules of inference determine the meanings of logical constants. Often this idea also functions as a paradigm for more general use-theoretic approaches to meaning. In particular, the idea plays a key role in the anti-realist program of (...) Dummett and his followers. In the theory of truth, a key distinction now is made between substantial theories and minimalist or deflationist views. According to the former, truth is a genuine substantial property of the truth-bearers, whereas according to the latter, truth does not have any deeper essence, but all that can be said about truth is contained in T-sentences (sentences having the form: ‘P’ is true if and only if P). There is no necessary analytic connection between the above theories of meaning and truth, but they have nevertheless some connections. Realists often favour some kind of truth-conditional theory of meaning and a substantial theory of truth (in particular, the correspondence theory). Minimalists and deflationists on truth characteristically advocate the use theory of meaning (e.g. Horwich). Semantical anti-realism (e.g. Dummett, Prawitz) forms an interesting middle case: its starting point is the use theory of meaning, but it usually accepts a substantial view on truth, namely that truth is to be equated with verifiability or warranted assertability. When truth is so understood, it is also possible to accept the idea that meaning is closely related to truth-conditions, and hence the conflict between use theories and truth-conditional theories in a sense disappears in this view. (shrink)

An algorithm recognizing admissibility of inference rules in generalized form (rules of inference with parameters or metavariables) in the intuitionistic calculus H and, in particular, also in the usual form without parameters, is presented. This algorithm is obtained by means of special intuitionistic Kripke models, which are constructed for a given inference rule. Thus, in particular, the direct solution by intuitionistic techniques of Friedman's problem is found. As a corollary an algorithm for the recognition of (...) the solvability of logical equations in H and for constructing some solutions for solvable equations is obtained. A semantic criterion for admissibility in H is constructed. (shrink)

In this paper, we study two companions of a logic, viz., the left variable inclusion companion and the restricted rules companion, their nature and interrelations, especially in connection with paraconsistency. A sufficient condition for the two companions to coincide has also been proved. Two new logical systems—intuitionistic paraconsistent weak Kleene logic (IPWK) and paraconsistent pre-rough logic (PPRL)—are presented here as examples of logics of left variable inclusion. IPWK is the left variable inclusion companion of intuitionistic propositional logic and is (...) also the restricted rules companion of it. PPRL, on the other hand, is the left variable inclusion companion of pre-rough logic but differs from the restricted rules companion of it. We have discussed algebraic semantics for these logics in terms of Płonka sums. This amounts to introducing a contaminating truth value, intended to denote a state of indeterminacy. (shrink)

A certain type of inference rules in modal logics, generalizing Gabbay's Irreflexivity rule, is introduced and some general completeness results about modal logics axiomatized with such rules are proved.

We explore the problems that confront any attempt to explain or explicate exactly what a primitive logical rule of inferenceis, orconsists in. We arrive at a proposed solution that places a surprisingly heavy load on the prospect of being able to understand and deal with specifications of rules that are essentiallyself-referring. That is, any rule$\rho $is to be understood via a specification that involves, embedded within it, reference to rule$\rho $itself. Just how we arrive at this position is explained (...) by reference to familiar rules as well as less familiar ones with unusual features. An inquiry of this kind is surprisingly absent from the foundations of inferentialism—the view that meanings of expressions (especially logical ones) are to be characterized by the rules of inference that govern them. (shrink)

Condensed detachment is usually regarded as a notation, and defined by example. In this paper it is regarded as a rule of inference, and rigorously defined with the help of the Unification Theorem of J. A. Robinson. Historically, however, the invention of condensed detachment by C. A. Meredith preceded Robinson's studies of unification. It is argued that Meredith's ideas deserve recognition in the history of unification, and the possibility that Meredith was influenced, through ukasiewicz, by ideas of Tarski going (...) back at least to 1939, and possibly to 1930 or earlier, is discussed. It is proved that a term is derivable by substitution and ordinary detachment from given axioms if and only if it is a substitution instance of a term which is derivable from these axioms by condensed detachment, and it is shown how this theorem enables the ideas of ukasiewicz and Tarski mentioned above to be formalized and extended. Finally, it is shown how condensed detachment may be subsumed within the resolution principle of J. A. Robinson, and several computer studies of particular Hilbert-type propositional calculi using programs based on condensed detachment or on resolution are briefly discussed. (shrink)

The thesis that, in a system of natural deduction, the meaning of a logical constant is given by some or all of its introduction and elimination rules has been developed recently in the work of Dummett, Prawitz, Tennant, and others, by the addition of harmony constraints. Introduction and elimination rules for a logical constant must be in harmony. By deploying harmony constraints, these authors have arrived at logics no stronger than intuitionist propositional logic. Classical logic, they maintain, cannot (...) be justified from this proof-theoretic perspective. This paper argues that, while classical logic can be formulated so as to satisfy a number of harmony constraints, the meanings of the standard logical constants cannot all be given by their introduction and/or elimination rules; negation, in particular, comes under close scrutiny. (shrink)

1. There is only one rule of inference, modus ponens. This is true both in the presentations of Begriffsschrift and Grundgesetze. There are other ways of making transitions between propositions in proofs, but these are never labeled by Frege “rules of inference.” These pertain to scope of quantification, parsing of formulas, introduction of definitions, conventions for the use and replacement of the various letters, and certain structural reorganizations, ; cf. the list in Gg §48.

This paper concerns modal logics of provability — Gödel-Löb systemGL and Solovay logicS — the smallest and the greatest representation of arithmetical theories in propositional logic respectively. We prove that the decision problem for admissibility of rules (with or without parameters) inGL andS is decidable. Then we get a positive solution to Friedman''s problem forGL andS. We also show that A. V. Kuznetsov''s problem of the existence of finite basis for admissible rules forGL andS has a negative solution. (...) Afterwards we give an algorithm deciding the solvability of logical equations inGL andS and constructing some solutions. (shrink)

This paper discusses the account of alethic modality as presented by Wilfrid Sellars in his earlier work from 1947 to 1958. Its aim is twofold. First, I discuss Sellars' analysis by exploring its historical relationship to Carnap's account of modality. I argue that Carnap's early syntactic treatment of modality profoundly influenced Sellars' own so-called ‘regulist' account of modality in terms of rules of inference. Furthermore, it is suggested that Sellars' lesser-known possible worlds analysis was influenced by Carnap's later (...) semantic account of modality. The second aim of the paper is a critical one. I raise a number of objections to Sellars’ account of modality and argue that his account confronts some serious limitations. I also argue that Sellars does not provide a satisfying explanation of the relationship between his regulist account and his possible worlds analysis. I offer such an explanation by arguing that his regulist account should be understood as a pragmatic account of what is conveyed by the use of modal sentences, whereas his possible worlds analysis is a semantic account of the asserted content of modal statements. That is, the regulist account and the possible worlds analysis have different explanatory targets. (shrink)

Rules of inference can be interpreted as rules of (purposive) behavior; in such a case the behaptor consists in accepting a certain statement, called conclusion. The justification of a rule of inference with respect to a given end consists in showing that it is the most efficient method of realizing that end; the meaning of the word “efficient”, and the character of the end, should, of course, be made clear.The article is an attempt at reconstructing a (...) part of the theory of mathematical statistics (the so-called parametric inference) along those lines. It is assumed that the end to be realized by following rules of statistical inference is, broadly speaking, a cognitive one. (shrink)

Elizabeth Karger has suggested an interpretation of Ockham's theory of the modes of common personal supposition ("TM") according to which the purpose of TM is to provide certain distinctions that Ockham will use in formulating a unified theory of immediate inference among certain kinds of sentences. Karger presents a single, powerful rule of inference that incorporates TM distinctions and that is meant to codify Ockham's theory of immediate inference. I raise an objection to Karger's rule, thereby calling (...) into doubt the interpretation of Ockham that is based on attributing that rule to him. (shrink)

The main result of this paper is the following theorem: each modal logic extendingK4 having the branching property belowm and the effective m-drop point property is decidable with respect to admissibility. A similar result is obtained for intermediate intuitionistic logics with the branching property belowm and the strong effective m-drop point property. Thus, general algorithmic criteria which allow to recognize the admissibility of inference rules for modal and intermediate logics of the above kind are found. These criteria are (...) applicable to most modal logics for which decidability with respect to admissibility is known and to many others, for instance, to the modal logicsK4,K4.1,K4.2,K4.3,S4.1,S4.2,GL.2; to all smallest and greatest counterparts of intermediate Gabbay-De-Jong logicsD n; to all intermediate Gabbay-De-Jong logicsD n; to all finitely axiomatizable modal and intermediate logics of finite depth etc. Semantic criteria for recognizing admissibility for these logics are offered as well. (shrink)

This discussion note aims to show that Moti Mizrahi does not make clear whether the proponents of the semantic view of scientific progress reject or accept the inference rule of Addition. If they reject the rule, then it does not make sense that Mizrahi contrives different types of disjuncts ‘on behalf of’ proponents of the semantic view. If they accept the rule, then the characterisation of the semantic view that Mizrahi discusses has nothing to do with the supposedly arbitrariness (...) of scientific progress, as Mizrahi contends. (shrink)