Abstract
In this paper, we deal with Leibniz’s rule of substitution of identicals, and describe how the rule can be applied in the TIL-Script language. The main goal is to introduce the algorithm of valid application of the substitution rules in all the three kinds of context that we distinguish in the TIL-Script language. The language is a computational variant of TIL, which is a hyperintensional, partial typed -calculus. Hyperintensional, because the meaning of TIL -terms are procedures producing functions rather than the denoted functions themselves. Partial, because TIL is a logic of partial functions, and typed, because all the entities of TIL ontology receive a type. Based on the results of context recognition the algorithm makes it possible to validly apply the substitution rules and derive relevant new pieces of analytic information.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
Recent years have seen a significant rise of interest in hyperintensional concepts, see, for instance [13]. For a summary of -calculi, see for instance [1] or [14]. These calculi are characterized as hyperintensional, because individuation of functions is not reduced to set-theoretical mappings. Rather, they operate with Church’s functions-in-intensions individuated more finely than mappings. However, these functions-in-intensions (or rules for producing mappings) cannot be displayed as objects on which other procedures operate. Thus, TIL indeed introduces another higher level of abstraction which is the hyperintensional level of displayed procedures.
- 3.
For details and definition of procedural isomorphism, see [6].
- 4.
For details, see [2, Sect. 2.6].
- 5.
- 6.
For more details on this tool and the algorithm of context recognition see [7].
References
Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics (Studies in Logic and the Foundations of Mathematics 103), 2nd edn. North-Holland, Amsterdam (1985)
Duží, M., Jespersen, B., Materna, P.: Procedural Semantics for Hyperintensional Logic. Foundations and Applications of Trasnsparent Intensional Logic. Springer, Berlin (2010)
Duží, M.: Extensional logic of hyperintensions. In: Lecture Notes in Computer Science, vol. 7260, pp. 268–290 (2012)
Duží, M.: Towards an extensional calculus of hyperintensions. Organon F 19(1), 20–45 (2012)
Duží, M.: Structural isomorphism of meaning and synonymy. Computacion y Sistemas 18(3), 439–453 (2014)
Duží, M.: If structured propositions are logical procedures then how are procedures individuated? Synthese special issue on the Unity of propositions (2017). https://doi.org/10.1007/s11229-017-1595-5
Duží, M., Fait, M.: The algorithm of context recognition in TIL. In: Rychlý, P., Horák, A., Rambousek, A. (eds.) 10th Workshop on Recent Advances in Slavonic Natural Language Processing, RASLAN 2016, pp. 51–62. Tribun, EU s.r.o (2016)
Duží, M., Fait, M., Menšík, M.: Context recognition for a hyperintensional inference machine. In: The AIP Proceeding of ICNAAM 2016, International Conference of Numerical Analysis and Applied Mathematics, vol. 1863 (2017). Article No. 330004
Duží, M., Materna, P.: Validity and applicability of Leibniz’s law of substitution of identicals. In: Arazim, P., Lavička, T. (eds.) The Logica Yearbook 2016, pp. 17–35. College Publications, London (2017)
Duží, M., Jespersen, B.: An intelligent question-answer system over natural-language texts. In: These Proceedings (2018)
Faroldi, F.L.G.: Co-hyperintensionality. Ratio 30(3), 270–287 (2017)
Jespersen, B., Carrara, M., Duží, M.: Iterated privation and positive predication. J. Appl. Log. 25, S48–S71 (2017)
Nolan, D.: Hyperintensional Metaphysics. Philos. Stud. 171(1), 149–160 (2014)
Revesz, G.E.: Lambda-Calculus, Combinators, and Functional Programming. Cambridge University Press, Cambridge, reprinted 2008 (1988)
Tichý, P.: The Foundations of Frege’s Logic. Walter de Gruyter, Berlin (1988)
Acknowledgments
This research was supported by the Grant Agency of the Czech Republic, project No. GA18-23891S “Hyperintensional Reasoning over Natural Language Texts”, by the internal grant agency of VSB-Technical University of Ostrava, project No. SP2018/172, “Application of Formal Methods in Knowledge Modelling and Software Engineering”, and also by the Moravian-Silesian region within the program “Support of science and research in Moravian-Silesian region 2017” (RRC/10/2017).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Fait, M., Duží, M. (2020). Substitution Rules with Respect to a Context. In: Zelinka, I., Brandstetter, P., Trong Dao, T., Hoang Duy, V., Kim, S. (eds) AETA 2018 - Recent Advances in Electrical Engineering and Related Sciences: Theory and Application. AETA 2018. Lecture Notes in Electrical Engineering, vol 554. Springer, Cham. https://doi.org/10.1007/978-3-030-14907-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-14907-9_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-14906-2
Online ISBN: 978-3-030-14907-9
eBook Packages: EngineeringEngineering (R0)