Diophantine geometry over groups V1: Quantifier elimination I

This paper is the first part (out of two) of the fifth paper in a sequence on the structure of sets of solutions to systems of equations in a free group, projections of such sets, and the structure of elementary sets defined over a free group. In the two papers on quantifier elimination we use the iterative procedure that validates the correctness of anAE sentence defined over a free group, presented in the fourth paper, to show that the Boolean algebra ofAE sets defined over a free group is invariant under projections, and hence show that every elementary set defined over a free group is in the Boolean algebra ofAE sets. The procedures we use for quantifier elimination, presented in this paper and its successor, enable us to answer affirmatively some of Tarski's questions on the elementary theory of a free group in the sixth paper of this sequence. Partially supported by an Israel Academy of Sciences Fellowship.     

Diophantine geometry over groups VI: the elementary theory of a free group

This paper is the sixth in a sequence on the structure of sets of solutions to systems of equations in a free group, projections of such sets, and the structure of elementary sets defined over a free group. In the sixth paper we use the quantifier elimination procedure presented in the two parts of the fifth paper in the sequence, to answer some of A. Tarski’s problems on the elementary theory of a free group, and to classify finitely generated (f.g.) groups that are elementarily equivalent to a non-abelian f.g. free group. Received (resubmission): January 2004 Revision: January 2006 Accepted: January 2006 Partially supported by an Israel Academy of Sciences fellowship.     

Diophantine geometry over groups IV: An iterative procedure for validation of a sentence

This paper is the fourth in a series on the structure of sets of solutions to systems of equations in a free group, projections of such sets, and the structure of elementary sets defined over a free group. In the fourth paper we present an iterative procedure that validates the correctness of anAE sentence defined over a free group. The terminating procedure presented in this paper is the basis for our analysis of elementary sets defined over a free group presented in the next papers in the series. Partially supported by an Israel Academy of Sciences Fellowship.     

Diophantine geometry over groups III: Rigid and solid solutions

This paper is the third in a series on the structure of sets of solutions to systems of equations in a free group, projections of such sets, and the structure of elementary sets defined over a free group. In the third paper we analyze exceptional families of solutions to a parametric system of equations. The structure of the exceptional solutions, and the global bound on the number of families of exceptional solutions we obtain, play an essential role in our approach towards quantifier elimination in the elementary theory of a free group presented in the next papers of this series. The argument used for proving the global bound is a key in proving the termination of the quantifier elimination procedure presented in the sixth paper of the series. Partially supported by an Israel Academy of Sciences Fellowship.     

Diophanting geometry over groups II: Completions,closures and formal solutions

This paper is the second in a series on the structure of sets of solutions to systems of equations in a free group, projections of such sets, and the structure of elementary sets defined over a free group. In the second paper we generalize Merzlyakov’s theorem on the existence of a formal solution associated with a positive sentence [Me]. We first construct a formal solution to a generalAE sentence which is known to be true over some variety, and then develop tools that enable us to analyze the collection of all such formal solutions. Partially supported by an Israel Academy of Sciences Fellowship.     

Generalized Boolean Algebras in Lattice-Ordered Groups

In this paper, characterizations are given for the free lattice-ordered group over a generalized Boolean algebra and the freel -module of a totally ordered integral domain with unit over a generalized Boolean algebra. Extensions of lattice-ordered groups using generalized Boolean algebras are defined and their properties studied.     

SECOND-ORDER BOOLEAN ALGEBRAS

Opgedra aan Prof. Hennie Schutte by geleentheid van sy sestigste verjaarsdag.

Abstract

A Boolean algebra is the algebraic version of a field of sets. The complex algebra C(B) of a Boolean algebra B is defined over the power set of B; it is a field of sets with extra operations. The notion of a second-order Boolean algebra is intended to be the algebraic version of the complex algebra of a Boolean algebra. To this end a representation theorem is proved.     

Eine Charakterisierung der Boole'schen Algebra zu einer co -direkten Zerlegung

In this paper nuclear Boolean Algebras of projections in a locally convex space are considered. This are Boolean Algebras with special continuity properties, which are shared, for instance, by each bounded Boolean Algebra of projections in an ?^∞-space and by the algebra of each equicontinuos spectral measure in a nuclear space. It will be shown that a ?-complete nuclear Boolean Algebra leads to a c_o-direct sum of locally convex spaces and all the projections of the algebra belong to the complete algebra of projections of this c_o-direct partition. On the other hand if in a given locally convex space E there exists a nuclear complete Boolean Algebra of projections which has multiplicity one then each equicontinuos Boolean Algebra of projections in E is nuclear.     

TOPOS BASED SEMANTIC FOR CONSTRUCTIVE LOGIC WITH STRONG NEGATION

The aim of the paper is to show that topoi are useful in the categorial analysis of the constructive logic with strong negation. In any topos ? we can distinguish an object Λ and its truth-arrows such that sets ?(A, Λ) (for any object A) have a Nelson algebra structure. The object Λ is defined by the categorial counterpart of the algebraic FIDEL-VAKARELOV construction. Then it is possible to define the universal quantifier morphism which permits us to make the first order predicate calculus. The completeness theorem is proved using the Kripke-type semantic defined by THOMASON .     

An Alternative Definition of Quantifiers on Four-Valued Łukasiewicz Algebras

An alternative notion of an existential quantifier on four-valued ?ukasiewicz algebras is introduced. The class of four-valued ?ukasiewicz algebras endowed with this existential quantifier determines a variety which is denoted by \(\mathbb {M}_{\frac{2}{3}}\mathbb {L}_4\). It is shown that the alternative existential quantifier is interdefinable with the standard existential quantifier on a four-valued ?ukasiewicz algebra. Some connections between the new existential quantifier and the existential quantifiers defined on bounded distributive lattices and Boolean algebras are given. Finally, a completeness theorem for the monadic four-valued ?ukasiewicz predicate calculus corresponding to the dual of the alternative existential quantifier is proven.     

Products of Commuting Boolean Algebras of Projections and Banach Space Geometry

New criteria and Banach spaces are presented (for example, GL-spacesand Banach spaces with property () that ensure that the Booleanalgebra generated by a pair of bounded, commuting Boolean algebrasof projections is itself bounded. The notion of R-boundednessplays a fundamental role. It is shown that the strong operatorclosure of any R-bounded Boolean algebra of projections is necessarilyBade complete. Also, for a Dedekind -complete Banach latticeE, the Boolean algebra consisting of all band projections inE is R-bounded if and only if E has finite cotype. In this situation,every bounded Boolean algebra of projections in E is R-boundedand has a Bade complete strong closure. 2000 Mathematics SubjectClassification 46B20, 47L10 (primary), 46B42, 47B40, 47B60 (secondary).     

A characterization of MV-algebras free over finite distributive lattices

Mundici has recently established a characterization of free finitely generated MV-algebras similar in spirit to the representation of the free Boolean algebra with a countably infinite set of free generators as any Boolean algebra that is countable and atomless. No reference to universal properties is made in either theorem. Our main result is an extension of Mundici’s theorem to the whole class of MV-algebras that are free over some finite distributive lattice.      

Invariant Ideals and Matsushima's Criterion

Let G be a reductive algebraic group over an algebraically closed field  of characteristic zero and H a closed subgroup of G. Explicit constructions of G-invariant ideals in the algebra [G/H] are given. This allows to obtain an elementary proof of Matsushima's criterion: the homogeneous space G/H is an affine variety if and only if H is reductive.     

On functional specification of latin squares

This paper studies functional methods for specification of Latin squares over the sets of n-dimensional Boolean vectors, n-dimensional vectors over an arbitrary finite prime field and over an arbitrary finite Abelian group. In conclusion, a method for constructing classes of nongroup Latin squares is presented.     

The strong closure of $\sigma$-complete Boolean algebras of projections

A result of T. A. Gillespie implies that the strong operator closure of any abstractly s\sigma -complete Boolean algebra of projections in a Banach space X which does not contain a copy of c₀ is Bade complete. It is shown that the same conclusion is valid for another (extensive) class of Banach spaces X, namely those which are weakly compactly generated. As a consequence, it follows that a Boolean algebra of projections in a separable Banach space is abstractly s\sigma -complete iff it is abstractly complete. It is also shown that a Banach space X has the property that the strong closure of every abstractly complete Boolean algebra of projections in X is Bade complete iff X does not contain a copy of l^￥\ell ^\infty \!.     

On vector lattices of elementary Carathéodory functions

In this paper we deal with the vector lattice C(B) of all elementary Carathéodory functions corresponding to a generalized Boolean algebra B.This work was supported by grant VEGA 2/1131/21.     

Permutation Groups, a Related Algebra and a Conjecture of Cameron

We consider the permutation group algebra defined by Cameron and show that if the permutation group has no finite orbits, then no homogeneous element of degree one is a zero-divisor of the algebra. We proceed to make a conjecture which would show that the algebra is an integral domain if, in addition, the group is oligomorphic. We go on to show that this conjecture is true in certain special cases, including those of the form H Wr S and H Wr A, and show that in the oligormorphic case, the algebras corresponding to these special groups are polynomial algebras. In the H Wr A case, the algebra is related to the shuffle algebra of free Lie algebra theory.     

On <Emphasis Type="Italic">α</Emphasis>-complete retracts of specker lattice ordered groups

Let α be a cardinal. The notion of α-complete retract of a Boolean algebra has been studied by Dwinger. Specker lattice ordered groups were investigated by Conrad and Darnel. Assume that G is a Specker lattice ordered group generated by a Boolean algebra B(G). The notion of α-complete retract of G can be defined analogously as in the case of Boolean algebras. In the present paper we deal with the relations between α-complete retracts of G and α-complete retracts of B(G).