The property of being true in almost all finite, initial segments of the standard model of arithmetic is ∑02 –complete. Thus, it admits a kind of a truth definition. We define such an arithmetical predicate. Then, we define its modal logic SL and prove a completeness theorem with respect to finite models semantics. The proof that SL is the modal logic of the approximate truth definition for finite arithmetical models is based on an extension of SL by a fixed-point construction.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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ć.