Transparent intensional logic (TIL) is a well-explored type-theoretical framework for semantics of natural language. However, its treatment of polymorphic functions, which are essential for the analysis of various natural language phenomena, is still underdeveloped. In this paper, we address this issue and propose an extension of TIL that introduces polymorphism via type variables ranging over types and generalized variables ranging over constructions and types. Furthermore, we offer an analysis of sentences involving non-specific notional attitudes of the general form ‘_A_ considers (...) (believes, desires, wants, seeks,...) something’. (shrink)

We prove how to validly quantify into hyperpropositional contexts de dicto in Transparent Intensional Logic. Hyperpropositions are sentential meanings and attitude complements individuated more finely than up to logical equivalence. A hyperpropositional context de dicto is a context in which only co-hyperintensional propositions can be validly substituted. A de dicto attitude ascription is one that preserves the attributee’s perspective when one complement is substituted for another. Being an extensional logic of hyperintensions, Transparent Intensional Logic validates all the rules of extensional (...) logic, including existential quantification. Yet the rules become more exacting when applied to hyperintensional contexts. The rules apply to only some types of entities, because the existence of only some types of entities is entailed by a hyperpropositional attitude de dicto. The insight that the paper offers is how a particular logic of hyperintensions is capable of validating quantifying-in in a principled and rigorous manner. This result advances the community-wide understanding of how to logically manipulate hyperintensions. (shrink)

This paper argues, first, that the information problem poses a foundational challenge to mainstream semantics. It proposes, second, to address this problem by drawing on notions from Kit Fine’s essentialist framework. More specifically, it claims that the information problem can be avoided by strengthening standard truth theories, employing an operator expressing the notion of a relative constitutive semantic requirement. As a result, the paper proposes to construe semantic theories as theories of semantic requirements, and semantic knowledge as knowledge of such (...) requirements. (shrink)

CAT4 is proposed as a general method for representing information, enabling a powerful programming method for large-scale information systems. It enables generalised machine learning, software automation and novel AI capabilities. It is based on a special type of relation called CAT4, which is interpreted to provide a semantic representation. This is Part 1 of a five-part introduction. The focus here is on defining the key mathematical structures first, and presenting the semantic-database application in subsequent Parts. We focus in Part 1 (...) on general axioms for the structures, and introduce key concepts. Part 2 analyses the CAT2 sub-relation of CAT4 in more detail. The interpretation of fact networks is introduced in Part 3, where we turn to interpreting semantics. We start with examples of relational and graph databases, with methods to translate them into CAT3 networks, with the aim of retaining the meaning of information. The full application to semantic theory comes in Part 4, where we introduce general functions, including the language interpretation or linguistic functions. The representation of linear symbolic languages, including natural languages and formal symbolic languages, is a function that CAT4 is uniquely suited to. In Part 5, we turn to software design considerations, to show how files, indexes, functions and screens can be defined to implement a CAT4 system efficiently. (shrink)

CAT4 is proposed as a general method for representing information, enabling a powerful programming method for large-scale information systems. It enables generalised machine learning, software automation and novel AI capabilities. It is based on a special type of relation called CAT4, which is interpreted to provide a semantic representation. This is Part 2 of a five-part introduction. The focus here is on defining key mathematical properties of CAT2, identifying the topology and defining essential functions over a coordinate system. The analysis (...) is from first principles. This develops on from the axioms introduced in Part 1. The interpretation of fact networks is introduced in Part 3, and the full application to semantic theory comes in Part 4, where we introduce general functions, including the language interpretation or linguistic functions. In Part 5, we turn to software design considerations, to show how files, indexes, functions and screens can be defined to implement a CAT4 system efficiently. (shrink)

CAT4 is proposed as a general method for representing information, enabling a powerful programming method for large-scale information systems. It enables generalised machine learning, software automation and novel AI capabilities. This is Part 3 of a five-part introduction. The focus here is on explaining the semantic model for CAT4. Points in CAT4 graphs represent facts. We introduce all the formal (data) elements used in the classic semantic model: sense or intension (1st and 2nd joins), reference (3rd join), functions (4th join), (...) time and truth (logical fields), and symbolic content (name/value fields). Concepts are introduced through examples alternating with theoretical discussion. Some concepts are assumed from Part 1 and 2, but key ideas are re-introduced. The purpose is to explain the CAT4 interpretation, and why the data structure and CAT4 axioms have been chosen: to make the semantic model consistent and complete. We start with methods to translate information from database tables into graph DBs and into CAT4. We conclude with a method for translating natural language into CAT4. We conclude with a comparison of the system with an advanced semantic logic, the hyper-intensional logic TIL, which also aims to translate NL into a logical calculus. The CAT4 Natural Language Translator is discussed in further detail in Part 4, when we introduce functions more formally. Part 5 discusses software design considerations. (shrink)

An overview of hyperintensionality is provided. Hyperintensional languages have expressions with meanings that are more fine-grained than necessary equivalence. That is, the expressions may necessarily co-apply and yet be distinct in meaning. Adequately accounting for theories cast in hyperintensional languages is important in the philosophy of language; the philosophy of mind; metaphysics; and elsewhere. This entry presents a number of areas in which hyperintensionality is important; a range of approaches to theorising about hyperintensional matters; and a range of debates that (...) attention to hyperintensional constructions has generated. (shrink)

The origins of proof-theoretic semantics lie in the question of what constitutes the meaning of the logical connectives and its response: the rules of inference that govern the use of the connective. However, what if we go a step further and ask about the meaning of a proof as a whole? In this paper we address this question and lay out a framework to distinguish sense and denotation of proofs. Two questions are central here. First of all, if we have (...) two different derivations, does this always lead to a difference, firstly, in sense, and secondly, in denotation? The other question is about the relation between different kinds of proof systems with respect to this distinction. Do the different forms of representing a proof necessarily correspond to a difference in how the inferential steps are given? In our framework it will be possible to identify denotation as well as sense of proofs not only within one proof system but also between different kinds of proof systems. Thus, we give an account to distinguish a mere syntactic divergence from a divergence in meaning and a divergence in meaning from a divergence of proof objects analogous to Frege’s distinction for singular terms and sentences. (shrink)

It is possible to construct situations (with a suitable kind of setting) in which one speaker utters ‘This is tasty’ and another speaker responds with ‘That’s not true’. The aim of this paper is to motivate the idea that typical (broadly) expressivist accounts of taste disagreements are not in a position to explain such situations (although some of them can successfully explain disagreements in which another kind of dissent phrase—like ‘Nuh-uh’—is employed). This is because utterances of ‘That’s not true’ are (...) typically used to ascribe falsehood to propositions. Taste expressivism has it, however, that when one utters ‘This is tasty’, one typically manifests her evaluative attitude (which is non-propositional) toward something rather than describes what attitude she bears toward the thing. Another aim of the paper consists in proposing an alternative account of taste disagreements. It is close to taste expressivism when it comes to the explanation of disagreements in which speakers respond with ‘Nuh-uh’ to utterances of ‘This is tasty’, but departs from it in situations in which they respond with ‘That’s not true’. The account is developed within a contextualist framework according to which taste utterances express contextually enriched propositions that contain judges who evaluate things as tasty or not. (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)

This paper is the twin of (Duží and Jespersen, in submission), which provides a logical rule for transparent quantification into hyperprop- ositional contexts de dicto, as in: Mary believes that the Evening Star is a planet; therefore, there is a concept c such that Mary be- lieves that what c conceptualizes is a planet. Here we provide two logical rules for transparent quantification into hyperpropositional contexts de re. (As a by-product, we also offer rules for possible- world propositional contexts.) One (...) rule validates this inference: Mary believes of the Evening Star that it is a planet; therefore, there is an x such that Mary believes of x that it is a planet. The other rule validates this inference: the Evening Star is such that it is believed by Mary to be a planet; therefore, there is an x such that x is believed by Mary to be a planet. Issues unique to the de re variant include partiality and existential presupposition, sub- stitutivity of co-referential (as opposed to co-denoting or synony- mous) terms, anaphora, and active vs. passive voice. The validity of quantifying-in presupposes an extensional logic of hyperinten- sions preserving transparency and compositionality in hyperinten- sional contexts. This requires raising the bar for what qualifies as co-denotation or equivalence in extensional contexts. Our logic is Tichý’s Transparent Intensional Logic. The syntax of TIL is the typed lambda calculus; its highly expressive semantics is based on a procedural redefinition of, inter alia, functional abstraction and application. The two non-standard features we need are a hyper- intension (called Trivialization) that presents other hyperintensions and a four-place substitution function (called Sub) defined over hy- perintensions. (shrink)

Possible worlds have found many applications in contemporary philosophy: from theories of possibility and necessity, to accounts of conditionals, to theories of mental and linguistic content, to understanding supervenience relationships, to theories of properties and propositions, among many other applications. Almost as soon as possible worlds started to be used in formal theories in logic, philosophy of language, philosophy of mind, metaphysics, and elsewhere, theorists started to wonder whether impossible worlds should be postulated as well. In many applications, possible worlds (...) face limitations that can be dealt with through postulating impossible worlds as well. This chapter examines some of the uses of impossible worlds, and philosophical challenges theories of impossible worlds face. (shrink)

I want to model a finite, fallible cognitive agent who imagines that p in the sense of mentally representing a scenario—a configuration of objects and properties—correctly described by p. I propose to capture imagination, so understood, via variably strict world quantifiers, in a modal framework including both possible and so-called impossible worlds. The latter secure lack of classical logical closure for the relevant mental states, while the variability of strictness captures how the agent imports information from actuality in the imagined (...) non-actual scenarios. Imagination turns out to be highly hyperintensional, but not logically anarchic. Section 1 sets the stage and impossible worlds are quickly introduced in Sect. 2. Section 3 proposes to model imagination via variably strict world quantifiers. Section 4 introduces the formal semantics. Section 5 argues that imagination has a minimal mereological structure validating some logical inferences. Section 6 deals with how imagination under-determines the represented contents. Section 7 proposes additional constraints on the semantics, validating further inferences. Section 8 describes some welcome invalidities. Section 9 examines the effects of importing false beliefs into the imagined scenarios. Finally, Sect. 10 hints at possible developments of the theory in the direction of two-dimensional semantics. (shrink)

Rigid designators designate whatever they do in all possible worlds. Mathematical definite descriptions are usually considered paradigmatic examples of such expressions. The main aim of the present paper is to challenge this view. It is argued that mathematical definite descriptions cannot be rigid in the same sense as ordinary empirical definite descriptions because—assuming that mathematical facts are not determined by goings on in possible worlds—mathematical descriptions designate whatever they do independently of possible worlds. Nevertheless, there is a widespread practice of (...) treating mathematical definite descriptions as rigid. Apart from this, there might be theoretical reasons for admitting that they are rigid in some sense. The second part of the paper suggests a way out. Borrowing from ideas proposed by Kit Fine, it develops and defends an extended notion of rigidity, which can be applied to mathematical definite descriptions. Importantly, this notion is fully compatible with the claim that mathematical facts are independent of possible worlds. (shrink)

The paper concentrates on the problem of adequate reflection of fragments of reality via expressions of language and inter-subjective knowledge about these fragments, called here, in brief, language adequacy. This problem is formulated in several aspects, the most being: the compatibility of language syntax with its bi-level semantics: intensional and extensional. In this paper, various aspects of language adequacy find their logical explication on the ground of the formal-logical theory T of any categorial language L generated by the so-called classical (...) categorial grammar, and also on the ground of its extension to the bi-level, intensional and extensional semantic-pragmatic theory ST for L. In T, according to the token-type distinction of Ch.S. Peirce, L is characterized first as a language of well-formed expression-tokens (wfe-tokens) - material, concrete objects - and then as a language of wfe-types - abstract objects, classes of wfe-tokens. In ST the semantic-pragmatic notions of meaning and interpretation for wfe-types of L of intensional semantics and the notion of denotation of extensional semanics for wfe-types and constituents of knowledge are formalized. These notions allow formulating a postulate (an axiom of categorial adequacy) from which follow all the most important conditions of the language adequacy, including the above, and a structural one connected with three principles of compositionality. (shrink)

Languages involving modalities and languages involving vagueness have each been thoroughly studied. On the other hand, virtually nothing has been said about the interaction of modality and vagueness. This paper aims to start filling that gap. Section 1 is a discussion of various possible sources of vague modality. Section 2 puts forward a model theory for a quantified language with operators for modality and vagueness. The model theory is followed by a discussion of the resulting logic. In Section 3, the (...) framework will permit us to address a puzzle raised by Elizabeth Barnes and Robert Williams. (shrink)

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)

In a 2005 paper Ólafur Páll Jónsson presents a puzzle that turns on intentional identity and definite descriptions. He considers eight solutions and rejects them all, thus leaving the puzzle unsolved. In this paper I put forward a solution. The puzzle is this. Little Lotta wants most of all a bicycle for her birthday, but she gets none. Distracted by the gifts she does receive, she at first does not think about the bike. But when seeing her tricycle, she is (...) reminded of the bike. The question is how we are to analyse these two occurrences of ‘the bike’ in the absence of a unique bike that Lotta wants. So the semantics of ‘the bike’ needs to be spelt out, and it must be made explicit what the complements of Lotta’s attitudes are. My analysis shows that the attributer’s usage of ‘the bike’ blurs the distinction between a second-order and a first-order intension (a property concept and a property, respectively). My solution can be summed up in this two-premise argument. (a) In the state-of-affairs S, the property of being a bike is the extension of the property concept the property such that Lotta wants an instance of it more than any other; (b) in S, Lotta does not think about/is reminded of the property that she wants an instance of more than any other; (c) therefore, in S Lotta does not think about/is reminded of the property of being a bike. This solution requires looking beyond the confines of denotational semantics, which all of Jónsson’s eight solution candidates belong to. (shrink)

It is usually claimed that taste utterances have judge-dependent semantic content. Jeremy Wyatt recently proposed a semantic theory that rejects this claim. According to him, the semantic content of taste sentences is judge-independent, but the content of our assertions made by uttering taste sentences is judge-dependent. He showed that this account explains faultless disagreements about tastes. My paper aims to raise some challenges to his proposal. First, a judge-independent taste proposition semantically expressed by a taste sentence seems unrelated to a (...) judge-dependent taste proposition asserted by the speaker. It means that the latter proposition is not systematically obtained from the former. Second, the theory assumes that there are judge-independent taste properties. The existence of such properties can be questioned because it is problematic to state instantiation conditions for them. The paper ends with a sketch of an alternative explanation; it shares Wyatt’s account of faultless disagreements but does not suffer from its drawbacks. (shrink)

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)

This article introduces, studies, and applies a new system of logic which is called ‘HYPE’. In HYPE, formulas are evaluated at states that may exhibit truth value gaps and truth value gluts. Simple and natural semantic rules for negation and the conditional operator are formulated based on an incompatibility relation and a partial fusion operation on states. The semantics is worked out in formal and philosophical detail, and a sound and complete axiomatization is provided both for the propositional and the (...) predicate logic of the system. The propositional logic of HYPE is shown to contain first-degree entailment, to have the Finite Model Property, to be decidable, to have the Disjunction Property, and to extend intuitionistic propositional logic conservatively when intuitionistic negation is defined appropriately by HYPE’s logical connectives. Furthermore, HYPE’s first-order logic is a conservative extension of intuitionistic logic with the Constant Domain Axiom, when intuitionistic negation is again defined appropriately. The system allows for simple model constructions and intuitive Euler-Venn-like diagrams, and its logical structure matches structures well-known from ordinary mathematics, such as from optimization theory, combinatorics, and graph theory. HYPE may also be used as a general logical framework in which different systems of logic can be studied, compared, and combined. In particular, HYPE is found to relate in interesting ways to classical logic and various systems of relevance and paraconsistent logic, many-valued logic, and truthmaker semantics. On the philosophical side, if used as a logic for theories of type-free truth, HYPE is shown to address semantic paradoxes such as the Liar Paradox by extending non-classical fixed-point interpretations of truth by a conditional as well-behaved as that of intuitionistic logic. Finally, HYPE may be used as a background system for modal operators that create hyperintensional contexts, though the details of this application need to be left to follow-up work. (shrink)

In this paper, I present, generalize and develop the extensionalist theory of rigidity for general terms in light of criteria commonly applied to theories of general term rigidity. According to the theory, a general term is rigid if its extension is constant across all possible worlds. This position has been widely dismissed because it conflicts with the seemingly straightforward idea that natural kind terms have varying extensions from world to world. This criticism holds only to the extent that natural kind (...) terms are indeed rigid. If it turns out that we need not view them as rigid, then the extensionalist theory fares well when compared with other theoretical requirements. (shrink)

The paper provides an alternative interpretation of ‘pair points’, discussed in Beall et al., "On the ternary relation and conditionality", J. of Philosophical Logic 41(3), 595-612. Pair points are seen as points viewed from two different ‘perspectives’ and the latter are explicated in terms of two independent valuations. The interpretation is developed into a semantics using pairs of Kripke models (‘pair models’). It is demonstrated that, if certain conditions are fulfilled, pair models are validity-preserving copies of positive substructural models. This (...) yields a general soundness and completeness result for a variety of (positive) substructural logics with respect to multimodal Kripke frames with binary accessibility relations. In addition, an epistemic interpretation of pair models is provided. (shrink)

Strawson’s work seems to contain both pragmatic and semantic concepts of presupposition. The former concept has largely been studied by many philosophers and linguists, while the latter has not been properly investigated (van Fraassen being an exception). The present author explicates the semantic concept of existential presupposition in relation to deriving existential statements and distinguishing their de dicto/de re variants (in the rather generalized sense following Tichý).

We introduce a general representation of unary hyperintensional modalities and study various hyperintensional modal logics based on the representation. It is shown that the major approaches to hyperintensionality known from the literature, that is state-based, syntactic and structuralist approaches, all correspond to special cases of the general framework. Completeness results pertaining to our hyperintensional modal logics are established.

In this paper we examine two approaches to the formal treatment of the notion of problem in the paradigm of algorithmic semantics. Namely, we will explore an approach based on Martin-Löf’s Constructive Type Theory, which can be seen as a direct continuation of Kolmogorov’s original calculus of problems, and an approach utilizing Tichý’s Transparent Intensional Logic, which can be viewed as a non-constructive attempt of interpreting Kolmogorov’s logic of problems. In the last section we propose Kolmogorov and CTT-inspired modifications to (...) TIL-based approach. The focus will be on non-empirical problems only. (shrink)

This paper addresses the mereological problem of the unity of structured propositions. The problem is how to make multiple parts interact such that they form a whole that is ultimately related to truth and falsity. The solution I propose is based on a Platonist variant of procedural semantics. I think of procedures as abstract entities that detail a logical path from input to output. Procedures are modeled on a function/argument logic, but are not functions. Instead they are higher-order, fine-grained structures. (...) I identify propositions with particular kinds of molecular procedures containing multiple sub-procedures as parts. Procedures are among the basic entities of my ontology, while propositions are derived entities. The core of a structured proposition is the procedure of predication, which is an instance of the procedure of functional application. The main thesis I defend is that procedurally conceived propositions are their own unifiers detailing how their parts interact so as to form a unit. They are not unified by one of their constituents, e.g., a relation or a sub-procedure, on pain of regress. The relevant procedural semantics is Transparent Intensional Logic, a hyperintensional, typed λ-calculus, whose λ-terms express four different kinds of procedures. While demonstrating how the theory works, I place my solution in a wider historical and systematic context. (shrink)

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 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.

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)

We present here the papers selected for the volume on the Unity of Propositions problems. After summarizing what the problems are, we locate them in a spectrum from those aiming to provide substantive, reductive explanations, to those with a more deflationary take on the problems.

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)

This paper presents an original semantic theory of proper names that aims to cover both non-empty and empty proper names. According to the theory, proper names have simple assignable hyperintensions as their content. This content provides the referent (if there is one) for which the proper name stands. The paper further describes the role of the proposed content of (empty) proper names within the compositional semantics of problematic sentences. I stress the difference between the content of a sentence (i.e. its (...) hyperintension) and the proposition (i.e. a mapping from possible worlds to truth values) denoted by that sentence. (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)

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.

This paper deals with generalisations of modally based criteria for determining whether a given property is essential to an individual to the case of generic essences. These criteria usually presuppose extensionally individuated properties. The limitations of their generalisations are demonstrated using the case of the necessarily empty individual property and the necessarily empty individual office. I do not present a novel stance on the discussion of individual essences. The novelty of this paper lies in its claim that none of these (...) criteria can be generalised to generic essences. (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)

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)

Role realism is a promising realist theory of fictional names. Different versions of this theory have been suggested by Gregory Currie, Peter Lamarque, Stein Haugom Olsen, and Nicholas Wolterstorff. The general idea behind the approach is that fictional characters are to be analysed in terms of roles, which in turn can be understood as sets of properties. I will discuss several advantages and disadvantages of this approach. I will then propose a novel hyperintensional version of role realism, according to which (...) fictional names are analysed in terms of individual concepts that cannot be matched by a reference. I will argue that this account avoids the main disadvantages of standard role realism. (shrink)

From a general semantic point of view, Thomas Bricot and John Mair are proponents of the solution to semantic paradoxes based on appreciation of the contextuality of truth, who differ in their approach to the relations of logical consequence and contradiction. The core of the study is the analysis of Mair's criticism of Bricot presented in the sixth quaestio of his Tractatus insolubilium where the consequences of non-compositional semantics for the concepts of synonymy and logical form are addressed. The polemic (...) between John Mair and Thomas Bricot is construed as having immediate consequences for research in the area of non-compositional semantics. (shrink)

Theories of structured meanings are designed to generate fine-grained meanings, but they are also liable to overgenerate structures, thus drawing structural distinctions without a semantic difference. I recommend the proliferation of very fine-grained structures, so that we are able to draw any semantic distinctions we think we might need. But, in order to contain overgeneration, I argue we should insert some degree of individuation between logical equivalence and structural identity based on structural isomorphism. The idea amounts to forming an equivalence (...) class of different structures according to one or more formal criteria and designating a privileged element as a representative of all the elements, i.e., a first among equals. The proposed method helps us to a cluster of notions of co-hyperintensionality. As a test case, I consider a recent objection levelled against the act theory of structured propositions. I also respond to an objection against my methodology. (shrink)

1. This paper addresses the development of mutual relations between two sets of ideas in scholastic logic. First, consider the following statements: (1) It is impossible to encounter a chimera.(2)...

In Transparent Intensional Logic we can recognize two distinct notions of computation that loosely correspond to term rewriting and term interpretation as known from lambda calculus. Our goal will be to further explore these two notions and examine some of their properties.

The paper proposes a solution to the problem of counterfactuals, building on both Rescher’s epistemic and Tichý’s semantic approaches. The core of the proposed solution is the thesis that when expressing a true counterfactual, the speaker assumes a set of background indicative premises as an implicit parameter. When added tacitly to an unreal antecedent, these premises entail the consequent logically or analytically. We draw a distinction between a potentially unreal and an absolutely unreal condition expressed in the antecedent. We view (...) counterfactuals with a positive time vector and an absolute unreal condition as abbreviated deductive retrodictions. Similarly, we consider counterfactuals with a potentially unreal condition to be abbreviated deductive predictions. In a similar manner, we also explain the truth (falsity) of vacuously true counterpossibles or counterpossible conditionals. In the second part, we discuss the enigmatic backtracking counterfactuals. We propose that their negative time direction is due to their being abductive retrodictions, i.e., explanations of unreal effects based on possible causes in which the conditions remain tacit or unexpressed. The backtracking temporal direction of counterfactual abductive retrodictions is in accordance with the thesis on the positive temporal direction from cause to effect. Thus, we demonstrate that in order to explain backtracking counterfactuals, there is no need to assume violations of laws of nature or a special logic. What we need to do is to take into account the third parameter, i.e., a set of tacit or unexpressed additional propositions, as well as the principle of ceteris paribus as the background. (shrink)

I extend theories of nonmonotonic reasoning to account for reasons allowing free choice. My approach works with a wide variety of approaches to nonmonotonic reasoning and explains the connection between reasons for kinds of action and reasons for actions or subkinds falling under them. I use an Anderson–Kanger reduction of reason statements, identifying key principles in the logic of reasons.

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.