In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one usually deals with two types of infinity: infinity of beliefs on every level of reflection and infinity of levels. In this work we assume that beliefs are finite at every level, while the number of levels may still be ...

Scientific methods may be viewed as procedures for converging to the true answer to a given empirical question. Typically, such methods converge to the truth only if certain empirical presuppositions are satisfied, which raises the question whether the presuppositions are satisfied. Another scientific method can be applied to this empirical question, and so forth, occasioning an empirical regre...

We look at the problem of adverarial decision making. Our objectivel here is to try to replace the infinite regress inherent in adversarial making decisions problems with the use of knowledge about the adversary. We use granular computing and particularly the Dempster-Shafer belief structure to represent this knowledge. This allows us to turn the problem of adverarial decision making into a pro...

Dan Zahavi has argued persuasively that some versions of selfrepresentationalism are implausible on phenomenological and dialectical grounds: they fail to make sense of primitive self-knowledge and lead to an infinite regress. Zahavi proposes an alternative view of ubiquitous prereflective self-consciousness—the phenomenological datum upon which Zahavi and self-representationalists agree—accord...

Hannes Leitgeb formulated eight norms for theories of truth in his paper [12]: ‘What Theories of Truth Should be Like (but Cannot be)’. We shall show in the present paper that a theory of truth can be formulated for suitably constructed metalanguages of the first-order language L = {∈} of set theory which conforms with those norms, added by the norm: Metalanguages for which mathematical theorie...

In this paper, we propose to reinterpret the problem of generating referring expressions (GRE) as the problem of computing a formula in a description logic that is only satisfied by the referent. This view offers a new unifying perspective under which existing GRE algorithms can be compared. We also show that by applying existing algorithms for computing simulation classes in description logic,...

We have earlier shown by construction that a proposition can have a well-defined 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 cou...

Metabolism is usually treated as a set of chemical reactions catalysed by separate enzymes. However, various complications, such as transport of molecules across membranes, physical association of different enzymes, giving the possibility of metabolite channelling, need to be taken into account. More generally, a proper understanding of the nature of life will require metabolism to be treated a...