The standard argument against ordered tuples as propositions is that it is arbitrary what truth-conditions they should have. In this paper we generalize that argument. Firstly, we require that propositions have truth-conditions intrinsically. Secondly, we require strongly equivalent truth-conditions to be identical. Thirdly, we provide a formal framework, taken from Graph Theory, to characterize structure and structured objects in general. The argument in a nutshell is this: structured objects are too fine-grained to be identical to truth-conditions. Without identity, there is (...) no privileged mapping from structured objects to truth-conditions, and hence structured objects do not have truth-conditions intrinsically. Therefore, propositions are not structured objects. (shrink)

The author defends the view that the notion of concept, if used in the logical tradition, should be explicated procedurally . He argues that Tichý’s Transparent Intensional Logic is an apt tool for such an explication and derives the respective definition. Some consequences of this definition concern the notions of emptiness, simple concepts, empirical concepts and algorithmic concepts.

The purpose of this paper can be described as follows. The contemporary philosophical logic cannot work without using some terms well-known from mathematics and logic. Among such terms that play an important role in logical and philosophical analyses of language, meaning and the like we can find function, procedure and construction. One problem is that various authors use these terms in various ways, another problem consists in the well-known fact that many philosophers do not have any idea of what those (...) and similar terms could mean. The present paper tries to explain why an exact explication of the three mentioned terms can contribute to understanding and even solving many problems with semantics of natural language, which a philosopher should be interested in. (shrink)

The classical theory of semantic information (ESI), as formulated by Bar-Hillel and Carnap in 1952, does not give a satisfactory account of the problem of what information, if any, analytically and/or logically true sentences have to offer. According to ESI, analytically true sentences lack informational content, and any two analytically equivalent sentences convey the same piece of information. This problem is connected with Cohen and Nagel's paradox of inference: Since the conclusion of a valid argument is contained in the premises, (...) it fails to provide any novel information. Again, ESI does not give a satisfactory account of the paradox. In this paper I propose a solution based on the distinction between empirical information and analytic information. Declarative sentences are informative due to their meanings. I construe meanings as structured hyperintensions, modelled in Transparent Intensional Logic as so-called constructions. These are abstract, algorithmically structured procedures whose constituents are sub-procedures. My main thesis is that constructions are the vehicles of information. Hence, although analytically true sentences provide no empirical information about the state of the world, they convey analytic information, in the shape of constructions prescribing how to arrive at the truths in question. Moreover, even though analytically equivalent sentences have equal empirical content, their analytic content may be different. Finally, though the empirical content of the conclusion of a valid argument is contained in the premises, its analytic content may be different from the analytic content of the premises and thus convey a new piece of information. (shrink)

The purpose of this article is to provide a non‐contradictory interpretation of sentences such as “Smith's murderer might not have murdered Smith”. An anti‐actualist, two‐dimensional framework including partial functions provides the basis for my solution. I argue for two claims. The modal profile of the proposition expressed by “The F might not have been an F” is complex: at any world where there is a unique F the proposition is true; at any world without a unique F the proposition has (...) no truth‐value; hence, at no world is it false. It remains an open semantic and epistemological question which of the first two kinds of world the actual world is. The semantic method should be based on explicit intensionalization in lieu of actualism. Actualism accords a privileged role to the actual world. Explicit intensionalization places all possible worlds, including the actual one, on an equal footing. Syntactically, a lambda‐bound world variable replaces the actual‐world constant or operator, while the other world variable is existentially bound. (shrink)

The book is about logical analysis of natural language. Since we humans communicate by means of natural language, we need a tool that helps us to understand in a precise manner how the logical and formal mechanisms of natural language work. Moreover, in the age of computers, we need to communicate both with and through computers as well. Transparent Intensional Logic is a tool that is helpful in making our communication and reasoning smooth and precise. It deals with all kinds (...) of linguistic context in a fully compositional and anti-contextual way. (shrink)

The terms denotation and reference are commonly used as synonyms. A more fine-grained analysis of natural language as offered by TIL shows that we can distinguish these terms in the case of empirical expressions. The latter are shown to denote non-trivial intensions while their reference is the value of these intensions in the actual world.

Logical semantics includes once again structured meanings in its repertoire. The leading idea is that semantic and syntactic structure are more or less isomorphic. A key motive for reintroducing sensitivity to semantic structure is to obtain fine‐grained meanings, which are individuated more finely than in possible‐world semantics, namely up to necessary equivalence. Just getting the truth‐conditions right is deemed insufficient for a full semantic analysis of sentences. This paper surveys some of the most recent contributions to the program of structured (...) meaning, while providing historical background. I suggest that to make substantial advances the program needs to solve the problem of propositional unity and develop an intensional mereology of abstract objects. (shrink)

In this essay I give a complete join semi-lattice of possible display-equivalence schemes for Display Logic, using the standard connectives, and leaving fixed only the schemes governing the star. In addition to proving the completeness of this list, I offer a discussion of the basic properties of these schemes.

In the paper we offer a logical explication of the frequently used, but rather vague, notion of point of view. We show that the concept of point of view prevents certain paradoxes from arising. A point of view is a means of partial characterisation of something. Thus nothing is a P and at the same time a non-P, because it is a P only relative to some point of view and a non-P from another point of view. But there is (...) a major, complicating factor involved in applying a logical method that is supposed to provide a formal and rigorous counterpart of the intuitively understood notion: ‘point of view’ is a homony-mous expression, and so there is not just one meaning that would explain points of view. Yet we propose a common scheme of the logical type of the entities denoted by the term ‘point of view’. It is an empirical function: when applied to the viewed object in question, it results in a evaluating proposition about the object. If there is an agent applying the criterion, the result is the agent’s attitude to the respective object. The paper is organised into two parts. In Part I we first adduce and analyse various examples of typical cases of applying a point of view to prevent paradox. These cases are examined according to the type of the viewed object: a) the viewed object is an individual and b) the viewed object is a property or an office. In Part II we then show that the method described in Part I can be applied also to the analyses of agents’ attitudes. We thus explain how an agent can believe of something that it is a P and at the same time a non-P: the agent applies different viewpoint criteria to the viewed object. The inversion of perspective consisting in the perspective shifting from the believer on to the reporter in the case of attitudes de re, and from the reporter to the believer in the case of attitudes de dicto, is also analyzed. We show that there is no smooth logical traffic back and forth between such attitudes and prove that they are not equivalent. By way of conclusion, we explicate the notion of conceptual point of view and analyze cases of viewpoints given by conceptual distinction. We show, finally, that the proposed scheme of the type of point of view can be preserved, this time, however, in its extensional version. (shrink)

To talk about simple concepts presupposes that the notion of concept has been aptly explicated. I argue that a most adequate explication should abandon the set-theoretical paradigm and use a procedural approach. Such a procedural approach is offered by Tichý´s Transparent Intensional Logic (TIL). Some main notions and principles of TIL are briefly presented, and as a result, concepts are explicated as a kind of abstract procedure. Then it can be shown that simplicity, as applied to concepts, is well definable (...) as a property relative to conceptual systems, each of which is determined by a finite set of simple (‘primitive’) concepts. Refinement as a method of replacing simple concepts by compound concepts is defined. (shrink)

If concepts are explicated as abstract procedures, then we can easily show that each empirical concept is a not an effective procedure. Some, but not all empirical concepts are shown to be of a special kind: they cannot in principle guarantee that the object they identify satisfies the intended conditions.

Problems are defined as abstract procedures. An explication of procedures as used in Transparent Intensional Logic and called constructions is presented and the subclass of constructions called concepts is defined. Concepts as closed constructions modulo α- and η-conversion can be associated with meaningful expressions of a natural or professional language in harmony with Church’s conception. Thus every meaningful expression expresses a concept. Since every problem can be unambiguously determined by a concept we can state that every problem is a concept (...) and every concept can be viewed as a problem.Kolmogorov’s idea of a connection between problems and Heyting’s calculus is examined and the non-classical features of the latter are shown to be compatible with realistic logic using partial functions. (shrink)