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)

Structured propositions are often invoked to explain why intensionally equivalent sentences do not substitute salva veritate into attitude ascriptions. As the semantics is standardly developed—for example, in Salmon, Soames :47–87, 1987) and King :516–535, 1995), the semantic value of a complex expression is an ordered complex consisting of the semantic values of its components. Such views, however, trivialize semantic composition since they do not allow for independent constraints on the meaning of complexes. Trivializing semantic composition risks “trivializing semantics” Semantics versus (...) pragmatics, Oxford University Press, Oxford, 2005). Yet, proponents of structured propositions suggest a route to reimpose substantive compositionality. While the mapping from a sentence to the structured proposition it expresses is trivially compositional, there is a non-trivial mapping from the structured proposition to its truth-value. This non-trivial level of semantic composition allows the meanings assigned to complex expressions to impose substantive constraints on the meanings of the simple ones. I first articulate the basic desiderata: an account of structured propositions capable of explaining attitude attributions and of delivering a non-trivially compositional semantics. I then show that the two-stage semantics proposed by standard proponents of structured propositions does not satisfy these joint goals. (shrink)

Many philosophers believe in things, propositions, which are the things that we believe, assert etc., and which are the contents of sentences. The act-type theory of propositions is an attempt to say what propositions are, to explain how we stand in relations to them, and to explain why they are true or false. The core idea of the act-type theory is that propositions are types of acts of predication. The theory is developed in various ways to offer explanations of the (...) important properties of propositions. I present the core idea of the theory, and some developments of it. I discuss the relationship between the theory and the content–force distinction. I also present an important type of objection that has been raised to the explanations offered by the act-type theory. (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)

Båve has argued that act-type theories of propositions entail unwanted ambiguity of sentences such as ‘Donald loves Joan’. King has argued that act-type theories of propositions entail an unwanted abundance of propositions. I reply that a version of the act-type theory can avoid these objections. The key idea is that grammar constrains the acts that can be performed by the utterance of a sentence. I present enough of the details of this version of the act-type theory to show how it (...) can be used to respond to Båve's and King's objections. I conclude that this is a promising way to develop the act-type theory of propositions. (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)