It is not the aim of the present essay to defend the principle of empiricism against apriorism or anti-empiricist metaphysics. Taking empirism for granted, we wish to discuss, the question what is meaningful. The word ‘meaning’ will here be taken in its empiricist sense; an expression of language has meaning in this sense if we know how to use it in speaking about empirical facts, either actual or possible ones. Now our problem is what expressions are meaningful in this sense. (...) We may restrict this question to sentences because expressions other than sentences are meaningful if and only if they can occur in a meaningful sentence. (shrink)

This is a dialogue between Lisa and Max on Dag Prawitz's work concerning the concept of deductive validity. Lisa first explains Prawitz's criticisms of the presently prevailing non‐epistemic analyses of validity. Then Lisa describes three different ways in which Prawitz attempted to develop an epistemic concept of validity. Max asks questions for clarification, raises some objections and compares Prawitz's three approaches with other lines of thought. Two inference rules are specially discussed: disjunction introduction and ex contradictione quodlibet. Max and Lisa (...) view Prawitz's contribution as part of a variegated, ongoing research pursuing an explication of the concept of validity, which began with the Socratic and Platonic distinction between merely persuasive arguments and good arguments and with Aristotle's definition of syllogism. Throughout the history of philosophy, logicians have aimed at clarifying a pre‐theoretic idea of good deduction and have proposed, criticized, refined, adjusted precise theoretical concepts of validity. Prawitz has criticized current views about validity, has advanced new proposals and revised them. His work is an important chapter of the long pursuit of the concept of validity. (shrink)

A. J. Ayer’s empiricist criterion of meaning was supposed to have sorted all statements into nonsense on the one hand, and tautologies or genuinely factual statements on the other. Unfortunately for Ayer, it follows from classical logic that his criterion is trivial—it classifies all statements as either tautologies or genuinely factual, but none as nonsense. However, in this paper, I argue that Ayer’s criterion of meaning can be defended from classical proofs of its triviality by the adoption of a relevant (...) logic—an idea which is motivated because, according to Ayer, the genuinely factual statements are those which observation is relevant to. (shrink)

Many commentators now view Quine's ‘Truth by Convention’ as a flawed criticism of Carnap. Gary Ebbs argued recently that Quine never intended Carnap as his target. Quine's criticisms were part of his attempt to work out his own scientific naturalism. I agree that Carnap was not Quine's target but object that Quine's criticisms were wholly internal to his own philosophy. Instead, I argue that C.I. Lewis held the kind of truth‐by‐convention thesis that Quine rejects. This, however, leaves Carnap out of (...) the picture. I then show how Quine came to see the earlier criticisms as also having force against Carnap. (shrink)

Propositional modal logic over relational frames is naturally extended with propositional quantifiers by letting them range over arbitrary sets of worlds of the relevant frame. This is also known as second-order propositional modal logic. The propositionally quantified modal logic of a class of relational frames is often not axiomatizable, although there are known exceptions, most notably the case of frames validating the strong modal logic $\mathrm {S5}$. Here, we develop new general methods with which many of the open questions in (...) this area can be answered. We illustrate the usefulness of these methods by applying them to a range of examples, which provide a detailed picture of which normal modal logics define classes of relational frames whose propositionally quantified modal logic is axiomatizable. We also apply these methods to establish new results in the multimodal case. (shrink)

In this work, we investigate the representation of counterfactual conditionals using the vector logic, a matrix-vector formalism for logical functions and truth values. Inside this formalism, the counterfactuals can be transformed in complex matrices preprocessing an implication matrix with one of the square roots of NOT, a complex matrix. This mathematical approach puts in evidence the virtual character of the counterfactuals. This happens because this representation produces a valuation of a counterfactual that is the superposition of the two opposite truth (...) values weighted, respectively, by two complex conjugated coefficients. This result shows that this procedure gives an uncertain evaluation projected on the complex domain. After this basic representation, the judgement of the plausibility of a given counterfactual allows us to shift the decision towards an acceptance or a refusal. This shift is the result of applying for a second time one of the two square roots of NOT. (shrink)

Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices, in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the axiom was replaced by the deontic axiom. In this paper, we propose even weaker systems, by eliminating (...) both axioms, which are characterized by eight-valued non-deterministic matrices. In addition, we prove completeness for those new systems. It is natural to ask if a characterization by finite ordinary logical matrices would be possible for all those Ivlev-like systems. We will show that finite deterministic matrices do not characterize any of them. (shrink)

Although much technical and philosophical attention has been given to relevance logics, the notion of relevance itself is generally left at an intuitive level. It is difficult to find in the literature an explicit account of relevance in formal reasoning. In this article I offer a formal explication of the notion of relevance in deductive logic and argue that this notion has an interesting place in the study of classical logic. The main idea is that a premise is relevant to (...) an argument when it contributes to the validity of that argument. I then argue that the sequents which best embody this ideal of relevance are the so-called perfect sequents—that is, sequents which are valid but have no proper subsequents that are valid. Church’s theorem entails that there is no recursively axiomatizable proof-system that proves all and only the perfect sequents, so the project that emerges from studying perfection in classical logic is not one of finding a perfect subsystem of classical logic, but is rather a comparative study of classifying subsystems of classical logic according to how well they approximate the ideal of perfection. (shrink)

This article presents Tarski's Address at the Princeton Bicentennial Conference on Problems of Mathematics, together with a separate summary. Two accounts of the discussion which followed are also included. The central topic of the Address and of the discussion is decision problems. The introductory note gives information about the Conference, about the background of the subjects discussed in the Address, and about subsequent developments to these subjects.

In this paper, we introduce the variety of |$I$|-modal ririgs. We characterize the congruence lattice of its members by means of |$I$|-filters, and we provide a description of |$I$|-filter generation. We also provide an axiomatic presentation for the variety generated by chains of the subvariety of contractive |$I$|-modal ririgs. Finally, we introduce a Hilbert-style calculus for a logic with |$I$|-modal ririgs as an equivalent algebraic semantics and we prove that such a logic has the parametrized local deduction-detachment theorem.