{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:11:08Z","timestamp":1751429468043,"version":"3.41.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T00:00:00Z","timestamp":1596067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2020,7,30]]},"abstract":"<jats:p> The aim of this article is developing a formal system suitable for reasoning about the distance between propositional formulas. We introduce and study a formal language which is the extension of the classical propositional language obtained by adding new binary operators D<jats:sub>\u2264s<\/jats:sub> and D<jats:sub>\u2265s<\/jats:sub>, s \u2208 Range, where Range is a fixed finite set. In our language it is allowed to make formulas of the form D<jats:sub>\u2264s<\/jats:sub>( \u03b1; \u03b2) with the intended meaning \u2019distance between formulas \u03b1 and \u03b2 is less than or equal to s\u2019. The semantics of the proposed language consists of possible worlds with a distance function defined between sets of worlds. <\/jats:p>","DOI":"10.3233\/fi-2020-1938","type":"journal-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T16:31:46Z","timestamp":1596213106000},"page":"185-199","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Propositional Metric Logic with Fixed Finite Ranges"],"prefix":"10.1177","volume":"174","author":[{"given":"Radosav","family":"Djordjevi\u0107","sequence":"first","affiliation":[{"name":"Faculty of Science, University of Kragujevac, 34000 Kragujevac, Serbia."}]},{"given":"Neboj\u0161a","family":"Ikodinovi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics, University of Belgrade, 11000 Belgrade, Serbia."}]},{"given":"Nenad","family":"Stojanovi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Science, University of Kragujevac, 34000 Kragujevac, Serbia."}]}],"member":"179","published-online":{"date-parts":[[2020,7,30]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2020-1938","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2020-1938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:57:37Z","timestamp":1751367457000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2020-1938"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,30]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,7,30]]}},"alternative-id":["10.3233\/FI-2020-1938"],"URL":"https:\/\/doi.org\/10.3233\/fi-2020-1938","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"type":"print","value":"0169-2968"},{"type":"electronic","value":"1875-8681"}],"subject":[],"published":{"date-parts":[[2020,7,30]]}}}