The Partial Randomness of Recursively Enumerable Reals

2019 ◽  
pp. 83-101
Author(s):  
Kohtaro Tadaki
Keyword(s):  
Recursively Enumerable ◽  
Partial Randomness

scholarly journals DIOPHANTINE SETS OF POLYNOMIALS OVER ALGEBRAIC EXTENSIONS OF THE RATIONALS

2014 ◽  
Vol 79 (3) ◽  
pp. 733-747
Author(s):  
CLAUDIA DEGROOTE ◽  
JEROEN DEMEYER
Keyword(s):  
Minimal Polynomial ◽  
Finite Extension ◽  
Algebraic Extension ◽  
Recursively Enumerable

AbstractLet L be a recursive algebraic extension of ℚ. Assume that, given α ∈ L, we can compute the roots in L of its minimal polynomial over ℚ and we can determine which roots are Aut(L)-conjugate to α. We prove that there exists a pair of polynomials that characterizes the Aut(L)-conjugates of α, and that these polynomials can be effectively computed. Assume furthermore that L can be embedded in ℝ, or in a finite extension of ℚp (with p an odd prime). Then we show that subsets of L[X]k that are recursively enumerable for every recursive presentation of L[X], are diophantine over L[X].

scholarly journals When catalytic P systems with one catalyst can be computationally complete

2021 ◽  
Author(s):  
Artiom Alhazov ◽  
Rudolf Freund ◽  
Sergiu Ivanov
Keyword(s):  
Computational Complexity ◽  
P Systems ◽  
Membrane Systems ◽  
Computational Completeness ◽  
Recursively Enumerable ◽  
Recursively Enumerable Sets

AbstractCatalytic P systems are among the first variants of membrane systems ever considered in this area. This variant of systems also features some prominent computational complexity questions, and in particular the problem of using only one catalyst in the whole system: is one catalyst enough to allow for generating all recursively enumerable sets of multisets? Several additional ingredients have been shown to be sufficient for obtaining computational completeness even with only one catalyst. In this paper, we show that one catalyst is sufficient for obtaining computational completeness if either catalytic rules have weak priority over non-catalytic rules or else instead of the standard maximally parallel derivation mode, we use the derivation mode maxobjects, i.e., we only take those multisets of rules which affect the maximal number of objects in the underlying configuration.

Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete

2021 ◽  
Vol 179 (4) ◽  
pp. 361-384
Author(s):  
Zbyněk Křivka ◽  
Alexander Meduna
Keyword(s):  
Open Problem ◽  
Recursively Enumerable Language ◽  
Recursively Enumerable ◽  
Enumerable Language ◽  
Context Free

This paper investigates the reduction of scattered context grammars with respect to the number of non-context-free productions. It proves that every recursively enumerable language is generated by a scattered context grammar that has no more than one non-context-free production. An open problem is formulated.

α-degrees of α-theories

1972 ◽  
Vol 37 (4) ◽  
pp. 677-682 ◽  
Author(s):  
George Metakides
Keyword(s):  
Initial Segment ◽  
Recursion Theory ◽  
The Other ◽  
Infinite Length ◽  
Infinitary Logic ◽  
Admissible Set ◽  
Recursively Enumerable ◽  
Limit Ordinal ◽  
The Subject ◽  
Further Development

Let α be a limit ordinal with the property that any “recursive” function whose domain is a proper initial segment of α has its range bounded by α. α is then called admissible (in a sense to be made precise later) and a recursion theory can be developed on it (α-recursion theory) by providing the generalized notions of α-recursively enumerable, α-recursive and α-finite. Takeuti [12] was the first to study recursive functions of ordinals, the subject owing its further development to Kripke [7], Platek [8], Kreisel [6], and Sacks [9].Infinitary logic on the other hand (i.e., the study of languages which allow expressions of infinite length) was quite extensively studied by Scott [11], Tarski, Kreisel, Karp [5] and others. Kreisel suggested in the late '50's that these languages (even which allows countable expressions but only finite quantification) were too large and that one should only allow expressions which are, in some generalized sense, finite. This made the application of generalized recursion theory to the logic of infinitary languages appear natural. In 1967 Barwise [1] was the first to present a complete formalization of the restriction of to an admissible fragment (A a countable admissible set) and to prove that completeness and compactness hold for it. [2] is an excellent reference for a detailed exposition of admissible languages.

scholarly journals Interpretability over peano arithmetic

1999 ◽  
Vol 64 (4) ◽  
pp. 1407-1425
Author(s):  
Claes Strannegård
Keyword(s):  
Modal Logic ◽  
Completeness Theorem ◽  
Peano Arithmetic ◽  
Embedding Theorem ◽  
Compactness Theorem ◽  
Partial Answer ◽  
Recursively Enumerable ◽  
Recursively Enumerable Sets ◽  
Interpretability Logic

AbstractWe investigate the modal logic of interpretability over Peano arithmetic. Our main result is a compactness theorem that extends the arithmetical completeness theorem for the interpretability logic ILMω. This extension concerns recursively enumerable sets of formulas of interpretability logic (rather than single formulas). As corollaries we obtain a uniform arithmetical completeness theorem for the interpretability logic ILM and a partial answer to a question of Orey from 1961. After some simplifications, we also obtain Shavrukov's embedding theorem for Magari algebras (a.k.a. diagonalizable algebras).

The theory of the recursively enumerable weak truth-table degrees is undecidable

1992 ◽  
Vol 57 (3) ◽  
pp. 864-874 ◽  
Author(s):  
Klaus Ambos-Spies ◽  
André Nies ◽  
Richard A. Shore
Keyword(s):  
Partial Order ◽  
Open Problem ◽  
Truth Table ◽  
Recursively Enumerable ◽  
Undecidable Theory ◽  
Weak Truth Table Degrees

AbstractWe show that the partial order of -sets under inclusion is elementarily definable with parameters in the semilattice of r.e. wtt-degrees. Using a result of E. Herrmann, we can deduce that this semilattice has an undecidable theory, thereby solving an open problem of P. Odifreddi.

A. A. Fridman. Stépéni nérazréšimosti problémy toždéstva v konéčno oprédélénnyh gruppah. Doklady Akadémii Nauk SSSR, vol. 147 (1962), pp. 805–808. - A. A. Fridman. Degrees of insolvability of the word problem in finitely defined groups. English translation of the preceding by Sue Ann Walker. Soviet mathematics, vol. 3 no. 6 (1962), pp. 1733–1737. - C. R. J. Clapham. Finitely presented groups with word problems of arbitrary degrees of insolubility. Proceedings of the London Mathematical Society, ser. 3 vol. 14 (1964), pp. 633–676. - William W. Boone. Finitely presented group whose word problem has the same degree as that of an arbitrarily given Thue system (an application of methods of Britton). Proceedings of the National Academy of Sciences, vol. 53 (1965), pp. 265–269. - William W. Boone. Word problems and recursively enumerable degrees of unsolvability. A first paper on Thue systems. Annals of mathematics, ser. 2 vol. 83 (1966), pp. 520–571. - William W. Boone. Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups. Annals of mathematics, ser. 2 vol. 84 (1966), pp. 49–84.

1968 ◽  
Vol 33 (2) ◽  
pp. 296-297
Author(s):  
J. C. Shepherdson
Keyword(s):  
Word Problem ◽  
Word Problems ◽  
Nauk Sssr ◽  
London Mathematical Society ◽  
National Academy Of Sciences ◽  
Doklady Akademii Nauk Sssr ◽  
Finitely Presented Groups ◽  
Recursively Enumerable ◽  
Finitely Presented ◽  
Degrees Of Unsolvability
Sign in / Sign up

Export Citation Format

Share Document