scholarly journals Limit Probabilities for Random Sparse Bit Strings

10.37236/1308 ◽  
1997 ◽  
Vol 4 (1) ◽  
Author(s):  
Katherine St. John
Keyword(s):  
Positive Integer ◽  
Differentiable Function ◽  
Positive Constant ◽  
Linear Order ◽  
Unary Predicate ◽  
First Order ◽  
Infinitely Differentiable Function

Let $n$ be a positive integer, $c$ a real positive constant, and $p(n) = c/n$. Let $U_{n,p}$ be the random unary predicate under the linear order, and $S_c$ the almost sure theory of $U_{n,{c\over n}}$. We show that for every first-order sentence $\phi$: $$ f_{\phi}(c) = \lim_{n\rightarrow\infty}{\Pr}[U_{n,{c\over n}} { has\ property\ } \phi] $$ is an infinitely differentiable function. Further, let $S = \bigcap_c S_c$ be the set of all sentences that are true in every almost sure theory. Then, for every $c>0$, $S_c = S$.

scholarly journals Note on Hypoellipticity of a First Order Linear Partial Differential Operator

1968 ◽  
Vol 32 ◽  
pp. 323-330
Author(s):  
Yoshio Kato
Keyword(s):  
Analytic Function ◽  
Differential Operator ◽  
Differentiable Function ◽  
Partial Differential Operator ◽  
Linear Partial Differential Operator ◽  
Partial Differential ◽  
First Order ◽  
Open Set ◽  
Euclidian Space ◽  
Infinitely Differentiable Function

Let Ω be a domain in the (n + 1)-dimensional euclidian space Rn+1. A linear partial differential operator P with coefficients in C∞(Ω) (resp. in Cω(Ω)) will be termed hypoelliptic (resp. analytic-hypoelliptic) in Ω if a distribution u on Ω (i.e. u ∈ D′(Ω)) is an infinitely differentiable function (resp. an analytic function) in every open set of Ω where Pu is an infinitely differentiable function (resp. an analytic function).

scholarly journals Oscillation Conditions for Difference Equations with a Monotone or Nonmonotone Argument

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
G. M. Moremedi ◽  
I. P. Stavroulakis
Keyword(s):  
Positive Integer ◽  
Difference Equation ◽  
Difference Equations ◽  
Delay Difference Equation ◽  
Real Numbers ◽  
First Order ◽  
All Solutions ◽  
Delay Difference ◽  
Constant Argument

Consider the first-order delay difference equation with a constant argument Δxn+pnxn-k=0,  n=0,1,2,…, and the delay difference equation with a variable argument Δxn+pnxτn=0,  n=0,1,2,…, where p(n) is a sequence of nonnegative real numbers, k is a positive integer, Δx(n)=x(n+1)-x(n), and τ(n) is a sequence of integers such that τ(n)≤n-1 for all n≥0 and limn→∞τ(n)=∞. A survey on the oscillation of all solutions to these equations is presented. Examples illustrating the results are given.

scholarly journals The convolution x-r*xs

1976 ◽  
Vol 17 (1) ◽  
pp. 53-56 ◽  
Author(s):  
B. Fisher
Keyword(s):  
Differentiable Function ◽  
Convolution Of Distributions ◽  
Definition Of ◽  
Image Position ◽  
Infinitely Differentiable Function

In a recent paper [1], Jones extended the definition of the convolution of distributions so that further convolutions could be defined. The convolution w1*w2 of two distributions w1 and w2 was defined as the limit ofithe sequence {wln*w2n}, provided the limit w exists in the sense thatfor all fine functions ф in the terminology of Jones [2], wherew1n(x) = wl(x)τ(x/n), W2n(x) = w2(x)τ(x/n)and τ is an infinitely differentiable function satisfying the following conditions:(i) τ(x) = τ(—x),(ii)0 ≤ τ (x) ≤ l,(iii)τ (x) = l for |x| ≤ ½,(iv) τ (x) = 0 for |x| ≥ 1.

Representation of an infinitely differentiable function as a sum of two functions belonging to quasianalytic classes

1984 ◽  
Vol 35 (6) ◽  
pp. 701-704
Author(s):  
V. G. Khryptun ◽  
B. S. Sikora
Keyword(s):  
Differentiable Function ◽  
Infinitely Differentiable Function

scholarly journals A formalization of programs in first-order logic with a discrete linear order

2016 ◽  
Vol 235 ◽  
pp. 1-25 ◽  
Author(s):  
Fangzhen Lin
Keyword(s):  
Linear Order ◽  
Order Logic ◽  
First Order Logic ◽  
First Order

An improved prenex normal form1

1962 ◽  
Vol 27 (3) ◽  
pp. 317-326 ◽  
Author(s):  
C. C. Chang ◽  
H. Jerome Keisler
Keyword(s):  
Positive Integer ◽  
Predicate Logic ◽  
Atomic Formula ◽  
First Order ◽  
Empty String ◽  
Image Position ◽  
First Order Predicate Logic

Let ℒ be the set of all formulas of a given first order predicate logic (with or without identity). For each positive integer n, let ℒn be the set of all formulas φ in ℒ logically equivalent to a formula of the form where Q is a (possibly empty) string of quantifiers, m is a positive integer, and each αij is either an atomic formula or the negation of an atomic formula.

The diversity of quantifier prefixes

1973 ◽  
Vol 38 (1) ◽  
pp. 79-85 ◽  
Author(s):  
H. Jerome Keisler ◽  
Wilbur Walkoe
Keyword(s):  
Positive Integer ◽  
Analogous Result ◽  
Predicate Logic ◽  
Finite Sequence ◽  
Arithmetical Hierarchy ◽  
First Order ◽  
Free Variables ◽  
The Standard Model ◽  
Image Position ◽  
Identity Symbol

The Arithmetical Hierarchy Theorem of Kleene [1] states that in the complete theory of the standard model of arithmetic there is for each positive integer r a Σr0 formula which is not equivalent to any Πr0 formula, and a Πr0 formula which is not equivalent to any Πr0 formula. A Πr0 formula is a formula of the formwhere φ has only bounded quantifiers; Πr0 formulas are defined dually.The Linear Prefix Theorem in [3] is an analogous result for predicate logic. Consider the first order predicate logic L with identity symbol, countably many n-placed relation symbols for each n, and no constant or function symbols. A prefix is a finite sequenceof quantifier symbols ∃ and ∀, for example ∀∃∀∀∀∃. By a Q formula we mean a formula of L of the formwhere v1, …, vr are distinct variables and φ has no quantifiers. A sentence is a formula with no free variables. The Linear Prefix Theorem is as follows.Linear Prefix Theorem. Let Q and q be two different prefixes of the same length r. Then there is a Q sentence which is not logically equivalent to any q sentence.Moreover, for each s there is a Q formula with s free variables which is not logically equivalent to any q formula with s free variables.For example, there is an ∀∃∀∀∀∃ sentence which is not logically equivalent to any ∀∃∃∀∀∃ sentence, and vice versa. Recall that in arithmetic two consecutive ∃'s or ∀'s can be collapsed; for instance all ∀∃∀∀∀∃ and ∀∃∃∀∀∃ formulas are logically equivalent to Π40 formulas. But the Linear Prefix Theorem shows that in predicate logic the number of quantifiers in each block, as well as the number of blocks, counts.

Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers

2017 ◽  
Vol 27 (3) ◽  
pp. 358-386 ◽  
Author(s):  
CLAYTON COLLIER-CARTAINO ◽  
NATHAN GRABER ◽  
TAO JIANG
Keyword(s):  
Positive Integer ◽  
Positive Constant ◽  
Uniform Hypergraph ◽  
Ramsey Numbers ◽  
Turán Number ◽  
Formula Group ◽  
Image Position ◽  
Linear Hypergraphs

Anr-uniform hypergraph is called anr-graph. A hypergraph islinearif every two edges intersect in at most one vertex. Given a linearr-graphHand a positive integern, thelinear Turán numberexL(n,H) is the maximum number of edges in a linearr-graphGthat does not containHas a subgraph. For each ℓ ≥ 3, letCrℓdenote ther-uniform linear cycle of length ℓ, which is anr-graph with edgese1, . . .,eℓsuch that, for alli∈ [ℓ−1], |ei∩ei+1|=1, |eℓ∩e1|=1 andei∩ej= ∅ for all other pairs {i,j},i≠j. For allr≥ 3 and ℓ ≥ 3, we show that there exists a positive constantc=cr,ℓ, depending onlyrand ℓ, such that exL(n,Crℓ) ≤cn1+1/⌊ℓ/2⌋. This answers a question of Kostochka, Mubayi and Verstraëte [30]. For even ℓ, our result extends the result of Bondy and Simonovits [7] on the Turán numbers of even cycles to linear hypergraphs.Using our results on linear Turán numbers, we also obtain bounds on the cycle-complete hypergraph Ramsey numbers. We show that there are positive constantsa=am,randb=bm,r, depending only onmandr, such that\begin{equation} R(C^r_{2m}, K^r_t)\leq a \Bigl(\frac{t}{\ln t}\Bigr)^{{m}/{(m-1)}} \quad\text{and}\quad R(C^r_{2m+1}, K^r_t)\leq b t^{{m}/{(m-1)}}. \end{equation}

Sign in / Sign up

Export Citation Format

Share Document