Abstract
The paper formalizes quantitative (numerical) modalities and describes their possible applications. We work via standard Kripke-like semantics for modal logics and introduce quantitative modalities as possibility to have predefined amount of different states (worlds) where formulas may be valid. Approach is applied to various modal semantics with distinct requirements to the accessibility relations (as e.g. to be reflexive, transitive). We illustrate possible applications in internet search, trading, banking transfers and another interference in internet network or another communication in information channels. Basic attention (as to mathematical subject) is directed to basic algorithmic problems - satisfiability and decidability problems, we find resolving algorithms. That is done for modal logic with quantitative modalities and for temporal logics generated by these quantitative modal logics by consideration temporal operations as bi-modalities. We conclude the paper with pointing open problems and possible further directions in research.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.