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)

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