# Explicit algebraic models for constructive and classical theories with non-standard elements

- 33 Downloads
- 1 Citations

## Abstract

We describe an explicit construction of algebraic models for theories with non-standard elements either with classical or constructive logic. The corresponding truthvalue algebra in our construction is a complete algebra of subsets of some concrete decidable set. This way we get a quite finitistic notion of true which reflects a notion of the deducibility of a given theory. It enables us to use*constructive*, proof-theoretical methods for theories with non-standard elements. It is especially useful in the case of theories with constructive logic where algorithmic properties are essential.

## Keywords

Mathematical Logic Classical Theory Computational Linguistic Explicit Construction Algebraic Model## Preview

Unable to display preview. Download preview PDF.

## References

- [1]
- [2]A.G. Dragalin, Mathematical Intuitionism. Introduction to Proof Theory,
*Translations of AMS*,**67**, 1988.Google Scholar - [3]A. Robinson, Non-Standard Analysis,
*Studies in Logic and the Foundations of Mathematics, North-Holland*, 1966.Google Scholar - [4]
- [5]A.G. Dragalin, An explicit Boolean-valued model for non-standard arithmetic,
*Publicationes Mathematicae, Debrecen, 3–4*,**42**, (1993), pp. 369–389.Google Scholar - [6]H. Rasiowa andR. Sikorski, The Mathematics of Metamathematics (second ed.),
*PWN, Warszawa*, 1968.Google Scholar - [7]A.G. Dragalin, A Completeness Theorem for Higher-order Intuitionistic Logic. An Intuitionistic Proof., in: Mathematical Logic and its Applications (ed. Dimiter Skordev, Gödel session),
*Plenum Press, New York*, 1987, pp. 107–124.Google Scholar - [8]A.G. Dragalin, Cut-elimination Theorem for Higher-order Classical Logic. An Intuitionistic Proof., in: Mathematical Logic and its Applications (ed. Dimiter Skordev, Gödel session),
*Plenum Press, New York*, 1987, pp. 243–252.Google Scholar - [9]S.A. Kripke, Semantical Analysis of Intuitionistic Logic I., in: Formal Systems and Recursive Functions (Proc, Eighth Logic Colloq., Oxford, 1963),
*North-Holland*, 1965, pp. 92–130.Google Scholar - [10]A.G. Dragalin, Complete Heyting and Boolean algebras over a partial ordering. Constructive apporoaches,
*accepted in the Proc. of the Colloq. on Topology, János Bolyai Math. Soc., August 23–27, 1993, Szekszárd, Hungary; also as Technical Report No 93/80, University of Debrecen, Math. Inst., 1993*.Google Scholar - [11]A.N. Kolmogoroff andA.G. Dragalin, Introduction to Mathematical Logic.,
*Moscow University*, 1982 (in Russian).Google Scholar - [12]E. Mendelson, Introduction to Mathematical Logic, 3-rd ed.,
*Wodsworth and Brooks, Calif.*1987.Google Scholar - [13]M. Takahashi, Cut-elimination theorem and Brouwerian-valued models for intuitionistic type theory,
*Comment. Math. Univ. St. Paul.***19**, (1971), pp. 55–72.Google Scholar - [14]A.G. Dragalin, The collapse of the descriptive complexity of truth definitions,
*Bull. of the Section of Logic*,**20**, (1991), pp. 94–95.Google Scholar - [15]A.G. Dragalin, ‘Completeness and cut-eleimination theorems in classical higher-order logics. Constructive methods’ (in Russian),
*Izvestiya VUZov*, Moskva**3**, 1993, pp. 3–18.Google Scholar