Online research in philosophy

Standard attempts to defend Russell's Theory of Descriptions against the problem posed by incomplete descriptions, are discussed and dismissed as inadequate. It is then suggested that one such attempt, one which exploits the notion of a contextually delimited domain of quantification, may be applicable to incomplete quantifier expressions which are typically treated as quantificational: expressions of the form AllF's, NoF's, SomeF's, Exactly eightF's, etc. In this way, one is able to retain the plausible claim that such expressions ought to receive their usual quantificational analyses. The conclusion tentatively drawn is that perhaps definite descriptions arenot amenable to a (Russellian) quantificational analysis.

This paper addresses the phenomenon of incomplete preferences in disaster risk management. If an agent finds two options to be incomparable and thus has an incomplete preference ordering, i.e., neither prefers one option over the other nor finds them equally as good, it is not possible for the agent to perform a value tradeoff, necessary for an informed decision, between these two options. In this paper we suggest a way to model incomplete preference orderings by means of probabilistic preferences, and how to reveal an agent’s incomplete preference ordering within a behaviorist framework.

In this paper, we are going to analyze the phenomenon of modal incompleteness from an algebraic point of view. The usual method of showing that a given logic L is incomplete is to show that for some L and some cannot be separated from by a suitably wide class of complete algebras — usually Kripke algebras. We are going to show that classical examples of incomplete logics, e.g., Fine logic, are not complete with respect to any class of complete BAOs. Even above Grz it is possible to find a continuum of such logics, which immediately implies the existence of a continuum of neighbourhood-incomplete Grz logics. Similar results can be proved for Löb logics. In addition, completely incomplete logics above Grz may be found uniformly as a result of failures of some admissible rule of a special kind.

Within this paper we consider a model of Nash bargaining with incomplete information. In particular, we focus on fee games, which are a natural generalization of side payment games in the context of incomplete information. For a specific class of fee games we provide two axiomatic approaches in order to establish the Expected Contract Value, which is a version of the Nash bargaining solution.

Critics and champions alike have fussed and fretted for well over fifty years about whether Russell’s treatment is compatible with certain alleged acceptable uses of incomplete definite descriptions,[2] where a description (the F( is incomplete just in case more than one object satisfies its nominal F, as in (1).

A (normal) system of prepositional modal logic is said to be complete iff it is characterized by a class of (Kripke) frames. When we move to modal predicate logic the question of completeness can again be raised. It is not hard to prove that if a predicate modal logic is complete then it is characterized by the class of all frames for the propositional logic on which it is based. Nor is it hard to prove that if a propositional modal logic is incomplete then so is the predicate logic based on it. But the interesting question is whether a complete propositional modal logic can have an incomplete extension. In 1967 Kripke announced the incompleteness of a predicate extension of S4. The purpose of the present article is to present several such systems. In the first group it is the systemswith the Barcan Formula which are incomplete, while those without are complete. In the second group it is thosewithout the Barcan formula which are incomplete, while those with the Barcan Formula are complete. But all these are based on propositional systems which are characterized by frames satisfying in each case a single first-order sentence.

In program synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. When the system is open, then at each moment it reads input signals and writes output signals, which depend on the input signals and the history of the computation so far. The specification considers all possible input sequences. Thus, if the specification is linear, it should hold in every computation generated by the interaction, and if the specification is branching, it should hold in the tree that embodies all possible input sequences. Often, the system cannot read all the input signals generated by its environment. For example, in a distributed setting, it might be that each process can read input signals of only part of the underlying processes. Then, we should transform a specification into a system whose output depends only on the readable parts of the input signals and the history of the computation. This is called synthesis with incomplete information. In this work we solve the problem of synthesis with incomplete information in its full generality. We consider linear and branching settings with complete and incomplete information. We claim that alternation is a suitable and helpful mechanism for coping with incomplete information. Using alternating tree automata, we show that incomplete information does not make the synthesis problem more complex, in both the linear and the branching paradigm. In particular, we prove that independently of the presence of incomplete information, the synthesis problems for CTL and CTL * are complete for EXPTIME and 2EXPTIME, respectively.

Elizabeth Prior claims that dispositional predicates are incomplete in the sense that they have more than one argument place. To back up this claim, she offers a number of arguments that involve such ordinary dispositional predicates as ‘fragile’, ‘soluble’, and so on. In this paper, I will first demonstrate that one of Prior’s arguments that ‘is fragile’ is an incomplete predicate is mistaken. This, however, does not immediately mean that Prior is wrong that ‘fragile’ is an incomplete predicate. On the contrary, I maintain that she has offered another valid argument that does indeed establish the claim that ‘fragile’ is an incomplete predicate. I will argue further that Prior is right that ‘soluble’ is an incomplete predicate. Then does this mean that all dispositional predicates are incomplete? I don’t think so. I will suggest that there are complete dispositional predicates that have no more than one argument place. Finally, by relying on my discussion of the incompleteness of dispositional predicates, I will attempt to provide a better understanding of the context-dependence and intrinsic nature of dispositional ascriptions.

This paper presents a precise semantics for incomplete predicates such as “ready”. Incomplete predicates have distinctive logical properties that a semantic theory needs to accommodate. For instance, “Tipper is ready” logically implies “Tipper is ready for something”, but “Tipper is ready for something” does not imply “Tipper is ready”. It is shown that several approaches to the semantics of incomplete predicates fail to accommodate these logical properties. The account offered here defines contexts as structures containing an element called a proposition set, which contains atomic propositions and negations of atomic propositions. The condition under which “Tipper is ready” is true in a context is defined in terms of the contents of the proposition set for the context. On this account, the content of the context pertinent to a conversation must be determined not by what speakers have in mind but by relations of objective relevance.

Examples of Neutrosophy used in Arabic philosophy:- While Avicenna promotes the idea that the world is contingent if it is necessitated by its causes, Averroes ...