Journal of Symbolic Logic

A Completeness Theorem for Higher Order Logics

Gabor Sagi

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

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.

Article information

Source
J. Symbolic Logic, Volume 65, Issue 2 (2000), 857-884.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183746083

Mathematical Reviews number (MathSciNet)
MR1771091

Zentralblatt MATH identifier
0979.03047

JSTOR
links.jstor.org

Citation

Sagi, Gabor. A Completeness Theorem for Higher Order Logics. J. Symbolic Logic 65 (2000), no. 2, 857--884. https://projecteuclid.org/euclid.jsl/1183746083


Export citation