Aim of the paper is to present a new logic of technical malfunction. The need for this logic is motivated by a simple-sounding philosophical question: Is a malfunctioning corkscrew, which fails to uncork bottles, nonetheless a corkscrew? Or in general terms, is a malfunctioning F, which fails to do what Fs do, nonetheless an F? We argue that ‘malfunctioning’ denotes the modifier Malfunctioning rather than a property, and that the answer depends on whether Malfunctioning is subsective or privative. If subsective, (...) a malfunctioning F is an F; if privative, a malfunctioning F is not an F. An intensional logic is required to raise and answer the question, because modifiers operate directly on properties and not on sets or individuals. This new logic provides the formal tools to reason about technical malfunction by means of a logical analysis of the sentence “a is a malfunctioning F”. (shrink)

Buzaglo (as well as Manders (J Philos LXXXVI(10):553–562, 1989)) shows the way in which it is rational even for a realist to consider ‘development of concepts’, and documents the theory by numerous examples from the area of mathematics. A natural question arises: in which way can the phenomenon of expanding mathematical concepts influence empirical concepts? But at the same time a more general question can be formulated: in which way do the mathematical concepts influence empirical concepts? What I want to (...) show in the present paper can be described as follows. The problem articulated by Buzaglo deserves some semantic refinements. Following explications are needed: What is meaning? (In particular: What are concepts?) What are questions? (Or, equivalently: Semantics of interrogative sentences.) -/- Further, a useful notion will be the notion of problem. Taking over the notion of conceptual system from Materna (Conceptual Systems. Logos, Berlin, 2004) and using Tichý’s Transparent intensional logic (TIL) I can try to solve the problem of the relation between mathematical and empirical concepts (not only for the case of expanding some mathematical concepts). (shrink)

The paper deals with the semantics of mathematical notation. In arithmetic, for example, the syntactic shape of a formula represents a particular way of specifying, arriving at, or constructing an arithmetical object (that is, a number, a function, or a truth value). A general definition of this sense of "construction" is proposed and compared with related notions, in particular with Frege's concept of "function" and Carnap's concept of "intensional isomorphism." It is argued that constructions constitute the proper subject matter of (...) both logic and mathematics, and that a coherent semantic account of mathematical formulas cannot be given without assuming that they serve as names of constructions. (shrink)

It is well known that the manner in which a definitely descriptive term contributes to the meaning of a sentence depends on the place the term occupies in the sentence. A distinction is accordingly drawn between ordinary contexts and contexts variously termed non-referential, intensional, oblique, or opaque. The aim of the present article is to offer a general account of the phenomenon, based on transparent intensional logic. It turns out that on this approach there is no need to say (as (...) Frege does) that descriptive terms are referentially ambiguous or to deny (as Russell does) that descriptive terms represent self-contained units of meaning. There is also no need to tolerate (as Montague does) exceptions to the Principle of Functionality. The notion of an ordinary (i.e., non-intensional) context is explicated exclusively in terms of logical structure and it is argued that two aspects of ordinariness (termed hospitality and exposure) must be distinguished. (shrink)

The paper shows how ideas that explain the sense of an expression as a method or algorithm for finding its reference, preshadowed in Frege’s dictum that sense is the way in which a referent is given, can be formalized on the basis of the ideas in Thomason (1980). To this end, the function that sends propositions to truth values or sets of possible worlds in Thomason (1980) must be replaced by a relation and the meaning postulates governing the behaviour of (...) this relation must be given in the form of a logic program. The resulting system does not only throw light on the properties of sense and their relation to computation, but also shows circular behaviour if some ingredients of the Liar Paradox are added. The connection is natural, as algorithms can be inherently circular and the Liar is explained as expressing one of those. Many ideas in the present paper are closely related to those in Moschovakis (1994), but receive a considerably lighter formalization. (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 paper develops a proof-theoretic semantics for belief reports by extending the constructive type-theoretical formalism presented in Więckowski with a specific kind of set-forming operator suited for the representation of belief attitudes. The extended formalism allows us to interpret constructions which involve, e.g., iteration of belief, quantifying into belief contexts, and anaphora in belief reports. Moreover, constructive solutions to canonical instances of the problem of hyperintensionality are suggested. The paper includes a discussion of Ranta’s constructive account of belief reports.

It is shown that: classicality is connected with various criteria some of which are fulfilled by TIL while some other are not; some more general characteristic of classicality connects it with philosophical realism whereas anti-realism is connected with non-classical logics; TIL is highly expressive due to its hyperintensionality, which makes it possible to handle procedures as objects sui generis. Thus TIL is classical in obeying principles of realism and non-classical in transcending some principles taught by textbooks of classical logic.

It is sometimes objected that Tichý’s logic is not a logic because it underestimates deduction, providing only logical analyses of expressions. I argue that this opinion is wrong. First of all, to detect valid arguments, which are formulated in a language, there needs to be logical analysis to ascertain which semantical entities are involved. Entailment is defined as an extralinguistic affair relating those constructions. The validity of an argument, composed of propositional constructions, stems from the properties of the constructions. Such (...) properties are displayed by the derivation rules of Tichý’s system of deduction. (shrink)

The goal of this paper is a philosophical explication and logical rectification of the notion of concept. We take into account only those contexts that are relevant from the logical point of view. It means that we are not interested in contexts characteristic of cognitive sciences, particularly of psychology, where concepts are conceived of as some kind of mental objects or representations. After a brief recapitulation of various theories of concept, in particular Frege’s and Church’s ones, we propose our own (...) theory based on procedural semantics of Transparent Intensional Logic (TIL) and explicate concept in terms of the key notion of TIL, namely construction viewed as an abstract, algorithmically structured procedure. (shrink)

Mathematics is about proofs, that is the derivation of correct statements; and calculations, that is the production of results according to well-defined sets of rules. The two notions are intimately related. Proofs can involve calculations, and the algorithm underlying a calculation should be proved correct. The aim of the author is to explore this relationship. The book itself forms an introduction to simple type theory. Starting from the familiar propositional calculus the author develops the central idea of an applied lambda-calculus. (...) This is illustrated by an account of Gödel's T, a system which codifies number-theoretic function hierarchies. Each of the book's 52 sections ends with a set of exercises, some 200 in total. These are designed to help the reader get to grips with the subject, and develop a further understanding. An appendix contains complete solutions of these exercises. (shrink)

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)