This paper proposes substitutional definitions of logical truth and consequence in terms of relative interpretations that are extensionally equivalent to the model-theoretic definitions for any relational first-order language. Our philosophical motivation to consider substitutional definitions is based on the hope to simplify the meta-theory of logical consequence. We discuss to what extent our definitions can contribute to that.

A substitutional account of logical validity for formal first‐order languages is developed and defended against competing accounts such as the model‐theoretic definition of validity. Roughly, a substitution instance of a sentence is defined as the result of uniformly substituting nonlogical expressions in the sentence with expressions of the same grammatical category and possibly relativizing quantifiers. In particular, predicate symbols can be replaced with formulae possibly containing additional free variables. A sentence is defined to be logically true iff all its substitution (...) instances are satisfied by all variable assignments. Logical consequence is defined analogously. Satisfaction is taken to be a primitive notion and axiomatized.For every set‐theoretic model in the sense of model theory there exists a corresponding substitutional interpretation in a sense to be specified. Conversely, however, there are substitutional interpretations – in particular the ‘intended’ interpretation – that lack a model‐theoretic counterpart. The substitutional definition of logical validity overcomes the weaknesses of more restrictive accounts of substitutional validity; unlike model‐theoretic logical consequence, the substitutional notion is trivially and provably truth preserving. In Kreisel's squeezing argument the formal notion of substitutional validity naturally slots into the place of intuitive validity. (shrink)

The Löwenheim-Hilbert-Bernays theorem states that, for an arithmetical first-order language L, if S is a satisfiable schema, then substitution of open sentences of L for the predicate letters of S...

I discuss Putnam’s conception of logical truth as grounded in his picture of mathematical practice and ontology. i begin by comparing Putnam’s 1971 Philosophy of Logic with Quine’s homonymous book. Next, Putnam’s changing views on modality are surveyed, moving from the modal pre-formal to the de-modalized formal characterization of logical validity. Section three suggests a complementary view of Platonism and modalism underlying different stages of a dynamic mathematical practice. The final section argues for the pervasive platonistic conception of the working (...) mathematician. (shrink)

What we call the Hilbert‐Bernays (HB) Theorem establishes that for any satisfiable first‐order quantificational schema S, there are expressions of elementary arithmetic that yield a true sentence of arithmetic when they are substituted for the predicate letters in S. Our goals here are, first, to explain and defend W. V. Quine's claim that the HB theorem licenses us to define the first‐order logical validity of a schema in terms of predicate substitution; second, to clarify the theorem by sketching an accessible (...) and illuminating new proof of it; and, third, to explain how Quine's substitutional definition of logical notions can be modified and extended in ways that make it more attractive to contemporary logicians. (shrink)