Tensor products of polyadic algebras

1963 ◽  
Vol 28 (3) ◽  
pp. 177-200 ◽  
Author(s):  
Aubert Daigneault
Keyword(s):  
Boolean Algebra ◽  
Algebraic Logic ◽  
Algebraic Structures ◽  
Locally Finite ◽  
Elementary Equivalence ◽  
First Order ◽  
Polyadic Algebras ◽  
Logical Concept ◽  
Algebraic Treatment ◽  
Relational Systems

A basic concept of the theory of models is that of elementary equivalence of similar relational systems: two such systems are said to be elementarily equivalent if they satisfy the same first-order statements or, in other words, if they have the same (first-order) complete theory. It is possible to reformulate this notion of elementary equivalence of systems within the framework of algebraic logic by replacing theories by algebraic structures derived from them or more directly from the systems which are models of these theories. To any such theory T (or model of it), is indeed associated a locally finite polyadic algebra with equality, the underlying Boolean algebra of which is simply the well-known Tarski-Lindenbaum algebra of the theory. It is not hard to prove (see Section 6.1) that two systems are elementarily equivalent iff (i.e. if and only if) they have isomorphic polyadic. algebras. The possibility of replacing theories by algebraic structures and of reducing the purely logical concept of elementary equivalence to the algebraic one of isomorphism can be exploited to give a purely algebraic treatment of model-theoretic problems and suggests natural questions concerning these structures. The present paper illustrates that possibility.

On the elementary equivalence of automorphism groups of Boolean algebras; downward Skolem Löwenheim theorems and compactness of related quantifiers

1980 ◽  
Vol 45 (2) ◽  
pp. 265-283 ◽  
Author(s):  
Matatyahu Rubin ◽  
Saharon Shelah
Keyword(s):  
Boolean Algebra ◽  
Automorphism Groups ◽  
Order Logic ◽  
Boolean Algebras ◽  
First Order Logic ◽  
Elementary Equivalence ◽  
First Order ◽  
Finite Models ◽  
Countably Compact

AbstractTheorem 1. (◊ℵ1,) If B is an infinite Boolean algebra (BA), then there is B1, such that ∣ Aut (B1) ≤∣B1∣ = ℵ1 and 〈B1, Aut (B1)〉 ≡ 〈B, Aut(B)〉.Theorem 2. (◊ℵ1) There is a countably compact logic stronger than first-order logic even on finite models.This partially answers a question of H. Friedman. These theorems appear in §§1 and 2.Theorem 3. (a) (◊ℵ1) If B is an atomic ℵ-saturated infinite BA, Ψ Є Lω1ω and 〈B, Aut (B)〉 ⊨Ψ then there is B1, Such that ∣Aut(B1)∣ ≤ ∣B1∣ =ℵ1, and 〈B1, Aut(B1)〉⊨Ψ. In particular if B is 1-homogeneous so is B1. (b) (a) holds for B = P(ω) even if we assume only CH.

Copeland algebras

1972 ◽  
Vol 37 (4) ◽  
pp. 646-656 ◽  
Author(s):  
Daniel B. Demaree
Keyword(s):  
Predicate Logic ◽  
Algebraic Logic ◽  
Boolean Algebras ◽  
Primary Concern ◽  
Cylindric Algebras ◽  
First Order ◽  
Polyadic Algebras ◽  
Algebraic Setting ◽  
Finite Set ◽  
Natural Way

It is well known that the laws of logic governing the sentence connectives—“and”, “or”, “not”, etc.—can be expressed by means of equations in the theory of Boolean algebras. The task of providing a similar algebraic setting for the full first-order predicate logic is the primary concern of algebraic logicians. The best-known efforts in this direction are the polyadic algebras of Halmos (cf. [2]) and the cylindric algebras of Tarski (cf. [3]), both of which may be described as Boolean algebras with infinitely many additional operations. In particular, there is a primitive operator, cκ, corresponding to each quantification, ∃υκ. In this paper we explore a version of algebraic logic conceived by A. H. Copeland, Sr., and described in [1], which has this advantage: All operators are generated from a finite set of primitive operations.Following the theory of cylindric algebras, we introduce, in the natural way, the classes of Copeland set algebras (SCpA), representable Copeland algebras (RCpA), and Copeland algebras of formulas. Playing a central role in the discussion is the set, Γ, of all equations holding in every set algebra. The reason for this is that the operations in a set algebra reflect the notion of satisfaction of a formula in a model, and hence an equation expresses the fact that two formulas are satisfied by the same sequences of objects in the model. Thus to say that an equation holds in every set algebra is to assert that a certain pair of formulas are logically equivalent.

Paul R. Halmos. The basic concepts of algebraic logic. Algebraic logic, by Paul R. Halmos, Chelsea Publishing Company, New York 1962, pp. 9–33. - Paul R. Halmos. Algebraic logic, I. Monadic Boolean algebras. Algebraic logic, by Paul R. Halmos, Chelsea Publishing Company, New York 1962, pp. 37–72. - Paul R. Halmos. Algebraic logic, II. Homogeneous locally finite polyadic Boolean algebras of infinite degree. Algebraic logic, by Paul R. Halmos, Chelsea Publishing Company, New York 1962, pp. 97–166. - Paul R. Halmos. Algebraic logic, III. Predicates, terms, and operations in polyadic algebras. Algebraic logic, by Paul R. Halmos, Chelsea Publishing Company, New York 1962, pp. 169–209. - Paul R. Halmos. Algebraic logic, IV. Equality in polyadic algebras. Algebraic logic, by Paul R. Halmos, Chelsea Publishing Company, New York 1962, pp. 213–239. - Paul R. Halmos. Polyadic Boolean algebras. Algebraic logic, by Paul R. Halmos, Chelsea Publishing Company, New York 1962, pp. 243–248. - Paul R. Halmos. Predicates, terms, operations, and equality in polyadic Boolean algebras. Algebraic logic, by Paul R. Halmos, Chelsea Publishing Company, New York 1962, pp. 251–257.

1962 ◽  
Vol 27 (4) ◽  
pp. 469-470
Author(s):  
Aubert Daigneault
Keyword(s):  
New York ◽  
Algebraic Logic ◽  
Boolean Algebras ◽  
Publishing Company ◽  
Locally Finite ◽  
Polyadic Algebras ◽  
Infinite Degree ◽  
Basic Concepts

Some model theory for almost real closed fields

1996 ◽  
Vol 61 (4) ◽  
pp. 1121-1152 ◽  
Author(s):  
Françoise Delon ◽  
Rafel Farré
Keyword(s):  
Model Theory ◽  
Residue Field ◽  
Elementary Equivalence ◽  
First Order ◽  
Valuation Rings ◽  
Closed Fields ◽  
Theory Of Fields ◽  
Model Theory Of Fields ◽  
Elementary Inclusion ◽  
Henselian Valuation

AbstractWe study the model theory of fields k carrying a henselian valuation with real closed residue field. We give a criteria for elementary equivalence and elementary inclusion of such fields involving the value group of a not necessarily definable valuation. This allows us to translate theories of such fields to theories of ordered abelian groups, and we study the properties of this translation. We also characterize the first-order definable convex subgroups of a given ordered abelian group and prove that the definable real valuation rings of k are in correspondence with the definable convex subgroups of the value group of a certain real valuation of k.

Some algebraic algebras with Engel unit groups

2019 ◽  
pp. 2150010
Author(s):  
M. H. Bien ◽  
M. Ramezan-Nassab
Keyword(s):  
Multiplicative Group ◽  
Subnormal Subgroup ◽  
Group Algebras ◽  
Algebraic Structures ◽  
Locally Finite ◽  
Division Rings ◽  
Torsion Groups ◽  
Skew Group Algebras ◽  
Subnormal Subgroups

In this paper, we study some algebras [Formula: see text] whose unit groups [Formula: see text] or subnormal subgroups of [Formula: see text] are (generalized) Engel. For example, we show that any generalized Engel subnormal subgroup of the multiplicative group of division rings with uncountable centers is central. Some of algebraic structures of Engel subnormal subgroups of the unit groups of skew group algebras over locally finite or torsion groups are also investigated.

WEAK SOLUTIONS FOR WEAK SINGULARITIES

2002 ◽  
Vol 17 (20) ◽  
pp. 2769-2769
Author(s):  
B. C. NOLAN
Keyword(s):  
Existence And Uniqueness ◽  
Finite Measure ◽  
Generalized Solutions ◽  
Functions Of Bounded Variation ◽  
Field Equations ◽  
Finite Radius ◽  
Locally Finite ◽  
Naked Singularities ◽  
First Order ◽  
Bounded Functions

We revisit the problem of the development of singularities in the gravitational collapse of an inhomogeneous dust sphere. As shown by Yodzis et al1, naked singularities may occur at finite radius where shells of dust cross one another. These singularities are gravitationally weak 2, and it has been claimed that at these singularities, the metric may be written in continuous form 2, with locally L∞ connection coefficients 3. We correct these claims, and show how the field equations may be reformulated as a first order, quasi-linear, non-conservative, non-strictly hyperbolic system. We discuss existence and uniqueness of generalized solutions of this system using bounded functions of bounded variation (BV) 4, where the product of a BV function and the derivative of another BV function may be interpreted as a locally finite measure. The solutions obtained provide a dynamical extension to the future of the singularity.

Some theorems on R-maximal sets and major subsets of recursively enumerable sets

1971 ◽  
Vol 36 (2) ◽  
pp. 193-215 ◽  
Author(s):  
Manuel Lerman
Keyword(s):  
Turing Degrees ◽  
Elementary Equivalence ◽  
Recursive Functions ◽  
Recursively Enumerable ◽  
Recursively Enumerable Sets ◽  
Nonstandard Models ◽  
Relational Systems ◽  
The Relationship ◽  
Models Of Arithmetic

In [5], we studied the relational systems /Ā obtained from the recursive functions of one variable by identifying two such functions if they are equal for all but finitely many х ∈ Ā, where Ā is an r-cohesive set. The relational systems /Ā with addition and multiplication defined pointwise on them, were once thought to be potential candidates for nonstandard models of arithmetic. This, however, turned out not to be the case, as was shown by Feferman, Scott, and Tennenbaum [1]. We showed, letting A and B be r-maximal sets, and letting denote the complement of X, that /Ā and are elementarily equivalent (/Ā ≡ ) if there are r-maximal supersets C and D of A and B respectively such that C and D have the same many-one degree (C =mD). In fact, if A and B are maximal sets, /Ā ≡ if, and only if, A =mB. We wish to study the relationship between the elementary equivalence of /Ā and , and the Turing degrees of A and B.

Theories with finitely many models

1986 ◽  
Vol 51 (2) ◽  
pp. 374-376 ◽  
Author(s):  
Simon Thomas
Keyword(s):  
Natural Number ◽  
Complete Theory ◽  
Elementary Equivalence ◽  
First Order ◽  
Finite Models ◽  
Simple Observation ◽  
Finite Structure ◽  
Order Language ◽  
Complete Theories

If L is a first order language and n is a natural number, then Ln is the set of formulas which only make use of the variables x1,…,xn. While every finite structure is determined up to isomorphism by its theory in L, the same is no longer true in Ln. This simple observation is the source of a number of intriguing questions. For example, Poizat [2] has asked whether a complete theory in Ln which has at least two nonisomorphic finite models must necessarily also have an infinite one. The purpose of this paper is to present some counterexamples to this conjecture.Theorem. For each n ≤ 3 there are complete theories in L2n−2andL2n−1having exactly n + 1 models.In our notation and definitions, we follow Poizat [2]. To test structures for elementary equivalence in Ln, we shall use the modified Ehrenfeucht-Fraïssé games of Immerman [1]. For convenience, we repeat his definition here.Suppose that L is a purely relational language, each of the relations having arity at most n. Let and ℬ be two structures for L. Define the Ln game on and ℬ as follows. There are two players, I and II, and there are n pairs of counters a1, b1, …, an, bn. On each move, player I picks up any of the counters and places it on an element of the appropriate structure.

A note on elementary equivalence of C(K) spaces

1987 ◽  
Vol 52 (2) ◽  
pp. 368-373 ◽  
Author(s):  
S. Heinrich ◽  
C. Ward Henson ◽  
L. C. Moore
Keyword(s):  
Banach Space ◽  
Boolean Algebra ◽  
Banach Spaces ◽  
Compact Hausdorff Space ◽  
Hausdorff Space ◽  
Supremum Norm ◽  
Closed Unit Ball ◽  
Elementary Equivalence ◽  
Bounded Number ◽  
Totally Disconnected

In this paper we give a closer analysis of the elementary properties of the Banach spaces C(K), where K is a totally disconnected, compact Hausdorff space, in terms of the Boolean algebra B(K) of clopen subsets of K. In particular we sharpen a result in [4] by showing that if B(K1) and B(K2) satisfy the same sentences with ≤ n alternations of quantifiers, then the same is true of C(K1) and C(K2). As a consequence we show that for each n there exist C(K) spaces which are elementarily equivalent for sentences with ≤ n quantifier alternations, but which are not elementary equivalent in the full sense. Thus the elementary properties of Banach spaces cannot be determined by looking at sentences with a bounded number of quantifier alternations.The notion of elementary equivalence for Banach spaces which is studied here was introduced by the second author [4] and is expressed using the language of positive bounded formulas in a first-order language for Banach spaces. As was shown in [4], two Banach spaces are elementarily equivalent in this sense if and only if they have isometrically isomorphic Banach space ultrapowers (or, equivalently, isometrically isomorphic nonstandard hulls.)We consider Banach spaces over the field of real numbers. If X is such a space, Bx will denote the closed unit ball of X, Bx = {x ϵ X∣ ∣∣x∣∣ ≤ 1}. Given a compact Hausdorff space K, we let C(K) denote the Banach space of all continuous real-valued functions on K, under the supremum norm. We will especially be concerned with such spaces when K is a totally disconnected compact Hausdorff space. In that case B(K) will denote the Boolean algebra of all clopen subsets of K. We adopt the standard notation from model theory and Banach space theory.

Nonfinitizability of classes of representable cylindric algebras

1969 ◽  
Vol 34 (3) ◽  
pp. 331-343 ◽  
Author(s):  
J. Donald Monk
Keyword(s):  
Predicate Logic ◽  
Infinite Dimension ◽  
Fundamental Result ◽  
Cylindric Algebra ◽  
Cylindric Algebras ◽  
Locally Finite ◽  
First Order ◽  
Alfred Tarski ◽  
Sentential Logic ◽  
Algebraic Counterpart

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.

Sign in / Sign up

Export Citation Format

Share Document