We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Väänänen, and their compositional semantics due to Hodges. We show how Hodges’ semantics can be seen as a special case of a general construction, which provides a context for a useful completeness theorem with respect to a wider class of models. We shed some new light on each aspect of the logic. We show that the natural propositional logic carried by the semantics (...) is the logic of Bunched Implications due to Pym and O’Hearn, which combines intuitionistic and multiplicative connectives. This introduces several new connectives not previously considered in logics of informational dependence, but which we show play a very natural rôle, most notably intuitionistic implication. As regards the quantifiers, we show that their interpretation in the Hodges semantics is forced, in that they are the image under the general construction of the usual Tarski semantics; this implies that they are adjoints to substitution, and hence uniquely determined. As for the dependence predicate, we show that this is definable from a simpler predicate, of constancy or dependence on nothing. This makes essential use of the intuitionistic implication. The Armstrong axioms for functional dependence are then recovered as a standard set of axioms for intuitionistic implication. We also prove a full abstraction result in the style of Hodges, in which the intuitionistic implication plays a very natural rôle. (shrink)

Although Kant envisaged a prominent role for logic in the argumentative structure of his Critique of pure reason, logicians and philosophers have generally judged Kant's logic negatively. What Kant called `general' or `formal' logic has been dismissed as a fairly arbitrary subsystem of first order logic, and what he called `transcendental logic' is considered to be not a logic at all: no syntax, no semantics, no definition of validity. Against this, we argue that Kant's `transcendental logic' is a logic in (...) the strict formal sense, albeit with a semantics and a definition of validity that are vastly more complex than that of first order logic. The main technical application of the formalism developed here is a formal proof that Kant's Table of Judgements in §9 of the Critique of pure reason, is indeed, as Kant claimed, complete for the kind of semantics he had in mind. This result implies that Kant's 'general' logic is after all a distinguished subsystem of first order logic, namely what is known as geometric logic. (shrink)

This paper offers a novel method for nominalizing metalogic without transcending first-order reasoning about physical tokens (inscriptions, etc.) of proofs. A kind of double-negation scheme is presented which helps construct, for any platonistic statement in metalogic, a nominalistic statement which has the same assertability condition as the former. For instance, to the platonistic statement there is a (platonistic) proof of A in deductive system D corresponds the nominalistic statement there is no (metalogical) proof token in (possibly informal) set theory for (...) the claim that there is no proof of A in D. And it is argued that the nominalist can use all the platonistic results by transforming them into such nominalistic correlates. (shrink)

Following its inception (Barwise and Perry, 1983), situation theory has quickly matured (Cooper et al., 1990; Devlin, 1991) and under the familiarname of situation semantics has been applied to a number of linguistic issues (Barwise, 1987; Barwise, 1989; Barwise and Etchemendy, 1987; Cooper, 1986; Cooper, 1991; Cooper et al., 1990; Fenstad et al., 1987), including quanti cation and anaphora (Gawron and Peters, 1990). In the past, the development of a `mathematical'situation theory has been held back by a lack of availability (...) of appropriate technical tools. But by now, the theory has assembled its mathematical foundations based on intuitions basically coming from set theory and logic (Aczel, 1988; Barwise, 1989; Cooper et al., 1990). With a remarkably original view of information (which is fully adapted by situation theory) (Dretske, 1981), a `logic,' based not on truth but on information, is being developed (Devlin, 1991). This logic will probably be an extension of rst-order logic (Barwise, 1977) rather than being an alternative to it. (shrink)

Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the question of which are most adequate to model updates. A systematic approach to face this question is to identify general principles against which such semantics could be evaluated. In this paper we motivate and introduce a new such principle the refined extension principle. Such principle is complied with by the stable model semantics for (single) (...) logic programs. It turns out that none of the existing semantics for logic program updates, even though generalisations of the stable model semantics, comply with this principle. For this reason, we define a refinement of the dynamic stable model semantics for Dynamic Logic Programs that complies with the principle. (shrink)

The first page of Frege’s classic “Uber Sinn und Bedeutung” sets for more than a hundred years now the agenda for much of semantics and the philosophy of mind. It presents a purported puzzle whose solution is said to call upon the “entities” of semantics (meanings) and psychological explanation (Psychological states, beliefs, concepts). The paper separates three separate alleged puzzles that can be read into Frege’s data. It then argues that none are genuine puzzles. In turn, much of the Frege-driven (...) theoretical development, motivated as an inevitable “solution”, is thrown into doubt. (shrink)

We investigate the philosophical significance of the existence of different semantic systems with respect to which a given deductive system is sound and complete. Our case study will be Corcoran’s deductive system D for Aristotelian syllogistic and some of the different semantic systems for syllogistic that have been proposed in the literature. We shall prove that they are not equivalent, in spite of D being sound and complete with respect to each of them. Beyond the specific case of syllogistic, the (...) goal is to offer a general discussion of the relations between informal notions—in this case, an informal notion of deductive validity—and logical apparatuses such as deductive systems and (model-theoretic or other) semantic systems that aim at offering technical, formal accounts of informal notions. Specifically, we will be interested in Kreisel’s famous ‘squeezing argument’; we shall ask ourselves what a plurality of semantic systems (understood as classes of mathematical structures) may entail for the cogency of specific applications of the squeezing argument. More generally, the analysis brings to the fore the need for criteria of adequacy for semantic systems based on mathematical structures. Without such criteria, the idea that the gap between informal and technical accounts of validity can be bridged is put under pressure. (shrink)

In this paper we apply the idea of Revision Rules, originally developed within the framework of the theory of truth and later extended to a general mode of definition, to the analysis of the arithmetical hierarchy. This is also intended as an example of how ideas and tools from philosophical logic can provide a different perspective on mathematically more “respectable” entities. Revision Rules were first introduced by A. Gupta and N. Belnap as tools in the theory of truth, and they (...) have been further developed to provide the foundations for a general theory of (possibly circular) definitions. Revision Rules are non-monotonic inductive operators that are iterated into the transfinite beginning with some given “bootstrapper” or “initial guess.” Since their iteration need not give rise to an increasing sequence, Revision Rules require a particular kind of operation of “passage to the limit,” which is a variation on the idea of the inferior limit of a sequence. We then define a sequence of sets of strictly increasing arithmetical complexity, and provide a representation of these sets by means of an operator G(x, φ) whose “revision” is carried out over ω2 beginning with any total function satisfying certain relatively simple conditions. Even this relatively simple constraint is later lifted, in a theorem whose proof is due to Anil Gupta. (shrink)

The purpose of this note is to acknowledge a gap in a previous paper — “The Complexity of Revision”, see [1] — and provide a corrected version of argument. The gap was originally pointed out by Francesco Orilia (personal communication and [4]), and the fix was developed in correspondence with Vann McGee.

This paper presents a bivalent extensional semantics for positive free logic without resorting to the philosophically questionable device of using models endowed with a separate domain of non-existing objects. The models here introduced have only one (possibly empty) domain, and a partial reference function for the singular terms (that might be undefined at some arguments). Such an approach provides a solution to an open problem put forward by Lambert, and can be viewed as supplying a version of parametrized truth non (...) unlike the notion of truth at world found in modal logic. A model theory is developed, establishing compactness, interpolation (implying a strong form of Beth definability), and completeness (with respect to a particular axiomatization). (shrink)

The method of analytic tableaux is employed in many introductory texts and has also been used quite extensively as a basis for automated theorem proving. In this paper, we discuss the complexity of the system as a method for refuting contradictory sets of clauses, and resolve several open questions. We discuss the three forms of analytic tableaux: clausal tableaux, generalized clausal tableaux, and binary tableaux. We resolve the relative complexity of these three forms of tableaux proofs and also resolve the (...) relative complexity of analytic tableaux versus resolution. We show that there is a quasi-polynomial simulation of tree resolution by analytic tableaux; this simulation is close to optimal, since we give a matching lower bound that is tight to within a polynomial. (shrink)

We have earlier shown by construction that a proposition can have a welldefined nonzero probability, even if it is justified by an infinite probabilistic regress. We thought this to be an adequate rebuttal of foundationalist claims that probabilistic regresses must lead either to an indeterminate, or to a determinate but zero probability. In a comment, Frederik Herzberg has argued that our counterexamples are of a special kind, being what he calls ‘solvable’. In the present reaction we investigate what Herzberg means (...) by solvability. We discuss the advantages and disadvantages of making solvability a sine qua non , and we ventilate our misgivings about Herzberg’s suggestion that the notion of solvability might help the foundationalist. (shrink)

In an earlier paper we have shown that a proposition can have a well-defined probability value, even if its justification consists of an infinite linear chain. In the present paper we demonstrate that the same holds if the justification takes the form of a closed loop. Moreover, in the limit that the size of the loop tends to infinity, the probability value of the justified proposition is always well-defined, whereas this is not always so for the infinite linear chain. This (...) suggests that infinitism sits more comfortably with a coherentist view of justification than with an approach in which justification is portrayed as a linear process. (shrink)

This book expounds and defends a new conception of the relation between truth and meaning. Atlas argues that the sense of a sense-general sentence radically underdetermines (independently of indexicality) its truth-conditional content. He applies this linguistic analysis to illuminate old and new philosophical problems of meaning, truth, falsity, negation, existence, presupposition, and implicature. In particular, he demonstrates how the concept of ambiguity has been misused and confused with other concepts of meaning, and how the interface between semantics and pragmatics has (...) been misunderstood. The problems he tackles are common to philosophy, linguistics, cognitive psychology, and artificial intelligence, and his conclusions will be of interest to all those working in these fields. (shrink)

One of the most important paraconsistent logics is the logic mCi, which is one of the two basic logics of formal inconsistency. In this paper we present a 5-valued characteristic nondeterministic matrix for mCi. This provides a quite non-trivial example for the utility and effectiveness of the use of non-deterministic many-valued semantics.

In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent. One of the oldest and best known approaches to the problem of designing useful paraconsistent logics is da Costa’s approach, which seeks to allow the use of classical logic whenever it is safe to do so, but behaves completely differently when contradictions are involved. Da Costa’s approach has led to the family of logics (...) of formal (in)consistency (LFIs). In this paper we provide in a modular way simple non-deterministic semantics for 64 of the most important logics from this family. Our semantics is 3-valued for some of the systems, and infinite-valued for the others. We prove that these results cannot be improved: neither of the systems with a three-valued non-deterministic semantics has either a finite characteristic ordinary matrix or a two-valued characteristic non-deterministic matrix, and neither of the other systems we investigate has a finite characteristic non-deterministic matrix. Still, our semantics provides decision procedures for all the systems investigated, as well as easy proofs of important proof-theoretical properties of them. (shrink)

This papers aims to analyse sentences of a self-referential language containing a truth-predicate by means of a Smullyan-style tableau system. Our analysis covers three variants of Kripke's partial-model semantics (strong and weak Kleene's and supervaluational) and three variants of the revision theory of truth (Belnap's, Gupta's and Herzberger's).

The aim of this paper is to show that it’s not a good idea to have a theory of truth that is consistent but ω -inconsistent. In order to bring out this point, it is useful to consider a particular case: Yablo’s Paradox. In theories of truth without standard models, the introduction of the truth-predicate to a first order theory does not maintain the standard ontology. Firstly, I exhibit some conceptual problems that follow from so introducing it. Secondly, I show (...) that in second order theories with standard semantics the same procedure yields a theory that doesn’t have models. So, while having an ω - inconsistent theory is a bad thing, having an unsatisfiable theory of truth is actually worse. This casts doubts on whether the predicate in question is, after all, a truthpredicate for that language. Finally, I present some alternatives to prove an inconsistency adding plausible principles to certain theories of truth. (shrink)

Book Information Algebraic Methods in Philosophical Logic. By J. Michael Dunn and Gary Hardegree. Clarendon Press. Oxford. 2001. Pp. xv + 470. 60.50.

Restricting attention to the class of extensive games defined by von Neumann and Morgenstern with the added assumption of perfect recall, we specify the information of each player at each node of the game-tree in a way which is coherent with the original information structure of the extensive form. We show that this approach provides a framework for a formal and rigorous treatment of questions of knowledge and common knowledge at every node of the tree. We construct a particular information (...) partition for each player and show that it captures the notion of maximum information in the sense that it is the finest within the class of information partitions that satisfy four natural properties. Using this notion of “maximum information” we are able to provide an alternative characterization of the meet of the information partitions. (shrink)

In a number of influential papers, Hartry Fieldhas advanced an account of truth and referencethat we might dub quasi-disquotationalism. According to quasi-disquotationalism, truth and reference are to be explained in terms of disquotationand facts about what constitute a goodtranslation into our language. Field suggeststhat we might view quasi-disquotationalism aseither (a) an analysis of our ordinarytruth-theoretic concepts of reference andtruth, or (b) an account of certain otherconcepts that improve upon our ordinaryconcepts. In this paper, I argue that (i) ifthe view is (...) understood along the lines of (a)it fails, and (ii) if it is construed along thelines of (b) it is, at best, under-motivated. (shrink)

Although a very recent topic in contemporary logic, the subject of combinations of logics has already shown its deep possibilities. Besides the pure philosophical interest offered by the possibility of defining mixed logic systems in which distinct operators obey logics of different nature, there are also several pragmatical and methodological reasons for considering combined logics. We survey methods for combining logics (integration of several logic systems into a homogeneous environment) as well as methods for decomposing logics, showing their interesting properties (...) and applications. (shrink)

Conservativeness has been proposed as an important requirement for deflationary truth theories. This in turn gave rise to the so-called ‘conservativeness argument’ against deflationism: a theory of truth which is conservative over its base theory S cannot be adequate, because it cannot prove that all theorems of S are true. In this paper we show that the problems confronting the deflationist are in fact more basic: even the observation that logic is true is beyond his reach. This seems to conflict (...) with the deflationary characterization of the role of the truth predicate in proving generalizations. However, in the final section we propose a way out for the deflationist — a solution that permits him to accept a strong theory, having important truth-theoretical generalizations as its theorems. (shrink)

By a classical result of Kotlarski, Krajewski and Lachlan, pathological satisfaction classes can be constructed for countable, recursively saturated models of Peano arithmetic. In this paper we consider the question of whether the pathology can be eliminated; we ask in effect what generalities involving the notion of truth can be obtained in a deflationary truth theory (a theory of truth which is conservative over its base). It is shown that the answer depends on the notion of pathology we adopt. It (...) turns out in particular that a certain natural closure condition imposed on a satisfaction class—namely, closure of truth under sentential proofs—generates a nonconservative extension of a syntactic base theory (Peano arithmetic). (shrink)

We discuss two desirable properties of deflationary truth theories: conservativeness and maximality. Joining them together, we obtain a notion of a maximal conservative truth theory – a theory which is conservative over its base, but can’t be enlarged any further without losing its conservative character. There are indeed such theories; we show however that none of them is axiomatizable, and moreover, that there will be in fact continuum many theories of this sort. It turns out in effect that the deflationist (...) still needs some additional principles, which would permit him to construct his preferred theory of truth. (shrink)

The mathematical concept of pragmatic truth, first introduced in Mikenberg, da Costa and Chuaqui (1986), has received in the last few years several applications in logic and the philosophy of science. In this paper, we study the logic of pragmatic truth, and show that there are important connections between this logic, modal logic and, in particular, Jaskowski''s discussive logic. In order to do so, two systems are put forward so that the notions of pragmatic validity and pragmatic truth can be (...) accommodated. One of the main results of this paper is that the logic of pragmatic truth is paraconsistent. The philosophical import of this result, which justifies the application of pragmatic truth to inconsistent settings, is also discussed. (shrink)

On the basis of elementary thinkingabout language functioning,a solution of truth paradoxes isgiven and a correspondingsemantics of a truth predicateis founded. It is shown that it is precisely thetwo-valued description of the maximal intrinsic fixedpoint of the strong Kleene three-valuedsemantics.

This title introduces students to non-classical logic, syllogistic, to quantificational and modal logic. The book includes exercises throughout and a glossary of terms and symbols. Taking students beyond classical mathematical logic, "Philosophical Logic" is a wide-ranging introduction to more advanced topics in the study of philosophical logic. Starting by contrasting familiar classical logic with constructivist or intuitionist logic, the book goes on to offer concise but easy-to-read introductions to such subjects as quantificational and syllogistic logic, modal logic and set theory. (...) Chapters of this title include: Sentential Logic; Quantificational Logic; Sentential Modal Logic; Quantification and Modality; Set Theory; Incompleteness; An Introduction to Term Logic; and, Modal Term Logic. In addition, the book includes a list of symbols and a glossary of terms for ease of reference and exercises throughout help students master the topics covered in the book. (shrink)

We can think of functional completeness in systems of propositional logic as a form of expressive completeness: while every logical constant in such system expresses a truth-function of finitely many arguments, functional completeness garantees that every truth-function of finitely many arguments can be expressed with the constants in the system. From this point of view, a functionnaly complete system of propositionnal logic can thus be seen as one where no logical constant is missing. Can a similar question be formulated for (...) quantified first-order logics ? How to make sense of the question whether, e.g., ordinary first-order logic is "functionaly" complete or have no logical constant missing ? In this note, we build on a suggestive proposal made by Bonnay(2006) and shows that it is equivalent to the criterion that a first-order logic L be functionaly complete if and only if every class of structures closed under L-elementary equivalence is L-elementary. Ordinary first-order logic is not complete in this sense. We raise the question whether any logic can be. -/- . (shrink)

The paradox of knowability and the debate about it are shortly presented. Some assumptions which appear more or less tacitly involved in its discussion are made explicit. They are embedded and integrated in a Russellian framework, where a formal paradox, very similar to the Russell-Myhill paradox, is derived. Its solution is provided within a Russellian formal logic introduced by A. Church. It follows that knowledge should be typed. Some relevant aspects of the typing of knowledge are pointed out.

Central to any form of Deflationism concerning truth (hereafter ‘DT’) is the claim that truth has no substantial theoretical role to play. For this reason, DT faces the following immediate challenge: if truth can play no substantial theoretical role then how can we model various prevalent kinds of indeterminacy—such as the indeterminacy exhibited by vague predicates, future contingents, liar sentences, truth-teller sentences, incomplete stipulations, cases of presupposition failure, and such-like? It is too hasty to assume that these phenomena are all (...) to be modelled via some epistemic conception of indeterminacy whereby indeterminacy is just some special species of ignorance which arises because of our limited powers of discrimination. Some non-epistemic model is called for—at least for certain species of indeterminacy. On what is perhaps the most enduring and popular non-epistemic model, indeterminacy gives rise to truth-value gaps. But is DT compatible with the possibility of truth-value gaps? Compatibilism says Yes; Incompatibilism says No. The broad goal of this paper is to defend a form of Incompatibilism. If DT is to make sense of various kinds of indeterminacy then truth-value gaps cannot be invoked to do so. The particular goals of this paper are: (i) To set forth a new form of Compatibilism which can address an argument against truth-value gaps given by Williamson (1994, pp. 187-192). (ii) To offer a new argument against truth-value gaps using principles entailed by DT, thereby undermining Compatibilism. (shrink)

Several accounts of logical truth are compared and shown to define distinct concepts. Nevertheless, conditions are given under which they happen to declare exactly the same sentences logically true. These conditions involve the variety of objects in the domain, the richness of the language, and the logical resources available. It is argued that the class of sentences declared logically true by each of the accounts depends on particularities of the actual world.

The traditional view that all logical truths are metaphysically necessary has come under attack in recent years. The contrary claim is prominent in David Kaplan’s work on demonstratives, and Edward Zalta has argued that logical truths that are not necessary appear in modal languages supplemented only with some device for making reference to the actual world (and thus independently of whether demonstratives like ‘I’, ‘here’, and ‘now’ are present). If this latter claim can be sustained, it strikes close to the (...) heart of the traditional view. I begin this paper by discussing and refuting Zalta’s argument in the context of a language for propositional modal logic with an actuality connective (section 1). This involves showing that his argument in favor of real world validity his preferred explication of logical truth, is fallacious. Next (section 2) I argue for an alternative explication of logical truth called general validity. Since the rule of necessitation preserves general validity, the argument of section 2 provides a reason for affirming the traditional view. Finally (section 3) I show that the intuitive idea behind the discredited notion of real world validity finds legitimate expression in an object language connective for deep necessity. (shrink)

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. (shrink)

Stig Kanger (1924--1988) made important contributions to logic and formal philosophy. Kanger's most original achievements were in the areas of general proof theory, the semantics of modal and deontic logic, and the logical analysis of the concept of rights. But he contributed significantly to action theory, preference logic and the theory of measurement as well. The first volume is a complete collection of Kanger's philosophical papers. The second volume contains critical essays on the various aspects of Kanger's work as well (...) as some biographical sketches. (shrink)

A strong and weak version of the redundancy theory of truth are distinguished. An argument put forth by Michael Dummett concludes that the weak version is vitiated by truth-value gaps. The weak version is defended against this argument. The strong version, however, is vitiated by truth-value gaps.

An account of the logic of bivalent languages with truth-value gaps is given. This account is keyed to the use of tables introduced by S. C. Kleene. The account has two guiding ideas. First, that the bivalence property insures that the language satisfies classical logic. Second, that the general concepts of a valid sentence and an inconsistent sentence are, respectively, as sentences which are not false in any model and sentences which are not true in any model. What recommends this (...) approach is (1) its relative simplicity, and (2) the fact that it leaves the fundamental features of classical logic intact. (shrink)

Suppose there is a domain of discourse of English, then everything of which any predicate is true is a member of that domain. If English has a domain of discourse, then, since ‘is a domain of discourse of English’ is itself a predicate of English and true of that domain, that domain is a member of itself. But nothing is a member of itself. Thus English has no domain of discourse. We defend this argument and go on to argue to (...) the same conclusion without relying on the supposition that English is a language which contains the predicate ‘is a domain of discourse of English’. (shrink)

The aim of this paper is to provide a nondenotational semantics for first-order languages which will match one for one each distribution of truth-values available in terms of a denotational semantics.

In this paper the authors argue that if Tarski’s definition of truth for the calculus of classes is correct, then set theories which assert the existence of proper classes (classes which are not the member of anything) are incorrect.

A plausible line of thought runs as follows. If P is a semantically primitive predicate of a first order language L, then P requires its own clause in the definition of satisfaction integral to a definition of truth for L. Thus if L has infinitely many such P the satisfaction clause cannot be completed nor can a theory of truth for L. Robert Cummins takes issue with this line of argument. This paper takes issue with Cummins.

As a way of dealing with the semantical paradoxes Quine has suggested: that semantical expressions such as ‘true’ and ‘true of’ be used with numerical subscripts; that when a truth locution T is applied to a sentence S, the subscript on T is greater than any within S; otherwise, the result of applying T to S is ill formed. A problem is that this introduces infinitely many semantical primitives. The paper suggests a way around the problem. The paper raises a (...) further problem, leaving it open whether this further problem has a satisfactory solution. (shrink)

A formal, computational, semantically clean representation of natural language is presented. This representation captures the fact that logical inferences in natural language crucially depend on the semantic relation of entailment between sentential constituents such as determiner, noun, adjective, adverb, preposition, and verb phrases.The representation parallels natural language in that it accounts for human intuition about entailment of sentences, it preserves its structure, it reflects the semantics of different syntactic categories, it simulates conjunction, disjunction, and negation in natural language by computable (...) operations with provable mathematical properties, and it allows one to represent coordination on different syntactic levels. (shrink)

This paper analyzes the logical truths as (very roughly) those truths that would still have been true under a certain range of counterfactual perturbations.What’s nice is that the relevant range is characterized without relying (overtly, at least) upon the notion of logical truth. This approach suggests a conception of necessity that explains what the different varieties of necessity (logical, physical, etc.) have in common, in virtue of which they are all varieties of necessity. However, this approach places the counterfactual conditionals (...) in an unfamiliar foundational role. (shrink)

Assuming the indefinite extensibility of any domain of quantification leads to reasoning with extensible domain semantics. It is showed that some theorems (e.g. Thomson's) in conventional semantics logic are not theorems in a logic provided with this new semantics.

It is a consequence of Quine’s confirmation holism that the logical laws are in principle revisable. Some have worried this is at odds with another dictum in Quine, viz., that any translation which construes speakers as systematically illogical is ipso facto inadequate. In this paper, I try to formulate exactly what the problem is here, and offer a solution to it by (1) disambiguating the term ‘logic,’ and (2) appealing to a Quinean understanding of ‘necessity.’ The result is that the (...) different theses in Quine’s philosophy of logic are to be situated within different contexts of inquiry. (shrink)

Various conceptual approaches to the notion of information can currently be traced in the literature in logic and formal epistemology. A main issue of disagreement is the attribution of truthfulness to informational data, the so called Veridicality Thesis (Floridi 2005). The notion of Epistemic Constructive Information (Primiero 2007) is one of those rejecting VT. The present paper develops a formal framework for ECI. It extends on the basic approach of Artemov’s logic of proofs (Artemov 1994), representing an epistemic logic based (...) on dependent justifications, where the definition of information relies on a strict distinction from factual truth. The definition obtained by comparison with a Normal Modal Logic translates a constructive logic for “becoming informed”: its distinction from the logic of “being informed”—which internalizes truthfulness—is essential to a general evaluation of information with respect to truth. The formal disentanglement of these two logics, and the description of the modal version of the former as a weaker embedding into the latter, allows for a proper understanding of the Veridicality Thesis with respect to epistemic states defined in terms of information. (shrink)

The correspondence theory of truth has experienced something of a revival recently in the form of the Truthmaker Axiom: whatever is true, something makes it true. We consider various postulates which have been proposed to characterize truthmaking, in particular, the Disjunction Thesis (DT), that whatever makes a disjunction true must make one or other disjunct true. In conjunction with certain other assumptions, DT leads to triviality. We show that there are elaborations of truthmaking on which DT holds (which must therefore (...) take steps to avoid the triviality); but that there are more plausible accounts of truthmaking on which DT fails. (shrink)

This note explains an error in Restall’s ‘Simplified Semantics for Relevant Logics (and some of their rivals)’ (Restall, J Philos Logic 22(5):481–511, 1993 ) concerning the modelling conditions for the axioms of assertion A → (( A → B ) → B ) (there called c 6) and permutation ( A → ( B → C )) → ( B → ( A → C )) (there called c 7). We show that the modelling conditions for assertion and permutation proposed (...) in ‘Simplified Semantics’ overgenerate. In fact, they overgenerate so badly that the proposed semantics for the relevant logic R validate the rule of disjunctive syllogism. The semantics provides for no models of R in which the “base point” is inconsistent. This problem is not restricted to ‘Simplified Semantics.’ The techniques of that paper are used in Graham Priest’s textbook An Introduction to Non-Classical Logic (Priest, 2001 ), which is in wide circulation: it is important to find a solution. In this article, we explain this result, diagnose the mistake in ‘Simplified Semantics’ and propose two different corrections. (shrink)

Routley-Meyer type ternary relational semantics are defined for relevant logics including Routley and Meyer’s basic logic B plus the reductio rule and the disjunctive syllogism. Standard relevant logics such as E and R (plus γ ) and Ackermann’s logics of ‘strenge Implikation’ Π and Π ′ are among the logics considered.

Propositional identity is not expressed by a predicate. So its logic is not given by the ordinary first order axioms for identity. What are the logical axioms governing this concept, then? Some axioms in addition to those proposed by Arthur Prior are proposed.

This paper gives a semantical account for the (i)ordinary propositional calculus, enriched with quantifiers binding variables standing for sentences, and with an identity-function with sentences as arguments; (ii)the ordinary theory of quantification applied to the special quantifiers; and (iii)ordinary laws of identity applied to the special function. The account includes some thoughts of Roman Suszko as well as some thoughts of Wittgenstein's Tractatus.

There are plausible objections to substitutional construals of generalization. But these objections do not apply to a substitutional construal of generalization proposed by Peter Geach several years ago. This paper examines Geach’s conception.

The purpose of this paper is to present a thought experiment and argument that spells trouble for “radical” deflationism concerning meaning and truth such as that advocated by the staunch nominalist Hartry Field. The thought experiment does not sit well with any view that limits a truth predicate to sentences understood by a given speaker or to sentences in (or translatable into) a given language, unless that language is universal. The scenario in question concerns sentences that are not understood but (...) are known to be logical consequences of known and understood sentences. Ultimately, the issue turns on the notion of logical consequence that is available to various versions of deflationism. (shrink)

We conducted a computer-based psychological experiment in which a random mix of 40 tautologies and 40 non-tautologies were presented to the participants, who were asked to determine which ones of the formulas were tautologies. The participants were eight university students in computer science who had received tuition in propositional logic. The formulas appeared one by one, a time-limit of 45 s applied to each formula and no aids were allowed. For each formula we recorded the proportion of the participants who (...) classified the formula correctly before timeout (accuracy) and the mean response time among those participants (latency). We propose a new proof formalism for modeling propositional reasoning with bounded cognitive resources. It models declarative memory, visual memory, working memory, and procedural memory according to the memory model of Atkinson and Shiffrin and reasoning processes according to the model of Newell and Simon. We also define two particular proof systems, T and NT , for showing propositional formulas to be tautologies and non-tautologies, respectively. The accuracy was found to be higher for non-tautologies than for tautologies ( p T was .89 and for non-tautologies the correlation between latency and minimum proof length in NT was .87. (shrink)

For someone who is inclined towards truth monism and moral realism, reading this book is like journeying through a foreign country: somewhat disconcerting, but nonetheless enjoyable. Michael Lynch’s world is a stoutly naturalistic world, in which representation is conceived in terms of causal or teleological relations. This is a world in which it is hard to fit normative facts. Thus, the reader is told that there are good reasons to think that ‘moral properties, should they exist, would not be the (...) sort of properties with which we enter into causal contact’ (p. 161). But it is also a world in which thought is conceived of as unified, in the sense that propositions of all kinds, whether about middle-sized dry goods, mathematical objects, or morals, are truth-apt and cognitive, so that they can intermingle in reasoning. What we have, then, is the following: no moral facts in any serious sense of that term, but ordinary moral truth nonetheless. This is an interesting, but difficult, position. What it requires is a decidedly original account of truth, which Lynch dubs the functionalist theory of truth, according to which truth is both one and many. (shrink)

We continue our work [5] on the logic of multisets (or on the multiset semantics of linear logic), by interpreting further the additive disjunction . To this purpose we employ a more general class of processes, called free, the axiomatization of which requires a new rule (not compatible with the full LL), the cancellation rule. Disjunctive multisets are modeled as finite sets of multisets. The -Horn fragment of linear logic, with the cut rule slightly restricted, is sound with respect to (...) this semantics. Another rule, which is a slight modification of cancellation, added to HF makes the system sound and complete. (shrink)

Given a classical theory T, a Kripke model K for the language L of T is called T-normal or locally PA just in case the classical L-structure attached to each node of K is a classical model of T. Van Dalen, Mulder, Krabbe, and Visser showed that Kripke models of Heyting Arithmetic (HA) over finite frames are locally PA, and that Kripke models of HA over frames ordered like the natural numbers contain infinitely many PA-nodes. We show that Kripke models (...) of the latter sort are in fact PA-normal. This result is extended to a somewhat larger class of frames. (shrink)

In the literature on supervaluationism, a central source of concern has been the acceptability, or otherwise, of its alleged logical revisionism. I attack the presupposition of this debate: arguing that when properly construed, there is no sense in which supervaluational consequence is revisionary. I provide new considerations supporting the claim that the supervaluational consequence should be characterized in a ‘global’ way. But pace Williamson 1994) and Keefe (2000), I argue that supervaluationism does not give rise to counterexamples to familiar inference-patterns (...) such as reductio and conditional proof. (shrink)

There is no consensus as to whether a Liar sentence is meaningful or not. Still, a widespread conviction with respect to Liar sentences (and other ungrounded sentences) is that, whether or not they are meaningful, they are useless. The philosophical contribution of this paper is to put this conviction into question. Using the framework of assertoric semantics, which is a semantic valuation method for languages of self-referential truth that has been developed by the author, we show that certain computational problems, (...) called query structures, can be solved more efficiently by an agent who has self-referential resources (amongst which are Liar sentences) than by an agent who has only classical resources; we establish the computational power of self-referential truth. The paper concludes with some thoughts on the implications of the established result for deflationary accounts of truth. (shrink)

New Waves in Truth offers eighteen new and original research papers on truth and other alethic phenomena by twenty of the most promising young scholars working on truth today. Contributions to the volume span truth ascriptions, deflationism, realism and the correspondence theory, the value of truth, and kinds of truth and truth-apt discourse. The research programs of the contributors are beginning to reset that agenda, and each is positioned to make new waves throughout the subject.