Digitalni repozitorijum
Univerziteta u Kragujevcu
{{ mc.sd.lang | uppercase }}
Logike sa metričkim operatorima
Stojanović, Nenad, 1987-
Ikodinović, Nebojša
Rašković, Miodrag
Đorđević, Radosav
Ilić Stepić, Angelina
Marinković, Silvana
Boričić, Marija
The aim of this paper is to combine distance functions and Boolean proposi tions by developing a formalism suitable for speaking about distances between Boolean formulas. We introduce and investigate a formal language that is an extension of classical propositional language obtained by adding new binary (modal -like) operators of t he form D≤ s and D≥ s , seQt, Our language all ows making formulas such as D≤ s(a , (3 ) with the intended meaning 'distance between formulas a and (3 is less than or equal to s'. The semantics of the proposed language consists of possible worlds with a distanc e function defined between sets of worlds. Our main concern is a complete axiomatization that is sound and strongly complete with respect to the given semantics.
srpski
2018
Ovo delo je licencirano pod uslovima licence
Creative Commons CC BY-NC-ND 2.0 AT - Creative Commons Autorstvo - Nekomercijalno - Bez prerada 2.0 Austria License.
CC BY-NC-ND 2.0 AT
http://creativecommons.org/licenses/by-nc-nd/2.0/at/