On dense subsets of rational numbers
On determination of a cyclic order
On d-finite tuples in random variable structures
We prove that the d-finite tuples in models of ARV are precisely the discrete random variables. Then, we apply d-finite tuples to the work by Keisler, Hoover, Fajardo, and Sun concerning saturated probability spaces. In particular, we strengthen a result in Keisler and Sun's recent paper.
On d-finiteness in continuous structures
We observe that certain classical results of first order model theory fail in the context of continuous first order logic. We argue that this happens since finite tuples in a continuous structure may behave as infinite tuples in classical model theory. The notion of a d-finite tuple attempts to capture some aspects of the classical finite tuple behaviour. We show that many classical results involving finite tuples are valid in continuous logic upon replacing "finite" with "d-finite". Other results,...
On diamond sequences
On distributive fixed-point expressions
On Distributive Fixed-Point Expressions
For every fixed-point expression e of alternation-depth r, we construct a new fixed-point expression e' of alternation-depth 2 and size . Expression e' is equivalent to e whenever operators are distributive and the underlying complete lattice has a co-continuous least upper bound. We alternation-depth but also w.r.t. the increase in size of the resulting expression.
On divisibility in definable groups
Let ℳ be an o-minimal expansion of a real closed field. It is known that a definably connected abelian group is divisible. We show that a definably compact definably connected group is divisible.
On dot-depth two
On effective presentations of formal concept lattices.
On effective speed-up and long proofs of trivial theorems in formal theories
On elementary cuts in models of arithmetic
On elementary cuts in recursively saturated models of Peano Arithmetic
On elementary equivalence of abelian groups
On embedding models of arithmetic of cardinality ℵ₁ into reduced powers
In the early 1970’s S. Tennenbaum proved that all countable models of PA₁¯ + ∀₁ -Th(ℕ) are embeddable into the reduced product , where ℱ is the cofinite filter. In this paper we show that if M is a model of PA¯ + ∀₁ - Th(ℕ), and |M| = ℵ₁, then M is embeddable into , where D is any regular filter on ω.
On Equational Classes of Algebraic Versions of Logic I.
On equivalence relations second order definable over H(κ)
Let κ be an uncountable regular cardinal. Call an equivalence relation on functions from κ into 2 second order definable over H(κ) if there exists a second order sentence ϕ and a parameter P ⊆ H(κ) such that functions f and g from κ into 2 are equivalent iff the structure ⟨ H(κ), ∈, P, f, g ⟩ satisfies ϕ. The possible numbers of equivalence classes of second order definable equivalence relations include all the nonzero cardinals at most κ⁺. Additionally, the possibilities are closed under unions...
On exact conditionals.
On Existance Of Expansion Of A Complex Function
On existence of expansion of a complex function.