We consider sl–semantics in which first order sentences are interpreted in potentially infinite domains. A potentially infinite domain is a growing sequence of finite models. We prove the completeness theorem for first order logic under this semantics. Additionally we characterize the logic of such domains as having a learnable, but not recursive, set of axioms. The work is a part of author’s research devoted to computationally motivated foundations of mathematics.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.