Logics for at most countable first-order structures (Q6867728)

The authors present two extensions of infinitary probabilistic \(\omega\)-logic corresponding to most countable Archimedean and non-Archimedean structures. First, they provide Hilbert-type axiomatizations and prove the strong completeness for these two logics. This result enables to represent syntactically particular countable Archimedean and non-Archimedean structures such as the real closure of \(\mathbf Q\) and the Hardy field \(\mathbf Q(\varepsilon)\). This framework also provides strong completeness for several well-known systems, and possible applications are illustrated in the cases of non-monotonic reasoning reasoning and weight functions for neuro-symbolic computing. The developing of many-sorted variants of the introduced logics to formalize reasoning about subsets of elements of domains is proposed for the future work.