Completeness, the Recursion Theorem, and Effectively Simple Sets

Proceedings of the American Mathematical Society - United States
doi 10.1090/s0002-9939-1966-0216950-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

A Proof of the Completeness Theorem of Grödel

Fundamenta Mathematicae
Number TheoryAlgebra
1950English

Completeness and Compact Generation in Partially Ordered Sets

Journal of Mathematics and Computer Science
Computational MechanicsComputational MathematicsComputer Science ApplicationsMathematics
2016English

A Simple Recursion for Power Sum Polynomials

Elemente der Mathematik
2014English

Fuzzy Database Query Languages and Their Relational Completeness Theorem

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
1993English

Recursion and Double Recursion

Bulletin of the American Mathematical Society
1948English

On Sets of Completeness for Families of Haar Functions

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1965English

Simple Proof of the Ergodic Theorem

Acta Chemica Scandinavica
1958English

A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events

English

Jump Inversions Inside Effectively Closed Sets and Applications to Randomness

Journal of Symbolic Logic
PhilosophyLogic
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy