A theorem on shortening the length of proof in formal systems of arithmetic

1975 ◽  
Vol 40 (3) ◽  
pp. 398-400 ◽  
Author(s):  
Robert A. di Paola
Keyword(s):  
Ab Initio ◽  
Natural Number ◽  
A Priori ◽  
Relative Length ◽  
Constant Term ◽  
Recursive Functions ◽  
Formal Systems ◽  
Recursively Enumerable ◽  
Image Position ◽  
Standard Enumeration

This note is concerned with an aspect of the length of proof of formulas in recursively enumerable theories T adequate for recursive arithmetic. In particular, we consider the relative length of proof of formulas in the theories T and T(S), where F represents an r.e. set A in T and T(S) is the theory obtained from T by adjunction, as a new axiom, of a sentence S undecidable in T.Throughout the sequel T is a consistent, r.e. theory with standard formalization [7] in which all recursive functions of one variable are definable, and in which there is a binary formula x ≤ satisfying the well-known conditions [7]:Here is the constant term corresponding to the natural number n. Wn is the nth r.e. set in a standard enumeration of the r.e. sets. Also, we assume an a priori Gödel numbering of our formalism satisfying the usual conditions, so that all formulas are numbers ab initio.In the more common applications of the theorem below, if F is a k-ary formula of T, is a natural number that measures in some way the length of the shortest proof of in T.

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.

Index sets of finite classes of recursively enumerable sets

1969 ◽  
Vol 34 (1) ◽  
pp. 39-44 ◽  
Author(s):  
Louise Hay
Keyword(s):  
Index Set ◽  
Recursive Functions ◽  
Recursively Enumerable ◽  
Index Sets ◽  
Recursively Enumerable Sets ◽  
Partial Recursive Functions ◽  
Recursive Isomorphism ◽  
Standard Enumeration

Let q0, q1,… be a standard enumeration of all partial recursive functions of one variable. For each i, let wi = range qi and for any recursively enumerable (r.e.) set α, let θα = {n | wn = α}. If A is a class of r.e. sets, let θA = the index set of A = {n | wn ∈ A}. It is the purpose of this paper to classify the possible recursive isomorphism types of index sets of finite classes of r.e. sets. The main theorem will also provide an answer to the question left open in [2] concerning the possible double isomorphism types of pairs (θα, θβ) where α ⊂ β.

scholarly journals RAMSEY’S THEOREM FOR PAIRS ANDKCOLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC

2017 ◽  
Vol 82 (2) ◽  
pp. 737-753
Author(s):  
STEFANO BERARDI ◽  
SILVIA STEILA
Keyword(s):  
Natural Number ◽  
Ramsey's Theorem ◽  
Recursively Enumerable ◽  
Ramsey’S Theorem ◽  
Heyting Arithmetic ◽  
Classical Principle ◽  
Image Position ◽  
Intuitionistic Arithmetic

AbstractThe purpose is to study the strength of Ramsey’s Theorem for pairs restricted to recursive assignments ofk-many colors, with respect to Intuitionistic Heyting Arithmetic. We prove that for every natural number$k \ge 2$, Ramsey’s Theorem for pairs and recursive assignments ofkcolors is equivalent to the Limited Lesser Principle of Omniscience for${\rm{\Sigma }}_3^0$formulas over Heyting Arithmetic. Alternatively, the same theorem over intuitionistic arithmetic is equivalent to: for every recursively enumerable infinitek-ary tree there is some$i < k$and some branch with infinitely many children of indexi.

A note on the representation of general recursive functions and the μ quantifier

1959 ◽  
Vol 55 (2) ◽  
pp. 145-148
Author(s):  
Alan Rose
Keyword(s):  
Natural Number ◽  
Recursive Function ◽  
Natural Numbers ◽  
General Recursive Function ◽  
Recursive Functions ◽  
Image Position ◽  
Primitive Recursive

It has been shown that every general recursive function is definable by application of the five schemata for primitive recursive functions together with the schemasubject to the condition that, for each n–tuple of natural numbers x1,…, xn there exists a natural number xn+1 such that

scholarly journals The measure problem in no-collapse (many worlds) quantum mechanics

2017 ◽  
Vol 26 (03) ◽  
pp. 1730008 ◽  
Author(s):  
Stephen D. H. Hsu
Keyword(s):  
Wave Function ◽  
Quantum Mechanics ◽  
Probability Measure ◽  
Ab Initio ◽  
Subjective Probability ◽  
State Vector ◽  
A Priori ◽  
Born Rule ◽  
Many Worlds ◽  
Measure Problem

We explain the measure problem (cf. origin of the Born probability rule) in no-collapse quantum mechanics. Everett defined maverick branches of the state vector as those on which the usual Born probability rule fails to hold — these branches exhibit highly improbable behaviors, including possibly the breakdown of decoherence or even the absence of an emergent semi-classical reality. Derivations of the Born rule which originate in decision theory or subjective probability (i.e. the reasoning of individual observers) do not resolve this problem, because they are circular: they assume, a priori, that the observer occupies a non-maverick branch. An ab initio probability measure is sometimes assumed to explain why we do not occupy a maverick branch. This measure is constrained by, e.g. Gleason’s theorem or envariance to be the usual Hilbert measure. However, this ab initio measure ultimately governs the allocation of a self or a consciousness to a particular branch of the wave function, and hence invokes primitives which lie beyond the Everett wave function and beyond what we usually think of as physics. The significance of this leap has been largely overlooked, but requires serious scrutiny.

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.

scholarly journals Dopant–dopant interactions in beryllium doped indium gallium arsenide: An ab initio study

2018 ◽  
Vol 33 (4) ◽  
pp. 401-413 ◽  
Author(s):  
Vadym Kulish ◽  
Wenyuan Liu ◽  
Francis Benistant ◽  
Sergei Manzhos
Keyword(s):  
Gallium Arsenide ◽  
Ab Initio ◽  
Indium Gallium Arsenide ◽  
Ab Initio Study ◽  
Indium Gallium ◽  
Image Position

Abstract

Irreducibility of Bernoulli Polynomials of Higher Order

1962 ◽  
Vol 14 ◽  
pp. 565-567 ◽  
Author(s):  
P. J. McCarthy
Keyword(s):  
Positive Integer ◽  
Bernoulli Number ◽  
Bernoulli Polynomials ◽  
Constant Term ◽  
Rational Numbers ◽  
Higher Order ◽  
Image Position

The Bernoulli polynomials of order k, where k is a positive integer, are defined byBm(k)(x) is a polynomial of degree m with rational coefficients, and the constant term of Bm(k)(x) is the mth Bernoulli number of order k, Bm(k). In a previous paper (3) we obtained some conditions, in terms of k and m, which imply that Bm(k)(x) is irreducible (all references to irreducibility will be with respect to the field of rational numbers). In particular, we obtained the following two results.

Sign in / Sign up

Export Citation Format

Share Document