This paper examines different kinds of definite descriptions denoting purely contingent, necessary or impossible objects. The discourse about contingent/impossible/necessary objects can be organised in terms of rational questions to ask and answer relative to the modal profile of the entity in question. There are also limits on what it is rational to know about entities with this or that modal profile. We will also examine epistemic modalities; they are the kind of necessity and possibility that is determined by _epistemic_ constraints (...) related to knowledge or rationality. Definite descriptions denote so-called _offices_, roles, or _things to be._ We explicate these α-offices as partial functions from possible worlds to chronologies of objects of type α, where α is mostly the type of individuals. Our starting point is Prior’s distinction between a ‘weak’ and ‘strong’ definite article ‘the’. In both cases, the definite description refers to at most one object; yet, in the case of the weak ‘the’, the referred object can change over time, while in the case of the strong ‘the’, the object referred to by the definite description is the same forever, once the office has been occupied. The main result we present is the way how to obtain a Wh-knowledge about who or what plays a given role presented by a hyper-office, i.e. _procedure_ producing an office. Another no less important result concerns the epistemic necessity of the impossibility of knowing who or what occupies the impossible office presented by a hyper-office. (shrink)

The standard rule of single privative modification replaces privative modifiers by Boolean negation. This rule is valid, for sure, but also simplistic. If an individual a instantiates the privatively modified property (MF) then it is true that a instantiates the property of not being an F, but the rule fails to express the fact that the properties (MF) and F have something in common. We replace Boolean negation by property negation, enabling us to operate on contrary rather than contradictory properties. (...) To this end, we apply our theory of intensional essentialism, which operates on properties (intensions) rather than their extensions. We argue that each property F is necessarily associated with an essence, which is the set of the so-called requisites of F that jointly define F. Privation deprives F of some but not all of its requisites, replacing them by their contradictories. We show that properties formed from iterated privatives, such as being an imaginary fake banknote, give rise to a trifurcation of cases between returning to the original root property or to a property contrary to it or being semantically undecidable for want of further information. In order to determine which of the three forks the bearers of particular instances of multiply modified properties land upon we must examine the requisites, both of unmodified and modified properties. Requisites underpin our presuppositional theory of positive predication. Whereas privation is about being deprived of certain properties, the assignment of requisites to properties makes positive predication possible, which is the predication of properties the bearers must have because they have a certain property formed by means of privation. (shrink)

There are many kinds of negation and denial. Perhaps the most common is the Boolean negation not that applies to propositions-in-extension, i.e. truth-values. The others are, inter alia, the property of propositions of not being true which applies to propositions; the complement function which applies to sets; privation which applies to properties; negation as failure applied in logic programming; negation as argumentation ad absurdum, and many others. The goal of this paper is neither to provide a complete list, nor to (...) analyse all of them. Rather, I am going to deal with negation of propositions that come attached with a presupposition that is entailed by the positive as well as negated form of a given proposition. However, there are two kinds of negation, namely internal and external negation. I am going to prove that while the former is presupposition-preserving, the latter is presupposition-denying. This issue has much in common with the difference between topic and focus articulation within a sentence. Whereas articulating the topic of a sentence activates a presupposition, articulating the focus frequently yields merely an entailment. The main contribution of this paper is the proof that the two kinds of negation are not equivalent. While the Russellian wide-scope (external) negation gets the truthconditions of a sentence right for a subject occurring as a focus, Strawsonian narrow-scope (internal) negation is validly applicable for a subject occurring as the topic. I also deal with other kinds of presupposition triggers, in particular factive attitudes and prerequisites of a given property. My background theory is Transparent Intensional Logic (TIL). TIL is an expressive logic apt for the analysis of sentences with presuppositions, because in TIL we work with partial functions, in particular with propositions with truth-value gaps. Moreover, the procedural semantics of TIL make it possible to uncover the hidden semantic features of sentences, make them explicit and logically tractable. (shrink)

The behaviour of a multi-agent system is driven by messaging. Usually, there is no central dispatcher and each autonomous agent, though resource-bounded, can make less or more rational decisions to meet its own and collective goals. To this end, however, agents must communicate with their fellow agents and account for the signals from their environment. Moreover, in the dynamic, permanently changing world, agents’ behaviour, i.e. their activities, must also be dynamic. By communicating with other fellow agents and with their environment, (...) agents should be able to learn new concepts and enrich their knowledge base. Processes and events that happened in the past may be irrelevant in the present or have a significant impact in the future, and vice versa. Therefore, the fine-grained analysis of agents’ activities as well as events within or beyond the system is very important so that the system can run smoothly without falling into inconsistencies. Moreover, as the system should communicate with its environment, the analysis should be as close to natural language as possible. The goal of this paper is a proposal for such an analysis. To this end, I apply Transparent Intensional Logic (TIL) because TIL is particularly apt for a fine-grained analysis of processes and events specified in the present, past or future tense with reference to the time when they happened, happen or will happen. (shrink)

Tichý’s Transparent Intensional Logic (TIL) is an overarching logical framework apt for the analysis of all sorts of discourse, whether colloquial, scientific, mathematical or logical. The theory is a procedural (as opposed to denotational) one, according to which the meaning of an expression is an abstract, extra-linguistic procedure detailing what operations to apply to what procedural constituents to arrive at the product (if any) of the procedure that is the object denoted by the expression. Such procedures are rigorously defined as (...) TIL constructions. Though TIL analytical potential is very large, deduction in TIL has been rather neglected. Tichý defined a sequent calculus for pre-1988 TIL, that is TIL based on the simple theory of types. Since then no other attempt to define a proof calculus for TIL has been presented. The goal of this paper is to propose a generalization and adjustment of Tichý’s calculus to TIL 2010. First, I briefly recapitulate the rules of simple-typed calculus as presented by Tichý. Then, I propose the adjustments of the calculus so that it be applicable to hyperintensions within the ramified hierarchy of types. TIL operates with a single procedural semantics for all kinds of logical-semantic context, be it extensional, intensional or hyperintensional. I show that operating in a hyperintensional context is far from being technically trivial. Yet, it is feasible. To this end, we introduce a substitution method that operates on hyperintensions. It makes use of a four-place substitution function (called Sub) defined over hyperintensions. (shrink)