Online research in philosophy

We present a semantics for strong negation systems on the basis of the subformula property of the sequent calculus. The new models, called subformula models, are constructed as a special class of canonical Kripke models for providing the way from the cut-elimination theorem to model-theoretic results. This semantics is more intuitive than the standard Kripke semantics for strong negation systems.

What is the fundamental insight behind truth-functionality ? When is a logic interpretable by way of a truth-functional semantics? To address such questions in a satisfactory way, a formal definition of truth-functionality from the point of view of abstract logics is clearly called for. As a matter of fact, such a definition has been available at least since the 70s, though to this day it still remains not very widely well-known. A clear distinction can be drawn between logics characterizable through: (1) genuinely finite-valued truth-tabular semantics; (2) no finite-valued but only an infinite-valued truthtabular semantics; (3) no truth-tabular semantics at all. Any of those logics, however, can in principle be characterized through non-truth-functional valuation semantics, at least as soon as their associated consequence relations respect the usual tarskian postulates. So, paradoxical as that might seem at first, it turns out that truth-functional logics may be adequately characterized by non-truth-functional semantics . Now, what feature of a given logic would guarantee it to dwell in class (1) or in class (2), irrespective of its circumstantial semantic characterization?

In the following the details of a state-of-affairs semantics for positive free logic are worked out, based on the models of common inner domain–outer domain semantics. Lambert's PFL system is proven to be weakly adequate (i.e., sound and complete) with respect to that semantics by demonstrating that the concept of logical truth definable therein coincides with that one of common truth-value semantics for PFL. Furthermore, this state-of-affairs semantics resists the challenges stemming from the slingshot argument since logically equivalent statements do not always have the same extension according to it. Finally, it is argued that in such a semantics all statements of a certain language for PFL are state-of-affairs-related extensional as well as salva extensione extensional, even though their salva veritate extensionality fails.

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.

If models can be true, where is their truth located? Giere (Explaining science, University of Chicago Press, Chicago, 1998) has suggested an account of theoretical models on which models themselves are not truth-valued. The paper suggests modifying Giere’s account without going all the way to purely pragmatic conceptions of truth—while giving pragmatics a prominent role in modeling and truth-acquisition. The strategy of the paper is to ask: if I want to relocate truth inside models, how do I get it, what else do I need to accept and reject? In particular, what ideas about model and truth do I need? The case used as an illustration is the world’s first economic model, that of von Thünen (1826/1842) on agricultural land use in the highly idealized Isolated State.

Providing a possible worlds semantics for a logic involves choosing a class of possible worlds models, and setting up a truth definition connecting formulas of the logic with statements about these models. This scheme is so flexible that a danger arises: perhaps, any (reasonable) logic whatsoever can be modelled in this way. Thus, the enterprise would lose its essential tension. Fortunately, it may be shown that the so-called incompleteness-examples from modal logic resist possible worlds modelling, even in the above wider sense. More systematically, we investigate the interplay of truth definitions and model conditions, proving a preservation theorem characterizing those types of truth definition which generate the minimal modal logic.

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.

I define 'skim semantics' to be a Davidson-style truth-conditional semantics combined with a variety of deflationism about truth. The expressive role of truth in truth-conditional semantics precludes at least some kinds of skim semantics; thus I reject the idea that the challenge to skim semantics derives solely from Davidson's explanatory ambitions, and in particular from the 'truth doctrine', the view that the concept of truth plays a central explanatory role in Davidsonian theories of meaning for a language. The fate of skim semantics is not determined by the fate of the truth doctrine, so rejecting the truth doctrine does not in itself open the way to skim semantics. I establish my thesis by showing that some recently proposed versions of skim semantics fail because of truth's expressive role. I also discuss the conditions that might permit skim semantics.

As part of an approach to the liar paradox and the other paradoxes affecting truth, I have proposed replacing our concept of truth with two concepts: ascending truth and descending truth.1 I am not going to discuss why I think this is the best approach or how it solves the paradoxes; instead, I concentrate on the theory of ascending and descending truth. I formulate an axiomatic theory of ascending truth and descending truth (ADT) and provide a possible-worlds semantics for it (which I dub xeno semantics). Xeno semantics is a generalization of the familiar neighborhood semantics, which itself is a generalization of the standard relational semantics. Once the details of ADT have been presented, it is easy to show that neither relational semantics nor neighborhood semantics will work for it; thus, the move to a more general framework is required. The main result is a fixed point theorem that guarantees the existence of an acceptable first-order constant-domain xeno model. From this result it follows that ADT is sound with respect to the class of such models. The upshot is that ADT is consistent relative to the background set theory.

Truth-conditional semantics is the project of determining a way of assigning truth-conditions to sentences based on A) the extension of their constituents and B) their syntactic mode of composition. Truth-conditional semantics is the major research project of linguistic semantics and the project and its prospects are a central concern in contemporary philosophy of language.