Online research in philosophy

Saul Kripke has made fundamental contributions to a variety of areas of logic, and his name is attached to a corresponding variety of objects and results. 1 For philosophers, by far the most important examples are ‘Kripke models’, which have been adopted as the standard type of models for modal and related non-classical logics. What follows is an elementary introduction to Kripke’s contributions in this area, intended to prepare the reader to tackle more formal treatments elsewhere.2 2. WHAT IS A MODEL THEORY? Traditionally, a statement is regarded as logically valid if it is an instance of a logically valid form, where a form is regarded as logically valid if every instance is true. In modern logic, forms are represented by formulas involving letters and special symbols, and logicians seek therefore to define a notion of model and a notion of a formula’s truth in a model in such a way that every instance of a form will be true if and only if a formula representing that form is true in every model. Thus the unsurveyably vast range of instances can be replaced for purposes of logical evaluation by the range of models, which may be more tractable theoretically and perhaps practically. Consideration of the familiar case of classical sentential logic should make these ideas clear. Here a formula, say (p & q) ∨ ¬p ∨ ¬q, will be valid if for all statements P..

The model-theoretic analysis of the concept of logical consequence has come under heavy criticism in the last couple of decades. The present work looks at an alternative approach to logical consequence where the notion of inference takes center stage. Formally, the model-theoretic framework is exchanged for a proof-theoretic framework. It is argued that contrary to the traditional view, proof-theoretic semantics is not revisionary, and should rather be seen as a formal semantics that can supplement model-theory. Specifically, there are formal resources to provide a proof-theoretic semantics for both intuitionistic and classical logic. We develop a new perspective on proof-theoretic harmony for logical constants which incorporates elements from the substructural era of proof-theory. We show that there is a semantic lacuna in the traditional accounts of harmony. A new theory of how inference rules determine the semantic content of logical constants is developed. The theory weds proof-theoretic and model-theoretic semantics by showing how proof-theoretic rules can induce truth-conditional clauses in Boolean and many-valued settings. It is argued that such a new approach to how rules determine meaning will ultimately assist our understanding of the apriori nature of logic.

Logic is formal in the sense that all arguments of the same form as logically valid arguments are also logically valid and hence truth-preserving. However, it is not known whether all arguments that are valid in the usual model-theoretic sense are truth-preserving. Tarski claimed that it could be proved that all arguments that are valid (in the sense of validity he contemplated in his 1936 paper on logical consequence) are truth-preserving. But he did not offer the proof. The question arises whether the usual model-theoretic sense of validity and Tarski's 1936 sense are the same. I argue in this paper that they probably are not, and that the proof Tarski had in mind, although unusable to prove that model-theoretically valid arguments are truth-preserving, can be used to prove that arguments valid in Tarski's 1936 sense are truth-preserving.

Everyday reasoning is replete with arguments which, though not logically valid, nonetheless harbor a measure of credibility in their own right. Here the claim that such arguments force us to acknowledge material validity, in addition to logical validity, is advanced, and criteria that attempt to unpack this concept are examined in detail. Of special concern is the effort to model these criteria on explications of logical validity that rely on notions of substitutivity and logical form. It is argued, however, that such a parallel is not easily located and that it is uncertain that a construal of material validity can be fashioned after traditional accounts of logical validity. Attention is also given to the topics of enthymemes and to the proper domain of logic.

The quantified relevant logic RQ is given a new semantics in which a formula ∀xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are modelled as functions from variable-assignments to propositions, where a proposition is a set of worlds in a relevant model structure. A completeness proof is given for a basic quantificational system QR from which RQ is obtained by adding the axiom EC of 'extensional confinement': ∀x(A V B) → (A V ∀xB), with x not free in A. Validity of EC requires an additional model condition involving the boolean difference of propositions. A QR-model falsifying EC is constructed by forming the disjoint union of two natural arithmetical structures in which negation is interpreted by the minus operation.

Introduction -- The concept of logical consequence -- Tarski's characterization of the common concept of logical consequence -- The logical consequence relation has a modal element -- The logical consequence relation is formal -- The logical consequence relation is A priori -- Logical and non-logical terminology -- The meanings of logical terms explained in terms of their semantic properties -- The meanings of logical terms explained in terms of their inferential properties -- Model-theoretic and deductive-theoretic conceptions of logic -- Linguistic preliminaries : the language M -- Syntax of M -- The definition of a well formed formula of M -- Semantics for M -- The sentential connectives are defined -- The notion of satisfaction is introduced and the quantifiers are defined -- Model-theoretic consequence -- Truth in a structure -- Satisfaction revisited -- Formalized definition of truth -- Model-theoretic consequence defined -- The model-theoretic definition and the concept of logical consequence -- Does the model theoretic consequence relation reflect the salient features of the common concept of logical consequence? -- What is a logical constant? -- Deductive consequence -- Deductive system n -- The deductive theoretic definition and the concept of logical consequence -- Tarski's criticism of the deductive theoretic definition -- Is N a correct deductive system?

Although the use of possible worlds in semantics has been very fruitful and is now widely accepted, there is a puzzle about the standard definition of validity in possible-worlds semantics that has received little notice and virtually no comment. A sentence of an intensional language is typically said to be valid just in case it is true at every world under every model on every model structure of the language. Each model structure contains a set of possible worlds, and models are defined relative to model structures, assigning truth-values to sentences at each world countenanced by the model structure. The puzzle is why more than one model structure is used in the definition of validity. There is presumably just one class of all possible worlds and just one model structure defined on this class that does correctly the things that model structures are supposed to do. (These include, but need not be limited to, specifying the set of individuals in each world as well as various accessibility relations between worlds.) Why not define validity simply as truth at every world under every model on this one model structure? What is the point of bringing in more model structures than just this one?

We investigate these questions in some detail and conclude that for many intensional languages the puzzle points to a genuine difficulty: the standard definition of validity is insufficiently motivated. We begin (Section 1) by showing that a plausible and natural account of validity for intensional languages can be based on a single model structure, and that validity so defined is analogous in important respects to the standard account of validity for extensional languages. We call this notion of validity "validity!", and in Section 2 we contrast it with the standard notion, which we call "validity2". Several attempts are made to discover a rationale for the almost universal acceptance of validity2, but in most of these attempts we come up empty-handed. So in Section 3 we investigate validity! for some intensional languages. Our investigation includes providing axiomatizations for several propositional and predicate logics, most of which are provably complete. The completeness proofs are given in the Appendix, which also contains a sketch of a compactness proof for one of the predicate logics.

What is the philosophical significance of the soundness and completeness theorems for first-order logic? In the first section of this paper I raise this question, which is closely tied to current debate over the nature of logical consequence. Following many contemporary authors' dissatisfaction with the view that these theorems ground deductive validity in model-theoretic validity, I turn to measurement theory as a source for an alternative view. For this purpose I present in the second section several of the key ideas of measurement theory, and in the third and central section of the paper I use these ideas in an account of the relation between model theory, formal deduction, and our logical intuitions.

We prove strong completeness of the □-version and the ◊-version of a Gödel modal logic based on Kripke models where propositions at each world and the accessibility relation are both infinitely valued in the standard Gödel algebra [0,1]. Some asymmetries are revealed: validity in the first logic is reducible to the class of frames having two-valued accessibility relation and this logic does not enjoy the finite model property, while validity in the second logic requires truly fuzzy accessibility relations and this logic has the finite model property. Analogues of the classical modal systems D, T, S4 and S5 are considered also, and the completeness results are extended to languages enriched with a discrete well ordered set of truth constants.

The theory of ranked partial structures allows a reinterpretation of several of the standard results of model theory and first-order logic and is intended to provide a proof-theoretic method which allows for the intuitions of model theory. A version of the downward Löwenheim-Skolem theorem is central to our development. In this paper we will present the basic theory of ranked partial structures and their logic including an appropriate version of the completeness theorem.