Transparent quantification into hyperpropositional contexts de re

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

Towards an extensional calculus of hyperintensions

In this paper I describe an extensional logic of hyperintensions, viz. Tichý's Transparent Intensional Logic (TIL). TIL preserves transparency and compositionality in all kinds of context, and validates quantifying into all contexts, including intensional and hyperintensional ones. The received view is that an intensional (let alone hyperintensional) context is one that fails to validate transparency, compositionality, and quantifying-in; and vice versa, if a context fails to validate these extensional principles, then the context is 'opaque', that is non-extensional. We steer clear of this circle by defining extensionality for hyperintensions presenting functions, functions (including possible-world intensions), and functional values. The main features of our logic are that the senses of expressions remain invariant across contexts and that our ramified type theory enables quantification over any logical objects of any order into any context. The syntax of TIL is the typed lambda calculus; its semantics is based on a procedural redefinition of, inter alia, functional abstraction and application. The only two non-standard features of our logic are a hyperintension called Trivialization and a fourplace substitution function (called Sub) defined over hyperintensions. Using this logical machinery I propose rules of existential generalization and substitution of identicals into the three kinds of context.Web of Science191452

If structured propositions are logical procedures then how are procedures individuated?

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 (as opposed to displayed 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

Communication in a multi-cultural world

The goal of this paper is to demonstrate that procedurally structured con- cepts are central to human communication in all cultures and throughout history. This thesis is supported by an analytical survey of three very different means of communication, namely Egyptian hieroglyphs, pictures, and Inca knot writing known as khipu. My thesis is that we learn, communicate and think by means of concepts; and regardless of the way in which the meaning of an expression is encoded, the meaning is a concept. Yet we do not define concepts within the classical set-theoretical framework. Instead, within the logical framework of Transparent Intensional Logic, we explicate concepts as logical procedures that can be assigned to expressions as their context-invariant meaning. In particular, complex meanings, which structurally match complex expressions, are complex procedures whose parts are sub-procedures. The moral suggested by the paper is this. Concepts are not flat sets; rather, they are algorithmically structured abstract procedures. Unlike sets, concepts have constituent sub-procedures that can be executed in order to arrive at the product of the procedure (if any). Not only particular parts matter, but also the way of combining these parts into one whole ‘instruction’ that can be followed, understood, executed, learnt, etc., matters.Web of Science21221819

If structured propositions are logical procedures then how are procedures individuated?

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 (as opposed to displayed 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

Deduction in TIL: from simple to ramified hierarchy of types

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.Web of Science20suppl 236

Refining concepts by machine learning

DOI nefunkční (25.11.2019)In this paper we deal with machine learning methods and algorithms applied in learning simple concepts by their refining or explication. The method of refining a simple concept of an object O consists in discovering a molecular concept that defines the same or a very similar object to the object O. Typically, such a molecular concept is a professional definition of the object, for instance a biological definition according to taxonomy, or legal definition of roles, acts, etc. Our background theory is Transparent Intensional Logic (TIL). In TIL concepts are explicated as abstract procedures encoded by natural language terms. These procedures are defined as six kinds of TIL constructions. First, we briefly introduce the method of learning with a supervisor that is applied in our case. Then we describe the algorithm 'Framework' together with heuristic methods applied by it. The heuristics is based on a plausible supply of positive and negative (near-miss) examples by which learner's hypotheses are refined and adjusted. Given a positive example, the learner refines the hypothesis learnt so far, while a near-miss example triggers specialization. Our heuristic methods deal with the way refinement is applied, which includes also its special cases generalization and specialization.Web of Science23395894

Two kinds of procedural semantics for privative modification

In this paper we present two kinds of procedural semantics for privative modification. We do this for three reasons. The first reason is to launch a tough test case to gauge the degree of substantial agreement between a constructivist and a realist interpretation of procedural semantics; the second is to extend Martin-L ̈f’s Constructive Type Theory to privative modification, which is characteristic of natural language; the third reason is to sketch a positive characterization of privation

About a Mature Theory of Fregean Sense

Marie Duží, Bjørn Jespersen, and Pavel Materna: Procedural Semantics for Hyperintensional Logic. Foundations and Applications of Transparent Intentional Logic, vol. 17 of series “Logic, Epistemology, and the Unity of Science”, Springer, Dordrecht, Heidelberg, London, New York, 2010; xiii+552 pages, ISBN 978-90-481-8811-6, e-ISBN 978-90-481-8812-3. DOI: 10.1007/978-90-481-8812-