A Proof of the Equivalence of Computability to Recursiveness With No Arithmetization

Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
doi 10.2206/kyushumfs.24.100
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Faculty of Mathematics, Kyushu University

Related search

A Natural Axiomatization of Computability and Proof of Church's Thesis

Bulletin of Symbolic Logic
PhilosophyLogic
2008English

An Algebraic Proof of Kleene-Myhill's Equivalence Theorem

Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
1970English

A New Proof of the Reidemeister-Singer Theorem on Stable Equivalence of Heegaard Splittings

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1976English

Arithmetization of the Field of Reals With Exponentiation Extended Abstract

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2008English

Computability via the Lambda Calculus With Patterns

Journal of Mathematics Research
2010English

On the Arithmetization of Algebraic Geometry

Episodes in the History of Modern Algebra (1800–1950)
2011English

A New Proof of the Equivalence of the Hahn-Banach Extension and the Least Upper Bound Properties

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1981English

A Proof of Andrews’ Conjecture on Partitions With No Short Sequences

Forum of Mathematics, Sigma
StatisticsProbabilityAlgebraCombinatoricsAnalysisNumber TheoryGeometryMathematical PhysicsDiscrete MathematicsComputational MathematicsTheoretical Computer ScienceTopology
2019English

The Computability Path Ordering: The End of a Quest

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy