Displaying 21 – 40 of 55

Showing per page

Herbrand consistency and bounded arithmetic

Zofia Adamowicz (2002)

Fundamenta Mathematicae

We prove that the Gödel incompleteness theorem holds for a weak arithmetic Tₘ = IΔ₀ + Ωₘ, for m ≥ 2, in the form Tₘ ⊬ HCons(Tₘ), where HCons(Tₘ) is an arithmetic formula expressing the consistency of Tₘ with respect to the Herbrand notion of provability. Moreover, we prove T H C o n s I ( T ) , where H C o n s I is HCons relativised to the definable cut Iₘ of (m-2)-times iterated logarithms. The proof is model-theoretic. We also prove a certain non-conservation result for Tₘ.

If it looks and smells like the reals...

Franklin Tall (2000)

Fundamenta Mathematicae

Given a topological space ⟨X,T⟩ ∈ M, an elementary submodel of set theory, we define X M to be X ∩ M with topology generated by U ∩ M:U ∈ T ∩ M. We prove that if X M is homeomorphic to ℝ, then X = X M . The same holds for arbitrary locally compact uncountable separable metric spaces, but is independent of ZFC if “local compactness” is omitted.

More reflections on compactness

Lúcia R. Junqueira, Franklin D. Tall (2003)

Fundamenta Mathematicae

We consider the question of when X M = X , where X M is the elementary submodel topology on X ∩ M, especially in the case when X M is compact.

On embedding models of arithmetic of cardinality ℵ₁ into reduced powers

Juliette Kennedy, Saharon Shelah (2003)

Fundamenta Mathematicae

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 ω / D , where D is any regular filter on ω.

On regular interstices and selective types in countable arithmetically saturated models of Peano Arithmetic

Teresa Bigorajska, Henryk Kotlarski, James Schmerl (1998)

Fundamenta Mathematicae

We continue the earlier research of [1]. In particular, we work out a class of regular interstices and show that selective types are realized in regular interstices. We also show that, contrary to the situation above definable elements, the stabilizer of an element inside M(0) whose type is selective need not be maximal.

On the Leibniz-Mycielski axiom in set theory

Ali Enayat (2004)

Fundamenta Mathematicae

Motivated by Leibniz’s thesis on the identity of indiscernibles, Mycielski introduced a set-theoretic axiom, here dubbed the Leibniz-Mycielski axiom LM, which asserts that for each pair of distinct sets x and y there exists an ordinal α exceeding the ranks of x and y, and a formula φ(v), such that ( V α , ) satisfies φ(x) ∧¬ φ(y). We examine the relationship between LM and some other axioms of set theory. Our principal results are as follows: 1. In the presence of ZF, the following are equivalent: (a) LM. (b)...

Currently displaying 21 – 40 of 55