Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4662909 | Journal of Applied Logic | 2016 | 23 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Philippe Balbiani,