We explore the use of Mercury for Inductive Logic Programming and present IMP0.5, the product of our research. Mercury is a compiled logic programming language with modern features, which requires the user to write type, mode and determinism declarations for each of their predicates. This information is used by the Mercury compiler to optimise generated code, which, amongst other things, enable...

As the largest library in China, the National Library of China (NLC) has spent more than 20 years in automating its processes, and has not yet had an integrated library management system, lagging behind libraries of developed countries and also other major libraries in China. In the 1980s and 1990s the NLC made slow progress; reasons for lack of success in the past include the inadequacy of bud...

The Swiss Federal Institute of Technology (ETH) Zurich introduced electronic dissertations in the year 2000. During the first phase the ETH Library scanned print documents retrospectively and made them available over the internet. Later authors were encouraged to provide the library with their own digital versions. With this very pragmatic approach a large collection could be built up within a ...

Motivated by showing that in ZFC we cannot construct a special Aronszajn tree on some cardinal greater than $${\aleph _1}$$ , produce model which the approachability property fails (hence there are no trees) at all regular cardinals interval $$\left[ {{\aleph _2},{\aleph _{{\omega ^2} + 3}}} \right]$$ and $${{\aleph ^2}}}}$$ is strong limit.

Continuing (Fuchino et al. in Arch Math Log, 2020. https://doi.org/10.1007/s00153-020-00730-x), we study the Strong Downward Lowenheim–Skolem Theorems (SDLSs) of stationary logic and their variations. In Fuchino (2020) it has been shown that SDLS for ordinary with weak second-order parameters $$\textsf {SDLS}({\mathcal {L}}^{\aleph _0}_{stat},{<}\,\aleph _2)$$ down to $${<}\,\aleph _2$$ is eq...