Constantin C. Brîncuș

The aim of this paper is to sketch a rough explanation of the notion of law of nature on the basis of the method of invariance under a group of transformations elaborated by the German mathematician Felix Klein. The explanation is given in analogy with Alfred Tarski’s proposal to explain the logical notions by this method. The paper provides an analysis of the principles of invariance (symmetry) in physics and discusses some arguments for the idea that these principles are not just theoretical instruments, but they rather have a real existence in the physical world.

Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, the categoricity problem is generated by the finite nature of the standard calculi and one direction in which it can be solved is to strengthen the deductive systems by adding infinitary rules (such as the ω-rule), i.e., to construct a full formalization. Another main direction is to provide a natural semantics for the standard rules of inference, i.e., a semantics for which these rules are categorical. My aim in this paper is to analyze some recent approaches for solving the categoricity problem and to argue that a logical inferentialist should accept the infinitary rules of inference for the first order quantifiers, since our use of the expressions “all” and “there is” leads us beyond the concrete and finite reasoning, and human beings do sometimes employ infinitary rules of inference in their reasoning.

This paper discusses the relation between the natural deduction rules of deduction in sequent format and the provability valuation starting from Garson’s Local Expression Theorem, which is meant to establish that the natural deduction rules of inference enforce exactly the classical meanings of the propositional connectives if these rules are taken to be locally valid, i.e. if they are taken to preserve sequent satisfaction. I argue that the natural deduction rules for disjunction are in no better position than the axiomatic calculi in uniquely determining the intended meaning of disjunction when the local models are used, if a satisfied sequent embeds, as a logical inferentialist should require, a formal derivability relation. This happens because, when governed by these rules and without additional semantic assumptions, the disjunction sign still expresses a non-extensional connective, i.e. a connective that, properly understood, has no unique logical characteristic. However, this is not a dead end for the logical inferentialists since both a multiple conclusions formalization of the disjunction operator and a bilateralist one do succeed in restoring the standard meaning of disjunction.

Due to Gӧdel’s incompleteness results, the categoricity of a sufficiently rich mathematical theory and the semantic completeness of its underlying logic are two mutually exclusive ideals. For first- and second-order logics we obtain one of them with the cost of losing the other. In addition, in both these logics the rules of deduction for their quantifiers are non-categorical. In this paper I examine two recent arguments –Warren (2020), Murzi and Topey (2021)– for the idea that the natural deduction rules for the first-order universal quantifier are categorical, i.e., they uniquely determine its semantic intended meaning. Both of them make use of McGee’s open-endedness requirement and the second one uses in addition Garson’s (2013) local models for defining the validity of these rules. I argue that the success of both these arguments is relative to their semantic or infinitary assumptions, which could be easily discharged if the introduction rule for the universal quantifier is taken to be an infinitary rule, i.e. non-compact. Consequently, I reconsider the use of the ω-rule and I show that the addition of the ω-rule to the standard formalizations of first-order logic is categorical. In addition, I argue that the open-endedness requirement does not make the first-order Peano Arithmetic categorical and I advance an argument for its categoricity based on the inferential conservativity requirement.

The categoricity problem for a system of logic reveals an asymmetry between the model-theoretic and the proof-theoretic resources of that logic. In particular, it reveals prima facie that the proof-theoretic instruments are insufficient for matching the envisaged model-theory, when the latter is already available. Among the proposed solutions for solving this problem, some make use of new proof-theoretic instruments, some others introduce new model-theoretic constrains on the proof-systems, while others try to use instruments from both sides. On the proof-theoretical side, two main approaches for solving the categoricity problem for propositional classical logic consist in the enforcement of the formal systems of this logic by introducing rules of inference of a new kind. A multiple-conclusions logic allows rules of inference with more than one conclusion, while a bilateralist system contains rules of inference formulated in terms of assertion and rejection. Both these approaches reveal interesting formal features of logical reasoning. This paper analyses some of the advantages and limitations of these two approaches as solutions for a full formalization of logic, i.e., for a categorical formalization.

This paper is a short introduction to Carnap’s writings on semantics with an emphasis on the transition from the syntactic period to the semantic one. I claim that one of Carnap’s main aims was to investigate the possibility of the symmetry between the syntactic and the semantic methods of approaching philosophical problems, both in logic and in the philosophy of science. This ideal of methodological symmetry could be described as an attempt to obtain categorical logical systems, i.e., systems that allow only the intended semantical interpretation.

A system of logic usually comprises a language for which a model-theory and a proof-theory are defined. The model-theory defines the semantic notion of model-theoretic logical consequence (⊨), while the proof-theory defines the proof- theoretic notion of logical consequence (or logical derivability, ⊢). If the system in question is sound and complete, then the two notions of logical consequence are extensionally equivalent. The concept of full formalization is a more restrictive one and requires in addition the preservation of the standard meanings of the logical terms in all the admissible interpretations of the logical calculus, as it is proof-theoretically defined. Although classical first-order logic is sound and complete, its standard formalizations fall short to be full formalizations since they allow non-intended interpretations. This fact poses a challenge for the logical inferentialism program, whose main tenet is that the meanings of the logical terms are uniquely determined by the formal axioms or rules of inference that govern their use in a logical calculus, i.e., logical inferentialism requires a categorical calculus. This paper is the first part of a more elaborated study which will analyze the categoricity problem from its beginning until the most recent approaches. I will first start by describing the problem of a full formalization in the general framework in which Carnap (1934/1937, 1943) formulated it for classical logic. Then, in sections IV and V, I shall discuss the way in which the mathematicians B.A. Bernstein (1932) and E.V. Huntington (1933) have previously formulated and analyzed it in algebraic terms for propositional logic and, finally, I shall discuss some critical reactions Nagel (1943), Hempel (1943), Fitch (1944), and Church (1944) formulated to these approaches.

K. R. Popper distinguished between two main uses of logic, the demonstrational one, in mathematical proofs, and the derivational one, in the empirical sciences. These two uses are governed by the following methodological constraints: in mathematical proofs one ought to use minimal logical means (logical minimalism), while in the empirical sciences one ought to use the strongest available logic (logical maximalism). In this paper I discuss whether Popper’s critical rationalism is compatible with a revision of logic in the empirical sciences, given the condition of logical maximalism. Apparently, if one ought to use the strongest logic in the empirical sciences, logic would remain immune to criticism and, thus, non-revisable. I will show that critical rationalism is theoretically compatible with a revision of logic in the empirical sciences. However, a question that remains to be clarified by the critical rationalists is what kind of evidence would lead them to revise the system of logic that underlies a physical theory, such as quantum mechanics? Popper’s falsificationist methodology will be compared with the recently advocated extension of the abductive methodology from the empirical sciences to logic by T. Williamson, since both of them arrive at the same conclusion concerning the status of classical logic.

Vann McGee has recently argued that Belnap’s criteria constrain the formal rules of classical natural deduction to uniquely determine the semantic values of the propositional logical connectives and quantifiers if the rules are taken to be open-ended, i.e., if they are truth-preserving within any mathematically possible extension of the original language. The main assumption of his argument is that for any class of models there is a mathematically possible language in which there is a sentence true in just those models. I show that this assumption does not hold for the class of models of classical propositional logic. In particular, I show that the existence of non-normal models for negation undermines McGee’s argument.

The idea that an adequate language for science needs a negation operator was recently dismissed by Kripke as "yet another dogma of empiricism”. That a scientist could, and even should, drop negation implies at least three points: 1. negativist theories, i.e., theories formulated in languages that include negation, are conservative extensions of their affirmativist versions; 2. negativist theories have no serious advantages over their affirmativist versions; 3. negativist theories are dispensable and should better be replaced by their affirmativist versions. We argue that all three points are problematic.

Starting from certain metalogical results, I argue that first-order logical truths of classical logic are a priori and necessary. Afterwards, I formulate two arguments for the idea that first-order logical truths are also analytic, namely, I first argue that there is a conceptual connection between aprioricity, necessity, and analyticity, such that aprioricity together with necessity entails analyticity; then, I argue that the structure of natural deduction systems for FOL displays the analyticity of its truths. Consequently, each philosophical approach to these truths should account for this evidence, i.e., that first-order logical truths are a priori, necessary, and analytic, and it is my contention that the semantic account is a better candidate.

The problem analysed in this paper is whether we can gain knowledge by using valid inferences, and how we can explain this process from a model-theoretic perspective. According to the paradox of inference (Cohen & Nagel 1936/1998, 173), it is logically impossible for an inference to be both valid and its conclusion to possess novelty with respect to the premises. I argue in this paper that valid inference has an epistemic significance, i.e., it can be used by an agent to enlarge his knowledge, and this significance can be accounted in model-theoretic terms. I will argue first that the paradox is based on an equivocation, namely, it arises because logical containment, i.e., logical implication, is identified with epistemological containment, i.e., the knowledge of the premises entails the knowledge of the conclusion. Second, I will argue that a truth-conditional theory of meaning has the necessary resources to explain the epistemic significance of valid inferences. I will explain this epistemic significance starting from Carnap’s semantic theory of meaning and Tarski’s notion of satisfaction. In this way I will counter (Prawitz 2012b)’s claim that a truth-conditional theory of meaning is not able to account the legitimacy of valid inferences, i.e., their epistemic significance.

The concern of deductive logic is generally viewed as the systematic recognition of logical principles, i.e., of logical truths. This paper presents and analyzes different instantiations of the three main interpretations of logical principles, viz. as ontological principles, as empirical hypotheses, and as true propositions in virtue of meanings. I argue in this paper that logical principles are true propositions in virtue of the meanings of the logical terms within a certain linguistic framework. Since these principles also regulate and control the process of deduction in inquiry, i.e., they are prescriptive for the use of language and thought in inquiry, I argue that logic may, and should, be seen as an instrument or as a way of proceeding (modus procedendi) in inquiry.