This article provides a comprehensive conceptual analysis of information. It begins with a folk notion that information is a tripartite phenomenon: information is something carried by signals about something for some use. This suggests that information has three main aspects: structural, referential, and normative. I analyze the individually necessary and jointly sufficient conditions for defining these aspects of information and consider formal theories relating to each aspect as well. The analysis reveals that structural, referential, and normative aspects of information are (...) hierarchically nested and that the normative depends on the referential, which in turn depends on the structural. (shrink)

This paper presents several important results for Transparent Intensional Logic (TIL). The conversions that are standardly taken to be valid – namely restricted β-conversion by name and β-reduction by value – are shown to be invalid. The core principle on which their validity is based – the so-called Compensation Principle – is also shown to be invalid. Further, the paper demonstrates the flaws of the proof of the Compensation Principle.

I present an analysis according to which the current state of the definition of substitution leads to a contradiction in the system of Transparent Intensional Logic. I entail the contradiction using only the basic definitions of TIL and standard results. I then analyse the roots of the contradiction and motivate the path I take in resolving the contradiction. I provide a new amended definition of collision-less substitution which blocks the contradiction in a non-ad hoc way. I elaborate on the consequences (...) of the amended definition, namely the invalidity of the Church-Rosser theorem. I present a counterexample to the validity of the theorem in TIL with an amended definition of substitution. (shrink)

This paper deals with two issues. First, it identifies structured propositions with logical procedures. Second, it considers various rigorous definitions of the granularity of procedures, hence also of structured propositions, and comes out in favour of one of them. As for the first point, structured propositions are explicated as algorithmically structured procedures. I show that these procedures are structured wholes that are assigned to expressions as their meanings, and their constituents are sub-procedures occurring in executed mode. Moreover, procedures are not (...) mere aggregates of their parts; rather, procedural constituents mutually interact. As for the second point, there is no universal criterion of the structural isomorphism of meanings, hence of co-hyperintensionality, hence of synonymy for every kind of language. The positive result I present is an ordered set of rigorously defined criteria of fine-grained individuation in terms of the structure of procedures. Hence procedural semantics provides a solution to the problem of the granularity of co-hyperintensionality. (shrink)

The paper examines two possible analyses of fictional names within Pavel Tichý’s Transparent Intensional Logic. The first of them is the analysis actually proposed by Tichý in his (1988) book The Foundations of Frege’s Logic. He analysed fictional names in terms of free variables. I will introduce, explain, and assess this analysis. Subsequently, I will explain Tichý’s notion of individual role (office, thing-to-be). On the basis of this notion, I will outline and defend the second analysis of fictional names. This (...) analysis is close to the approach known in the literature as role realism (the most prominent advocates of this position are Nicholas Wolterstorff, Gregory Currie, and Peter Lamarque). (shrink)

Tarski characterized logical notions as invariant under permutations of the domain. The outcome, according to Tarski, is that our logic, which is commonly said to be a logic of extension rather than intension, is not even a logic of extension—it is a logic of cardinality. In this paper, I make this idea precise. We look at a scale inspired by Ruth Barcan Marcus of various levels of meaning: extensions, intensions and hyperintensions. On this scale, the lower the level of meaning, (...) the more coarse-grained and less “intensional” it is. I propose to extend this scale to accommodate a level of meaning appropriate for logic. Thus, below the level of extension, we will have a more coarse-grained level of form. I employ a semantic conception of form, adopted from Sher, where forms are features of things “in the world”. Each expression in the language embodies a form, and by the definition we give, forms will be invariant under permutations and thus Tarskian logical notions. I then define the logical terms of a language as those terms whose extension can be determined by their form. Logicality will be shown to be a lower level analogue of rigidity. Using Barcan Marcus’s principles of explicit and implicit extensionality, we are able to characterize purely logical languages as “sub-extensional”, namely, as concerned only with form, and we thus obtain a wider perspective on both logicality and extensionality. (shrink)

In this paper, I investigate type theories from several perspectives. First, I present and elaborate the philosophical and technical motivations for these theories. I then offer a formal analysis of various TTs, focusing on the cardinality of the set of types contained in each. I argue that these TTs can be divided into four formal categories, which are derived from the cardinality of the set of their basic elementary types and the finiteness of the lengths of their molecular types. The (...) paper provides proofs of the cardinality of the universe of types for each of the specified theories. (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)

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)

Accounting for the epistemic contribution of deduction has been a pervasive problem for logicians interested in deduction, such as, among others, Jakko Hintikka. The problem arises because the conclusion validly deduced from a set of premises is said to be “contained” in that set; because of this containment relation, the conclusion would be known from the moment the premises are known. Assuming this, it is problematic to explain how we can gain knowledge by deducing a logical consequence implied by a (...) set of known premises. To address this problem, we offer an alternative account of the epistemic contribution of deduction as the process required to deduce a conclusion or a theorem, understanding such a process not only in terms of the number of steps in the derivation but also, more importantly, in terms of the reason for or justification for every step. That is, we do not know a proposition unless we have a justification or proof of that proposition. With this goal in mind, we develop a justification logic system which exhibits the epistemic contribution of a deductive derivation as the resulting justified formula. (shrink)

Proposition 5.122 of Wittgenstein’s Tractatus has been the source of much puzzlement among interpreters, so much so that no fully satisfactory account is yet available. This is unfortunate, if only because the containment account of logical consequence has a venerable tradition behind it. Pasquale Frascolla’s interpretation of proposition 5.122 is based on a valid argument and one true premise. However, the argument explains sense containment only in an indirect way, leaving some crucial questions unanswered. Besides, Frascolla does not address the (...) issue of how to make sense containment notationally perspicuous, an essential theme in Wittgenstein’s reflections. In this paper, we elaborate on Frascolla’s account by looking at the issue through the Tractarian notion of logical space. Our analysis shows that, for containment to be fully appreciated, one should adopt a negative perspective on the notion of sense, in line with the exclusionary theory of conceptual content, as labelled by Ian Rumfitt. Besides this, we introduce and discuss two methods—one envisaged by Wittgenstein himself—for making sense containment notationally perspicuous. (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)

We demonstrate how to validly quantify into hyperintensional contexts involving non-propositional attitudes like seeking, solving, calculating, worshipping, and wanting to become. We describe and apply a typed extensional logic of hyperintensions that preserves compositionality of meaning, referential transparency and substitutivity of identicals also in hyperintensional attitude contexts. We specify and prove rules for quantifying into hyperintensional contexts. These rules presuppose a rigorous method for substituting variables into hyperintensional contexts, and the method will be described. We prove the following. First, it (...) is always valid to quantify into hyperintensional attitude contexts and over hyperintensional entities. Second, factive empirical attitudes validate, furthermore, quantifying over intensions and extensions, and so do non-factive attitudes, both empirical and non-empirical , provided the entity to be quantified over exists. We focus mainly on mathematical attitudes, because they are uncontroversially hyperintensional. (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)

(1) If a deductive argument is valid, then the conclusion is not novel. (2) If the conclusion of an argument is not novel, the argument is not useful. So, (3) if a deductive argument is valid, it is not useful. This conclusion, (3), is unacceptable. Since the argument is valid, we must reject at least one premise. So, should we reject (1) or (2)? This puzzle is usually known as the ‘scandal of deduction’. Analytic philosophers have tried to reject (1) (...) but have assumed premise (2). I argue here that Aristotle would deny (2). Aristotle thinks that at least some deductive arguments are useful, even though they present no new conclusions. Thus, Aristotle’s view contrasts with analytic philosophers of logic, who assume that all useful deductive arguments present novel conclusions. I don’t claim that Aristotle ‘solves’ the problem: it was never posed in Aristotle’s time. Rather, I suggest that Aristotle does not face the problem because he assumes deductions can be useful, without presenting novel conclusions. Aristotle’s view of deduction tames the scandal. (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.

There are various contexts in which it is not pertinent to generate and attend to all the classical consequences of a given premiss—or to trace all the premisses which classically entail a given consequence. Such contexts may involve limited resources of an agent or inferential engine, contextual relevance or irrelevance of certain consequences or premisses, modelling everyday human reasoning, the search for plausible abduced hypotheses or potential causes, etc. In this paper we propose and explicate one formal framework for a (...) whole spectrum of consequence relations, flexible enough to be tailored for choices from a variety of contexts. We do so by investigating semantic constraints on classical entailment which give rise to a family of infra-classical logics with appealing properties. More specifically, our infra-classical reasoning demands (beyond ${\alpha\models\beta}$ ) that Mod(β) does not run wild, but lies within the scope (whatever that may mean in some specific context) of Mod(α), and which can be described by a sentence ${\bullet\alpha}$ with ${\beta\models\bullet\alpha}$ . Besides being infra-classical, the resulting logic is also non-monotonic and allows for non-trivial reasoning in the presence of inconsistencies. (shrink)