A propositional calculus with denumerable matrix

1959 ◽  
Vol 24 (2) ◽  
pp. 97-106 ◽  
Author(s):  
Michael Dummett
Keyword(s):  
Natural Number ◽  
Propositional Calculus ◽  
Finite Matrix ◽  
Image Position ◽  
Matrix Characteristic

§1. In [1] Gödel proves the non-existence of a finite matrix characteristic for the intuitionist propositional calculus IC by the use of the finite matrices , where n is a natural number and

The Range of a Gap Series

1975 ◽  
Vol 18 (5) ◽  
pp. 753-754
Author(s):  
J. S. Hwang
Keyword(s):  
Natural Number ◽  
Gap Series ◽  
Image Position

Theorem. Letbe a function holomorphic in the disk, wherep is a natural number andIfthen then f(z) assumes every complex value infinitely often in every sector.The purpose of this note is to prove the above result. To do this, we first observe that from the condition a<∞, we can easily show that the derivative f′(z) satisfying

scholarly journals The determination of Fibonacci groups

1974 ◽  
Vol 11 (1) ◽  
pp. 11-14 ◽  
Author(s):  
A.M. Brunner
Keyword(s):  
Natural Number ◽  
Image Position

Fibonacci groups are the groupswhere r is a natural number. The groups F(2, 8) and F(2, 10) are shown to he infinite, thus leaving F(2, 9) as the only Fibonacci group whose finiteness or infiniteness has not been determined.

Register machine proof of the theorem on exponential diophantine representation of enumerable sets

1984 ◽  
Vol 49 (3) ◽  
pp. 818-829 ◽  
Author(s):  
J. P. Jones ◽  
Y. V. Matijasevič
Keyword(s):  
Natural Number ◽  
Polynomial Time ◽  
Simple Proof ◽  
Diophantine Equations ◽  
Polynomial Equation ◽  
Exponential Diophantine Equations ◽  
Recursively Enumerable ◽  
Image Position ◽  
The Right ◽  
Exponential Relation

The purpose of the present paper is to give a new, simple proof of the theorem of M. Davis, H. Putnam and J. Robinson [1961], which states that every recursively enumerable relation A(a1, …, an) is exponential diophantine, i.e. can be represented in the formwhere a1 …, an, x1, …, xm range over natural numbers and R and S are functions built up from these variables and natural number constants by the operations of addition, A + B, multiplication, AB, and exponentiation, AB. We refer to the variables a1,…,an as parameters and the variables x1 …, xm as unknowns.Historically, the Davis, Putnam and Robinson theorem was one of the important steps in the eventual solution of Hilbert's tenth problem by the second author [1970], who proved that the exponential relation, a = bc, is diophantine, and hence that the right side of (1) can be replaced by a polynomial equation. But this part will not be reproved here. Readers wishing to read about the proof of that are directed to the papers of Y. Matijasevič [1971a], M. Davis [1973], Y. Matijasevič and J. Robinson [1975] or C. Smoryński [1972]. We concern ourselves here for the most part only with exponential diophantine equations until §5 where we mention a few consequences for the class NP of sets computable in nondeterministic polynomial time.

The subnormal structure of general linear groups

1986 ◽  
Vol 99 (3) ◽  
pp. 425-431 ◽  
Author(s):  
L. N. Vaserstein
Keyword(s):  
Normal Subgroup ◽  
Natural Number ◽  
Associative Ring ◽  
Inverse Image ◽  
General Linear ◽  
Linear Groups ◽  
Canonical Homomorphism ◽  
General Linear Groups ◽  
Subnormal Structure ◽  
Image Position

Let A be an associative ring with 1. For any natural number n, let GLnA denote the group of invertible n by n matrices over A, and let EnA be the subgroup generated by all elementary matrices ai, j, where aεA and 1 ≤ i ≡ j ≤ n. For any (two-sided) ideal B of A, let GLnB be the kernel of the canonical homomorphism GLnA→GLn(A/B) and Gn(A, B) the inverse image of the centre of GLn(A/B) (when n > 1, the centre consists of scalar matrices over the centre of the ring A/B). Let EnB denote the subgroup of GLnB generated by its elementary matrices, and let En(A, B) be the normal subgroup of EnA generated by EnB (when n > 2, the group GLn(A, B) is generated by matrices of the form ai, jbi, j(−a)i, j with aA, b in B, i ≡ j, see [7]). In particuler,is the centre of GLnA

scholarly journals Pairs of quadratic forms modulo one

1993 ◽  
Vol 35 (1) ◽  
pp. 51-61
Author(s):  
R. C. Baker ◽  
J. Brüdern
Keyword(s):  
Natural Number ◽  
Quadratic Forms ◽  
Image Position ◽  
Real Quadratic

Let s be a natural number, s ≥ 2. We seek a positive number λ(s) with the following property:Let ε > 0. Let Q1(x1, …, xs), Q2(x1, …, xs) be real quadratic forms, then for N > C1(s, ε) we havefor some integers n1, …, ns,

New foundations for Lewis modal systems

1957 ◽  
Vol 22 (2) ◽  
pp. 176-186 ◽  
Author(s):  
E. J. Lemmon
Keyword(s):  
Modal Logic ◽  
Propositional Calculus ◽  
Modal System ◽  
New Foundations ◽  
Image Position ◽  
Classical Propositional Calculus ◽  
Modal Systems

The main aims of this paper are firstly to present new and simpler postulate sets for certain well-known systems of modal logic, and secondly, in the light of these results, to suggest some new or newly formulated calculi, capable of interpretation as systems of epistemic or deontic modalities. The symbolism throughout is that of [9] (see especially Part III, Chapter I). In what follows, by a Lewis modal system is meant a system which (i) contains the full classical propositional calculus, (ii) is contained in the Lewis system S5, (iii) admits of the substitutability of tautologous equivalents, (iv) possesses as theses the four formulae:We shall also say that a system Σ1 is stricter than a system Σ2, if both are Lewis modal systems and Σ1 is contained in Σ2 but Σ2 is not contained in Σ1; and we shall call Σ1absolutely strict, if it possesses an infinity of irreducible modalities. Thus, the five systems of Lewis in [5], S1, S2, S3, S4, and S5, are all Lewis modal systems by this definition; they are in an order of decreasing strictness from S1 to S5; and S1 and S2 alone are absolutely strict.

The þ-function in λ-K-conversion

1937 ◽  
Vol 2 (4) ◽  
pp. 164-164 ◽  
Author(s):  
A. M. Turing
Keyword(s):  
Positive Integer ◽  
Natural Number ◽  
Definition Of ◽  
Image Position

In the theory of conversion it is important to have a formally defined function which assigns to any positive integer n the least integer not less than n which has a given property. The definition of such a formula is somewhat involved: I propose to give the corresponding formula in λ-K-conversion, which will (naturally) be much simpler. I shall in fact find a formula þ such that if T be a formula for which T(n) is convertible to a formula representing a natural number, whenever n represents a natural number, then þ(T, r) is convertible to the formula q representing the least natural number q, not less than r, for which T(q) conv 0.2 The method depends on finding a formula Θ with the property that Θ conv λu·u(Θ(u)), and consequently if M→Θ(V) then M conv V(M). A formula with this property is,The formula þ will have the required property if þ(T, r) conv r when T(r) conv 0, and þ(T, r) conv þ(T, S(r)) otherwise. These conditions will be satisfied if þ(T, r) conv T(r, λx·þ(T, S(r)), r), i.e. if þ conv {λptr·t(r, λx·p(t, S(r)), r)}(þ). We therefore put,This enables us to define also a formula,such that (T, n) is convertible to the formula representing the nth positive integer q for which T(q) conv 0.

Paradox of the class of all grounded classes

1953 ◽  
Vol 18 (2) ◽  
pp. 114-114 ◽  
Author(s):  
Shen Yuting
Keyword(s):  
Positive Integer ◽  
Natural Number ◽  
Image Position ◽  
Special Case

A class A for which there is an infinite progression of classes A1, A2, … (not necessarily all distinct) such thatis said to be groundless. A class which is not groundless is said to be grounded. Let K be the class of all grounded classes.Let us assume that K is a groundless class. Then there is an infinite progression of classes A1, A2, … such thatSince A1 ϵ K, A1 is a grounded class; sinceA1 is also a groundless class. But this is impossible.Therefore K is a grounded class. Hence K ϵ K, and we haveTherefore K is also a groundless class.This paradox forms a sort of triplet with the paradox of the class of all non-circular classes and the paradox of the class of all classes which are not n-circular (n a given natural number). The last of the three includes as a special case the paradox of the class of all classes which are not members of themselves (n = 1).More exactly, a class A1 is circular if there exists some positive integer n and classes A2, A3, …, An such thatFor any given positive integer n, a class A1 is n-circular if there are classes A2, …, An, such thatQuite obviously, by arguments similar to the above, we get a paradox of the class of all non-circular classes and a paradox of the class of all classes which are not n-circular, for each positive integer n.

scholarly journals DIFFERENTIAL INEQUALITIES AND A MARTY-TYPE CRITERION FOR QUASI-NORMALITY

2018 ◽  
Vol 105 (1) ◽  
pp. 34-45
Author(s):  
JÜRGEN GRAHL ◽  
TOMER MANKET ◽  
SHAHAR NEVO
Keyword(s):  
Natural Number ◽  
Holomorphic Functions ◽  
Differential Inequalities ◽  
The Family ◽  
Type Criterion ◽  
Image Position

We show that the family of all holomorphic functions $f$ in a domain $D$ satisfying $$\begin{eqnarray}\frac{|f^{(k)}|}{1+|f|}(z)\leq C\quad \text{for all }z\in D\end{eqnarray}$$ (where $k$ is a natural number and $C>0$) is quasi-normal. Furthermore, we give a general counterexample to show that for $\unicode[STIX]{x1D6FC}>1$ and $k\geq 2$ the condition $$\begin{eqnarray}\frac{|f^{(k)}|}{1+|f|^{\unicode[STIX]{x1D6FC}}}(z)\leq C\quad \text{for all }z\in D\end{eqnarray}$$ does not imply quasi-normality.

scholarly journals On the mean value of the enumeration function for multiplicative partitions

1990 ◽  
Vol 41 (3) ◽  
pp. 407-410 ◽  
Author(s):  
Cao Hui-Zong ◽  
Ku Tung-Hsin
Keyword(s):  
Natural Number ◽  
Mean Value ◽  
The Mean ◽  
Image Position

Let g(n) denote the number of multiplicative partitions of the natural number n. We prove that

Sign in / Sign up

Export Citation Format

Share Document