A completeness theorem for higher order logics

2000 ◽  
Vol 65 (2) ◽  
pp. 857-884 ◽  
Author(s):  
Gábor Sági

AbstractHere we investigate the classes of representable directed cylindric algebras of dimension α introduced by Németi [12]. 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 Németi: (i) is a finitely axiomatizable variety whenever α ≥ 3 is finite and (ii) one can obtain a strong representation theorem for 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.

1992 ◽  
Vol 34 (3) ◽  
pp. 301-307 ◽  
Author(s):  
L. P. Belluce ◽  
A. Di Nola ◽  
A. Lettieri

MV-algebras were introduced by C. C. Chang [3] in 1958 in order to provide an algebraic proof for the completeness theorem of the Lukasiewicz infinite valued propositional logic. In recent years the scope of applications of MV-algebras has been extended to lattice-ordered abelian groups, AF C*-algebras [10] and fuzzy set theory [1].


1971 ◽  
Vol 36 (3) ◽  
pp. 414-432 ◽  
Author(s):  
Peter B. Andrews

In [8] J. A. Robinson introduced a complete refutation procedure called resolution for first order predicate calculus. Resolution is based on ideas in Herbrand's Theorem, and provides a very convenient framework in which to search for a proof of a wff believed to be a theorem. Moreover, it has proved possible to formulate many refinements of resolution which are still complete but are more efficient, at least in many contexts. However, when efficiency is a prime consideration, the restriction to first order logic is unfortunate, since many statements of mathematics (and other disciplines) can be expressed more simply and naturally in higher order logic than in first order logic. Also, the fact that in higher order logic (as in many-sorted first order logic) there is an explicit syntactic distinction between expressions which denote different types of intuitive objects is of great value where matching is involved, since one is automatically prevented from trying to make certain inappropriate matches. (One may contrast this with the situation in which mathematical statements are expressed in the symbolism of axiomatic set theory.).


2007 ◽  
Vol 24 (02) ◽  
pp. 181-202
Author(s):  
YUKIHIRO MARUYAMA

In this paper, we will introduce a new subclass of bitone sequential decision process (bsdp) and give a representation theorem for the subclass called positively/negatively bsdp, shortly, p/n bsdp, that is, necessary and sufficient condition for p/n bsdp to strongly represent a given discrete decision process (ddp).


1969 ◽  
Vol 34 (3) ◽  
pp. 331-343 ◽  
Author(s):  
J. Donald Monk

Cylindric algebras were introduced by Alfred Tarski about 1952 to provide an algebraic analysis of (first-order) predicate logic. With each cylindric algebra one can, in fact, associate a certain, in general infinitary, predicate logic; for locally finite cylindric algebras of infinite dimension the associated predicate logics are finitary. As with Boolean algebras and sentential logic, the algebraic counterpart of completeness is representability. Tarski proved the fundamental result that every locally finite cylindric algebra of infinite dimension is representable.


2016 ◽  
Vol 81 (3) ◽  
pp. 1069-1086
Author(s):  
CHARLES C. PINTER

AbstractThe Stone representation theorem was a milestone for the understanding of Boolean algebras. From Stone’s theorem, every Boolean algebra is representable as a field of sets with a topological structure. By means of this, the structural elements of any Boolean algebra, as well as the relations between them, are represented geometrically and can be clearly visualized. It is no different for cylindric algebras: Suppose that ${\frak A}$ is a cylindric algebra and ${\cal S}$ is the Stone space of its Boolean part. (Among the elements of the Boolean part are the diagonal elements.) It is known that with nothing more than a family of equivalence relations on ${\cal S}$ to represent quantifiers, ${\cal S}$ represents the full cylindric structure just as the Stone space alone represents the Boolean structure. ${\cal S}$ with this structure is called a cylindric space.Many assertions about cylindric algebras can be stated in terms of elementary topological properties of ${\cal S}$. Moreover, points of ${\cal S}$ may be construed as models, and on that construal ${\cal S}$ is called a model space. Certain relations between points on this space turn out to be morphisms between models, and the space of models with these relations hints at the possibility of an “abstract” model theory. With these ideas, a point-set version of model theory is proposed, in the spirit of pointless topology or category theory, in which the central insight is to treat the semantic objects (models) homologously with the corresponding syntactic objects so they reside together in the same space.It is shown that there is a new, purely algebraic way of introducing constants in cylindric algebras, leading to a simplified proof of the representation theorem for locally finite cylindric algebras. Simple rich algebras emerge as homomorphic images of cylindric algebras. The topological version of this theorem is especially interesting: The Stone space of every locally finite cylindric algebra ${\frak A}$ can be partitioned into subspaces which are the Stone spaces of all the simple rich homomorphic images of ${\frak A}$. Each of these images completely determines a model of ${\frak A}$, and all denumerable models of ${\frak A}$ appear in this representation.The Stone space ${\cal S}$ of every cylindric algebra can likewise be partitioned into closed sets which are duals of all the types in ${\frak A}$. This fact yields new insights into miscellaneous results in the model theory of saturated models.


2001 ◽  
Vol 66 (1) ◽  
pp. 207-224 ◽  
Author(s):  
Vera Stebletsova ◽  
Yde Venema

AbstractWith each projective geometry we can associate a Lyndon algebra. Such an algebra always satisfies Tarski's axioms for relation algebras and Lyndon algebras thus form an interesting connection between the fields of projective geometry and algebraic logic. In this paper we prove that if G is a class of projective geometries which contains an infinite projective geometry of dimension at least three, then the class L(G) of Lyndon algebras associated with projective geometries in G has an undecidable equational theory. In our proof we develop and use a connection between projective geometries and diagonal-free cylindric algebras.


2002 ◽  
Vol 67 (1) ◽  
pp. 197-213 ◽  
Author(s):  
Robin Hirsch ◽  
Ian Hodkinson ◽  
Roger D. Maddux

AbstractWe confirm a conjecture, about neat embeddings of cylindric algebras, made in 1969 by J. D. Monk, and a later conjecture by Maddux about relation algebras obtained from cylindric algebras. These results in algebraic logic have the following consequence for predicate logic: for every finite cardinal α ≥ 3 there is a logically valid sentence X, in a first-order language ℒ with equality and exactly one nonlogical binary relation symbol E, such that X contains only 3 variables (each of which may occur arbitrarily many times), X has a proof containing exactly α + 1 variables, but X has no proof containing only α variables. This solves a problem posed by Tarski and Givant in 1987.


Sign in / Sign up

Export Citation Format

Share Document