The completeness theorem for infinitary logic

1972 ◽  
Vol 37 (1) ◽  
pp. 31-34 ◽  
Author(s):  
Richard Mansfield
Keyword(s):  
Boolean Algebra ◽  
Completeness Theorem ◽  
Complete Boolean Algebra ◽  
Infinitary Logic ◽  
Constant Symbol ◽  
Truth Values ◽  
Truth Function ◽  
Universal Quantification ◽  
Image Position ◽  
Extended Notion

It will be proven that a set of sentences of infinitary logic is satisfiable iff it is proof theoretically consistent. Since this theorem is known to be false, it must be quickly added that an extended notion of model is being used; truth values may be taken from an arbitrary complete Boolean algebra. We shall give a Henkin style proof of this result which generalizes easily to Boolean valued sets of sentences.For each infinite candinal number κ the language Lκ is built up from a set of relation symbols together with a constant symbol cα and a variable υα for each α in κ. It contains atomic formulas and is closed under the following rules:(1) If Γ is a set of formulas of power < κ ∧ Γ is a set of formulas.(2) If φ is a formula, ¬ φ is also.(3) If φ is a formula and A Is a subset of κ of power < κ then Aφ is a formula.∧Γ is meant to be the conjunction of all the formulas in Γ, while Aφ is the universal quantification of all the variables υα for α in A. We let C denote the set of constant symbols in Lκ, the parameter κ must be discovered from the context.A model is identified with its truth function. Thus a model is a function mapping the sentences of Lκ into a complete Boolean algebra which satisfies the following conditions:

Complete Boolean ultraproducts

1987 ◽  
Vol 52 (2) ◽  
pp. 530-542
Author(s):  
R. Michael Canjar
Keyword(s):  
Boolean Algebra ◽  
Regular Cardinal ◽  
Complete Boolean Algebra ◽  
Full Structure ◽  
Truth Value ◽  
Image Position

Throughout this paper, B will always be a Boolean algebra and Γ an ultrafilter on B. We use + and Σ for the Boolean join operation and · and Π for the Boolean meet.κ is always a regular cardinal. C(κ) is the full structure of κ, the structure with universe κ and whose functions and relations consist of all unitary functions and relations on κ. κB is the collection of all B-valued names for elements of κ. We use symbols f, g, h for members of κB. Formally an element f ∈ κB is a mapping κ → B with the properties that Σα∈κf(α) = 1B and that f(α) · f(β) = 0B whenever α ≠ β. We view f(α) as the Boolean-truth value indicating the extent to which the name f is equal to α, and we will hereafter write ∥f = α∥ for f(α). For every α ∈ κ there is a canonical name fα ∈ κB which has the property that ∥fα = α∥ = 1. Hereafter we identify α and fα.If B is a κ+-complete Boolean algebra and Γ is an ultrafilter on B, then we may define the Boolean ultraproduct C(κ)B/Γ in the following manner. If ϕ(x0, x1, …, xn) is a formula of Lκ, the language for C(κ) (which has symbols for all finitary functions and relations on κ), and f0, f1, …, fn−1 are elements of κB then we define the Boolean-truth value of ϕ(f0, f1, …, fn−1) as

A Boolean ultrapower which is not an ultrapower

1976 ◽  
Vol 41 (1) ◽  
pp. 245-249 ◽  
Author(s):  
Bernd Koppelberg ◽  
Sabine Koppelberg
Keyword(s):  
Boolean Algebra ◽  
Set Theory ◽  
Natural Generalization ◽  
Negative Answer ◽  
Complete Boolean Algebra ◽  
Image Position ◽  
Models Of Set Theory

Several people have independently been studying Boolean ultrapowers recently; see for example [2], [3], [4], [6]. Boolean ultrapowers are a quite natural generalization of the well-known usual ultrapowers, but it seemed to be unknown whether every Boolean ultrapower is isomorphic to an ultrapower. We give a negative answer to that question. We further show that a Boolean ultrapower by an ℵ1-regular ultrafilter need not be ℵ2-universal, i.e. that Theorem 4.3.12 of [1] does not hold for Boolean ultrapowers.Let B be a complete Boolean algebra (we identify the algebra with its underlying set), whose operations are denoted by +, ·, −, 0, 1, Σ, Π Let be a structure for some language ℒ. For those who are familiar with Boolean-valued models of set theory, the B-valued model may be described by its underlying setandif R is an n-place relation in ℒ or equality, its interpretation in , u1 … un Є M(B).

scholarly journals WEAK DISTRIBUTIVITY IMPLYING DISTRIBUTIVITY

2016 ◽  
Vol 81 (2) ◽  
pp. 711-717
Author(s):  
DAN HATHAWAY
Keyword(s):  
Boolean Algebra ◽  
Complete Boolean Algebra ◽  
Infinite Cardinal ◽  
Similar Argument ◽  
Weakly Compact ◽  
Compact Cardinal ◽  
Image Position ◽  
Weakly Compact Cardinal

AbstractLet $B$ be a complete Boolean algebra. We show that if λ is an infinite cardinal and $B$ is weakly (λω, ω)-distributive, then $B$ is (λ, 2)-distributive. Using a similar argument, we show that if κ is a weakly compact cardinal such that $B$ is weakly (2κ, κ)-distributive and $B$ is (α, 2)-distributive for each α < κ, then $B$ is (κ, 2)-distributive.

M-structure in Banach spaces

1967 ◽  
Vol 63 (3) ◽  
pp. 613-629 ◽  
Author(s):  
F. Cunningham
Keyword(s):  
Banach Space ◽  
Boolean Algebra ◽  
Banach Spaces ◽  
Measure Space ◽  
Complete Boolean Algebra ◽  
Ordinary Sense ◽  
One Dimensional ◽  
Algebra 2 ◽  
Image Position ◽  
Vector Valued

L-structure in a Banach space X was defined in (3) by L-projections, that is projections P satisfyingfor all x ∈ X. The significance of L-structure is shown by the following facts: (1) All L-projections on X commute and together form a complete Boolean algebra. (2) X can be isometrically represented as a vector-valued L1 on a measure space constructed from the Boolean algebra of its L-projections (2). (3) L1-spaces in the ordinary sense are characterized among Banach spaces by properties equivalent to having so many L-projections that the representation in (2) is everywhere one-dimensional.

Locally Flat Vector Lattices

1980 ◽  
Vol 32 (4) ◽  
pp. 924-936 ◽  
Author(s):  
Marlow Anderson
Keyword(s):  
Boolean Algebra ◽  
Essential Extension ◽  
Boolean Algebras ◽  
Complete Boolean Algebra ◽  
Lattice Ordered Group ◽  
Ordered Group ◽  
Vector Lattices ◽  
Trivial Intersection ◽  
Image Position

Let G be a lattice-ordered group (l-group). If X ⊆ G, then letThen X’ is a convex l-subgroup of G called a polar. The set P(G) of all polars of G is a complete Boolean algebra with ‘ as complementation and set-theoretic intersection as meet. An l-subgroup H of G is large in G (G is an essential extension of H) if each non-zero convex l-subgroup of G has non-trivial intersection with H. If these l-groups are archimedean, it is enough to require that each non-zero polar of G meets H. This implies that the Boolean algebras of polars of G and H are isomorphic. If K is a cardinal summand of G, then K is a polar, and we write G = K⊞K'.

Saturated ideals

1978 ◽  
Vol 43 (1) ◽  
pp. 65-76 ◽  
Author(s):  
Kenneth Kunen
Keyword(s):  
Lower Bound ◽  
Boolean Algebra ◽  
Complete Boolean Algebra ◽  
Historical Survey ◽  
Standard Notation ◽  
Image Position ◽  
Consistency Proofs

In this paper, we give consistency proofs for the existence of a κ-saturated ideal on an inaccessible κ, and for the existence of an ω2-saturated ideal on ω1. We also include an historical survey outlining other known results on saturated ideals.§1. Forcing. We assume that the reader is familiar with the usual techniques in forcing and Boolean-valued models (see Jech [3] or Rosser [11]), so we shall just specify here some of the less standard notation.“cBa” abbreviates “complete Boolean algebra”.If P (= ‹P, <›) is a notion of forcing, is the associated cBa. We write VP for .Notions like κ-closed, κ-complete, etc. always mean < κ. Thus, P is κ-closed iff every decreasing chain of length less than κ has a lower bound, and a Boolean algebra is κ-complete iff sups of subsets of of cardinality less than κ always exist.If is a cBa, x̌ is the object in representing x in V. In many cases, especially with ordinals, the ̌ is dropped. V̌ is the Boolean-valued class representing V — i.e.,

The noncommutativity of random and generic extensions

1983 ◽  
Vol 48 (4) ◽  
pp. 1008-1012 ◽  
Author(s):  
J.K. Truss
Keyword(s):  
Boolean Algebra ◽  
Complete Boolean Algebra ◽  
Random Real ◽  
Real Numbers ◽  
Combinatorial Properties ◽  
Transitive Model ◽  
Elementary Argument ◽  
Image Position ◽  
Generic Extensions ◽  
Rule Out

Throughout, M will denote a transitive model of ZFC. Using the terms “random” and “generic” in the sense of [1], one may ask whether there can exist real numbers x and y such that x is generic over M[y] and y is random over M[x]. We shall see below by an elementary argument that this is not possible, and so, in a crude sense at least, random and generic extensions do not commute. This does not however rule out the possibility of a weaker commutativity. Let B be the complete Boolean algebra (in M) for adjoining a random real followed by a generic real and C be the complete Boolean algebra for adjoining a generic real followed by a random real. Then it still might be the case that B and C are isomorphic. This also fails, though, and we shall prove this by establishing the following combinatorial properties of MB and MC:butIn addition this will show that C cannot be embedded as a complete subalgebra of B.The property satisfied by B is reminiscent of calibre ℵ1 [2]. B would have calibre if we could replace “infinite” by “uncountable”, and this occurs if Martin's Axiom holds in M. To obtain the nonisomorphism of B and C in general necessitated looking at the weaker property.

On the Representation of Boolean Algebras

1962 ◽  
Vol 5 (1) ◽  
pp. 37-41 ◽  
Author(s):  
Günter Bruns
Keyword(s):  
Boolean Algebra ◽  
Boolean Algebras ◽  
Two Systems ◽  
Image Position

Let B be a Boolean algebra and let ℳ and n be two systems of subsets of B, both containing all finite subsets of B. Let us assume further that the join ∨M of every set M∊ℳ and the meet ∧N of every set N∊n exist. Several authors have treated the question under which conditions there exists an isomorphism φ between B and a field δ of sets, satisfying the conditions:

Sign in / Sign up

Export Citation Format

Share Document