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

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F19%3A10236203" target="_blank" >RIV/61989100:27240/19:10236203 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/article/10.1007/s11229-017-1595-5?no-access=true" target="_blank" >https://link.springer.com/article/10.1007/s11229-017-1595-5?no-access=true</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11229-017-1595-5" target="_blank" >10.1007/s11229-017-1595-5</a>

Result language
angličtina
Original language name
If structured propositions are logical procedures then how are procedures individuated?
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics

Project
<a href="/en/project/GA15-13277S" target="_blank" >GA15-13277S: Hyperintensional logic for natural language analysis</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)