Konolige''s technical notion of belief based on deduction structures is briefly reviewed and its usefulness for the design of artificial agents with limited representational and deductive capacities is pointed out. The design of artificial agents with more sophisticated representational and deductive capacities is then taken into account. Extended representational capacities require in the first place a solution to the intensional context problems. As an alternative to Konolige''s modal first-order language, an approach based on type-free property theory is proposed. It considers (...) often neglected issues, such as the need for a more general account of thede dicto-de re distinction, and quasi-indicators. Extended deductive capacities require a subdivision of Konolige''s notion of belief into two distinct technical notions,potential anddispositional belief. The former has to do with what an artificial agent could in principle come to actively believe, given enough time and its specific logical competence; the latter with what an agent can be assumed to believe with respect to a specific goal to be fulfilled. (shrink)

This article compares the theory of Meinongian objects proposed by Edward Zalta with a theory of fiction formulated within an early Russellian framework. The Russellian framework is the second-order intensional logic proposed by Nino B. Cocchiarelly as a reconstruction of the form of Logicism Russell was examining shortly after writing The Principles of Mathematics. A Russellian theory of denoting concepts is developed in this intensional logic and applied as a theory of the "objects' of fiction. The framework retains the Orthodox (...) early Russellian ontology of existents, possible non-existents, and properties and relations in intension. This avoids the assumption, found in Meinongian theories, of impossible and incomplete objects. It also obviates the need to preserve consistency by distinguishing a new "mode of predication", or a "distinction in kinds of predicates". Thus, it is argued that an early Russellian theory forms a powerful rival to a Meinongian theory of objects. (shrink)

In this paper we show that the Gupta-Belnap systems S# and S* are П12. Since Kremer has independently established that they are П12-hard, this completely settles the problem of their complexity. The above-mentioned upper bound is established through a reduction to countable revision sequences that is inspired by, and makes use of a construction of McGee.

It is shown that two formally consistent type-free second-order systems, due to Cocchiarella, and based on the notion of homogeneous stratification, are subject to a contingent version of Russell's paradox.

The Revision Theory of Truth has been challenged in A. M. Yaqūb's recent book The Liar Speaks the Truth. Yaqūb suggests some non-trivial changes in the original theory - changing the limit rule - to avoid certain artifacts. In this paper it is shown that the proposed changes are not sufficient, i.e., Yaqūb's system also produces artifacts. An alternative solution is proposed and the relation between it and Yaqūb's solution is explored.

Gupta’s Rule of Revision theory of truth builds on insights to be found in Martin and Woodruff and Kripke in order to permanently deepen our understanding of truth, of paradox, 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.

This study provides a unified theory of properties, relations, and propositions (PRPs). Two conceptions of PRPs have emerged in the history of philosophy. The author explores both of these traditional conceptions and shows how they can be captured by a single theory.