A Completeness Theorem for Higher Order Logics
Sagi, Gabor
J. Symbolic Logic, Tome 65 (2000) no. 1, p. 857-884 / Harvested from Project Euclid
Here we investigate the classes RCA$^\uparrow_\alpha$ of representable directed cylindric algebras of dimension $\alpha$ introduced by Nemeti[12]. RCA$^\uparrow_\alpha$ can be seen in two different ways: first, as an algebraic counterpart of higher order logics and second, as a cylindric algebraic analogue of Quasi-Projective Relation Algebras. We will give a new, "purely cylindric algebraic" proof for the following theorems of Nemeti: (i) RCA$^\uparrow_\alpha$ is a finitely axiomatizable variety whenever $\alpha \geq 3$ is finite and (ii) one can obtain a strong representation theorem for RCA$^\uparrow_\alpha$ if one chooses an appropriate (non-well-founded) set theory as foundation of mathematics. These results provide a purely cylindric algebraic solution for the Finitization Problem (in the sense of [11]) in some non-well-founded set theories.
Publié le : 2000-06-14
Classification: 
@article{1183746083,
     author = {Sagi, Gabor},
     title = {A Completeness Theorem for Higher Order Logics},
     journal = {J. Symbolic Logic},
     volume = {65},
     number = {1},
     year = {2000},
     pages = { 857-884},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746083}
}
Sagi, Gabor. A Completeness Theorem for Higher Order Logics. J. Symbolic Logic, Tome 65 (2000) no. 1, pp.  857-884. http://gdmltest.u-ga.fr/item/1183746083/