Online research in philosophy

In this article, a qualitative notion of subjective plausibility and its revision based on a preorder relation are implemented in higher-order logic. This notion of plausibility is used for modeling pragmatic aspects of communication on top of traditional two-dimensional semantic representations.

We consider various concepts associated with the revision theory of truth of Gupta and Belnap. We categorize the notions definable using their theory of circular definitions as those notions universally definable over the next stable set. We give a simplified (in terms of definitional complexity) account of varied revision sequences-as a generalised algorithmic theory of truth. This enables something of a unification with the Kripkean theory of truth using supervaluation schemes.

In a previous paper I described a range of nonmonotonic conditionals that behave like conditional probability functions at various levels of probabilistic support. These conditionals were defined as semantic relations on an object language for sentential logic. In this paper I extend the most prominent family of these conditionals to a language for predicate logic. My approach to quantifiers is closely related to Hartry Field''s probabilistic semantics. Along the way I will show how Field''s semantics differs from a substitutional interpretation of quantifiers in crucial ways, and show that Field''s approach is closely related to the usual objectual semantics. One of Field''s quantifier rules, however, must be significantly modified to be adapted to nonmonotonic conditional semantics. And this modification suggests, in turn, an alternative quantifier rule for probabilistic semantics.

In this book, Yaqub describes a simple conception of truth and shows that it yields a semantical theory that accommodates the whole range of our seemingly conflicting intuitions about truth. This conception takes the Tarskian biconditionals (such as "The sentence 'Johannes loved Clara' is true if and only if Johannes loved Clara") as correctly and completely defining the notion of truth. The semantical theory, which is called the revision theory, that emerges from this conception paints a metaphysical picture of truth as a property whose applicability is given by a revision process rather than by a fixed extension. The main advantage of this revision process is its ability to explain why truth seems in many cases almost redundant, in others substantial, and yet in others paradoxical (as in the famous Liar). Yaub offers a comprehensive defense of the revision theory of truth by developing consistent and adequate formal semantics for languages in which all sorts of problematic sentences (Liar and company) can be constructed. Yaqub concludes by introducing a logic of truth that further demonstrates the adequacy of the revision theory.

In this paper, a semantics for predicate logics without the contraction rule will be investigated and the completeness theorem will be proved. Moreover, it will be found out that our semantics has a close connection with Beth-type semantics.

Many different modes of definition have been proposed over time, but none of them allows for circular definitions, since, according to the prevalent view, the term defined would then be lacking a precise signification. I argue that although circular definitions may at times fail uniquely to pick out a concept or an object, sense still can be made of them by using a rule of revision in the style adopted by Anil Gupta and Nuel Belnap in the theory of truth.

The properties of belief revision operators are known to have an informal semantics which relates them to the axioms of conditional logic. The purpose of this paper is to make this connection precise via the model theory of conditional logic. A semantics for conditional logic is presented, which is expressed in terms of algebraic models constructed ultimately out of revision operators. In addition, it is shown that each algebraic model determines both a revision operator and a logic, that are related by virtue of the stable Ramsey test.

Gupta’s Rule of Revision theory of truth builds on insights to be found in Martin and Woodruff (1975) and Kripke (1975) (who in turn build on Tarski) in order to permanently deepen our understanding of truth, of paradox (and of the absence of it), and of how we work our language while our language is working us. His concept of a predicate deriving its meaning by way of a Rule of Revision ought to impact significantly on the philosophy of language. Still, fortunately, he has left me something to..