Displaying similar documents to “Arithmetical transfinite induction and hierarchies of functions”

On a problem of Steve Kalikow

Saharon Shelah (2000)

Fundamenta Mathematicae

Similarity:

The Kalikow problem for a pair (λ,κ) of cardinal numbers,λ > κ (in particular κ = 2) is whether we can map the family of ω-sequences from λ to the family of ω-sequences from κ in a very continuous manner. Namely, we demand that for η,ν ∈ ω we have: η, ν are almost equal if and only if their images are. We show consistency of the negative answer, e.g., for ω but we prove it for smaller cardinals. We indicate a close connection with the free subset property and its variants. ...

Bertrand’s Ballot Theorem

Karol Pąk (2014)

Formalized Mathematics

Similarity:

In this article we formalize the Bertrand’s Ballot Theorem based on [17]. Suppose that in an election we have two candidates: A that receives n votes and B that receives k votes, and additionally n ≥ k. Then this theorem states that the probability of the situation where A maintains more votes than B throughout the counting of the ballots is equal to (n − k)/(n + k). This theorem is item #30 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/. ...

Stability of n -Bit Generalized Full Adder Circuits (GFAs). Part II

Katsumi Wasaki (2008)

Formalized Mathematics

Similarity:

We continue to formalize the concept of the Generalized Full Addition and Subtraction circuits (GFAs), define the structures of calculation units for the Redundant Signed Digit (RSD) operations, then prove its stability of the calculations. Generally, one-bit binary full adder assumes positive weights to all of its three binary inputs and two outputs. We define the circuit structure of two-types n-bit GFAs using the recursive construction to use the RSD arithmetic logical units that...

Recursive expansions

C. Ash, J. Knight (1994)

Fundamenta Mathematicae

Similarity:

Let A be a recursive structure, and let ψ be a recursive infinitary Π 2 sentence involving a new relation symbol. The main result of the paper gives syntactical conditions which are necessary and sufficient for every recursive copy of A to have a recursive expansion to a model of ψ, provided A satisfies certain decidability conditions. The decidability conditions involve a notion of rank. The main result is applied to prove some earlier results of Metakides-Nerode and Goncharov. In these...

On extending automorphisms of models of Peano Arithmetic

Roman Kossak, Henryk Kotlarski (1996)

Fundamenta Mathematicae

Similarity:

Continuing the earlier research in [10] we give some information on extending automorphisms of models of PA to end extensions and cofinal extensions.

Primitive minima of positive definite quadratic forms

Aloys Krieg (1993)

Acta Arithmetica

Similarity:

The main purpose of the reduction theory is to construct a fundamental domain of the unimodular group acting discontinuously on the space of positive definite quadratic forms. This fundamental domain is for example used in the theory of automorphic forms for GLₙ (cf. [11]) or in the theory of Siegel modular forms (cf. [1], [4]). There are several ways of reduction, which are usually based on various minima of the quadratic form, e.g. the Korkin-Zolotarev method (cf. [10], [3]),...