A recursion-theoretic characterization of instances of $ΒΣ_n$ provable in $П_{n+1}(N)$

Zofia Adamowicz

Displaying similar documents to “A recursion-theoretic characterization of instances of $Β Σ_{n}$ provable in $П_{n + 1} (N)$ ”

A Hanf number for saturation and omission

John T. Baldwin, Saharon Shelah (2011)

Fundamenta Mathematicae

Similarity:

Suppose t = (T,T₁,p) is a triple of two countable theories T ⊆ T₁ in vocabularies τ ⊂ τ₁ and a τ₁-type p over the empty set. We show that the Hanf number for the property ’there is a model M₁ of T₁ which omits p, but M₁ ↾ τ is saturated’ is essentially equal to the Löwenheim number of second order logic. In Section 4 we make exact computations of these Hanf numbers and note some distinctions between ’first order’ and ’second order quantification’. In particular, we show that if κ is...

On normalization of proofs in set theory

Lars Hallnäs

Similarity:

CONTENTSIntroduction..............................................................................................................................................5I. Naive set theory.....................................................................................................................................61. The formal system................................................................................................................................62. Inversion and reduction...

Provident sets and rudimentary set forcing

A. R. D. Mathias (2015)

Fundamenta Mathematicae

Similarity:

Using the theory of rudimentary recursion and provident sets expounded in [MB], we give a treatment of set forcing appropriate for working over models of a theory PROVI which may plausibly claim to be the weakest set theory supporting a smooth theory of set forcing, and of which the minimal model is Jensen’s $J_{ω}$ . Much of the development is rudimentary or at worst given by rudimentary recursions with parameter the notion of forcing under consideration. Our development eschews the power...

A characterization of almost continuity and weak continuity

Chrisostomos Petalas, Theodoros Vidalis (2004)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Similarity:

It is well known that a function $f$ from a space $X$ into a space $Y$ is continuous if and only if, for every set $K$ in $X$ the image of the closure of $K$ under $f$ is a subset of the closure of the image of it. In this paper we characterize almost continuity and weak continuity by proving similar relations for the subsets $K$ of $X$ .

The gap between I₃ and the wholeness axiom

Paul Corazza (2003)

Fundamenta Mathematicae

Similarity:

∃κI₃(κ) is the assertion that there is an elementary embedding $i : V_{λ} \to V_{λ}$ with critical point below λ, and with λ a limit. The Wholeness Axiom, or WA, asserts that there is a nontrivial elementary embedding j: V → V; WA is formulated in the language ∈,j and has as axioms an Elementarity schema, which asserts that j is elementary; a Critical Point axiom, which asserts that there is a least ordinal moved by j; and includes every instance of the Separation schema for j-formulas. Because no instance...

On $ω^{2}$ -saturated families

Lajos Soukup (1991)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

If there is no inner model with measurable cardinals, then for each cardinal $λ$ there is an almost disjoint family $𝒜_{λ}$ of countable subsets of $λ$ such that every subset of $λ$ with order type $\geq ω^{2}$ contains an element of $𝒜_{λ}$ .

The almost Daugavet property and translation-invariant subspaces

Simon Lücking (2014)

Colloquium Mathematicae

Similarity:

Let G be a metrizable, compact abelian group and let Λ be a subset of its dual group Ĝ. We show that $C_{Λ} (G)$ has the almost Daugavet property if and only if Λ is an infinite set, and that $L ¹_{Λ} (G)$ has the almost Daugavet property if and only if Λ is not a Λ(1) set.

Set theories incorporating Hilbert's ε-symbol

T. B. Flannagan

Similarity:

CONTENTS§ 1. Introduction ............................................................................................................ 5§ 2. The ε-calculus for є............................................................................................ 6§ 3. Reflection principles in e-set theories.............................................................. 6§ 4. [E]-elementary chains.......................................................................................... 11§ 5. Forcing...

Comparing the closed almost disjointness and dominating numbers

Dilip Raghavan, Saharon Shelah (2012)

Fundamenta Mathematicae

Similarity:

We prove that if there is a dominating family of size ℵ₁, then there are ℵ₁ many compact subsets of $ω^{ω}$ whose union is a maximal almost disjoint family of functions that is also maximal with respect to infinite partial functions.

A note on an approximative scheme of finding almost homoclinic solutions for Newtonian systems

Robert Krawczyk (2014)

Banach Center Publications

Similarity:

In this work we will be concerned with the existence of almost homoclinic solutions for a Newtonian system $q ̈ + \nabla_{q} V (t, q) = f (t)$ , where t ∈ ℝ, q ∈ ℝⁿ. It is assumed that a potential V: ℝ × ℝⁿ → ℝ is C¹-smooth and its gradient map $\nabla_{q} V : ℝ \times ℝ ⁿ \to ℝ ⁿ$ is bounded with respect to t. Moreover, a forcing term f: ℝ → ℝⁿ is continuous, bounded and square integrable. We will show that the approximative scheme due to J. Janczewska (see [J2]) for a time periodic potential extends to our case.

Constructibility in Ackermann's set theory

C. Alkor

Similarity:

CONTENTSIntroduction......................... 5Section I. Preliminaries............ 6 § 1. Notation..................... 6 § 2. Ackermann’s set theory and some extensions................. 7 § 3. Absoluteness............................................... 8 § 4. Ordinals................................................... 9 § 5. Reflection principles...................................... 10Section 2. The usual notion of constructibility.............. 11 § 1. General considerations about...

Axioms weaker then $R_{0}$

J. Guia (1984)

Matematički Vesnik

Similarity:

Induced almost continuous functions on hyperspaces

Alejandro Illanes (2006)

Colloquium Mathematicae

Similarity:

For a metric continuum X, let C(X) (resp., $2^{X}$ ) be the hyperspace of subcontinua (resp., nonempty closed subsets) of X. Let f: X → Y be an almost continuous function. Let C(f): C(X) → C(Y) and $2^{f} : 2^{X} \to 2^{Y}$ be the induced functions given by $C (f) (A) = c l_{Y} (f (A))$ and $2^{f} (A) = c l_{Y} (f (A))$ . In this paper, we prove that: • If $2^{f}$ is almost continuous, then f is continuous. • If C(f) is almost continuous and X is locally connected, then f is continuous. • If X is not locally connected, then there exists an almost continuous function f: X → [0,1]...

Uncountable cardinals have the same monadic ∀₁¹ positive theory over large sets

Athanassios Tzouvaras (2004)

Fundamenta Mathematicae

Similarity:

We show that uncountable cardinals are indistinguishable by sentences of the monadic second-order language of order of the form (∀X)ϕ(X) and (∃X)ϕ(X), for ϕ positive in X and containing no set-quantifiers, when the set variables range over large (= cofinal) subsets of the cardinals. This strengthens the result of Doner-Mostowski-Tarski [3] that (κ,∈), (λ,∈) are elementarily equivalent when κ, λ are uncountable. It follows that we can consistently postulate that the structures $(2^{κ}, {[2^{κ}]}^{> κ}, <)$ , $(2^{λ}, {[2^{λ}]}^{> λ}, <)$ are...

Almost continuous functions on $I^{n}$

Kenneth Kellum (1973)

Fundamenta Mathematicae

Similarity:

Maximal almost disjoint families of functions

Dilip Raghavan (2009)

Fundamenta Mathematicae

Similarity:

We study maximal almost disjoint (MAD) families of functions in $ω^{ω}$ that satisfy certain strong combinatorial properties. In particular, we study the notions of strongly and very MAD families of functions. We introduce and study a hierarchy of combinatorial properties lying between strong MADness and very MADness. Proving a conjecture of Brendle, we show that if $c o v (ℳ) <_{}$ , then there no very MAD families. We answer a question of Kastermans by constructing a strongly MAD family from = . Next, we...

The number of $L_{\infty κ}$ -equivalent nonisomorphic models for κ weakly compact

Saharon Shelah, Pauli Vaisanen (2002)

Fundamenta Mathematicae

Similarity:

For a cardinal κ and a model M of cardinality κ let No(M) denote the number of nonisomorphic models of cardinality κ which are $L_{\infty, κ}$ -equivalent to M. We prove that for κ a weakly compact cardinal, the question of the possible values of No(M) for models M of cardinality κ is equivalent to the question of the possible numbers of equivalence classes of equivalence relations which are Σ¹₁-definable over $V_{κ}$ . By [SV] it is possible to have a generic extension where the possible numbers of equivalence...

Characterizing the powerset by a complete (Scott) sentence

Ioannis Souldatos (2013)

Fundamenta Mathematicae

Similarity:

This paper is part II of a study on cardinals that are characterizable by a Scott sentence, continuing previous work of the author. A cardinal κ is characterized by a Scott sentence $ϕ_{ℳ}$ if $ϕ_{ℳ}$ has a model of size κ, but no model of size κ⁺. The main question in this paper is the following: Are the characterizable cardinals closed under the powerset operation? We prove that if $ℵ_{β}$ is characterized by a Scott sentence, then $2^{ℵ_{β + β ₁}}$ is (homogeneously) characterized by a Scott sentence, for all 0 <...

Quantifier elimination, valuation property and preparation theorem in quasianalytic geometry via transformation to normal crossings

Krzysztof Jan Nowak (2009)

Annales Polonici Mathematici

Similarity:

This paper investigates the geometry of the expansion $_{Q}$ of the real field ℝ by restricted quasianalytic functions. The main purpose is to establish quantifier elimination, description of definable functions by terms, the valuation property and preparation theorem (in the sense of Parusiński-Lion-Rolin). To this end, we study non-standard models of the universal diagram T of $_{Q}$ in the language ℒ augmented by the names of rational powers. Our approach makes no appeal to the Weierstrass...

On the maximal Fejér operator for double Fourier series of functions in Hardy spaces

Ferenc Móricz (1995)

Studia Mathematica

Similarity:

We consider the Fejér (or first arithmetic) means of double Fourier series of functions belonging to one of the Hardy spaces $H^{(1, 0)} (^{2})$ , $H^{(0, 1)} (^{2})$ , or $H^{(1, 1)} (^{2})$ . We prove that the maximal Fejér operator is bounded from $H^{(1, 0)} (^{2})$ or $H^{(0, 1)} (^{2})$ into weak- $L^{1} (^{2})$ , and also bounded from $H^{(1, 1)} (^{2})$ into $L^{1} (^{2})$ . These results extend those by Jessen, Marcinkiewicz, and Zygmund, which involve the function spaces $L^{1} l o g^{+} L (^{2})$ , $L^{1} {(l o g^{+} L)}^{2} (^{2})$ , and $L^{μ} (^{2})$ with 0 < μ < 1, respectively. We establish analogous results for the maximal conjugate Fejér operators. On closing, we formulate...

Completeness properties of classical theories of finite type and the normal form theorem

Peter Päppinghaus

Similarity:

CONTENTSIntroduction........................................................................................................................................................................................................................50. Terminology and preliminaries......................................................................................................................................................................................121. The extent of cut elimination by...

Displaying similar documents to “A recursion-theoretic characterization of instances of Β Σ n provable in П n + 1 ( N ) ”

Displaying similar documents to “A recursion-theoretic characterization of instances of $Β Σ_{n}$ provable in $П_{n + 1} (N)$ ”