|کد مقاله||کد نشریه||سال انتشار||مقاله انگلیسی||ترجمه فارسی||نسخه تمام متن|
|4662909||1345208||2016||23 صفحه PDF||سفارش دهید||دانلود کنید|
We consider the binary relations of negligibility, comparability and proximity in the set of all hyperreals. Associating with negligibility, comparability and proximity the binary predicates N, C and P and the connectives [N][N], [C][C] and [P][P], we consider a first-order theory based on these predicates and a modal logic based on these connectives. We investigate the axiomatization/completeness and the decidability/complexity of this first-order theory and this modal logic.
Journal: Journal of Applied Logic - Volume 16, July 2016, Pages 14–36