The permutability of rules in the classical inferential calculus

Publisher Website
Google Scholar
Abstract
We consider any set of Gentzen-type rules in a formal system of the following sort. The terms of the system are propositions, generally to be thought of as the propositions of some underlying theory. The elementary statements are of the form where and are finite sequences of propositions and (1) expresses a relation, called entailment, between such sequences. These sequences will be called prosequences; they may be void, or consist of a single proposition; and they may contain repetitions of the same proposition. The members of a prosequence will be called its constituents. Two prosequences which are permutations of one another will be regarded as the same. Prosequences will be designated by German letters, single propositions by Latin ones.The rules of the system are to be of the following form: This notation is to be understood as indicating p premises and a conclusion, each of the form (1). The constituents of and occur in all premises and conclusion; they are called the parametric constituents, or simply the parameters, of the inference.

This publication has 1 reference indexed in Scilit: