Independent Recursive Axiomatizability in Arithmetic

Proceedings of the American Mathematical Society - United States
doi 10.1090/s0002-9939-1969-0256878-0
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

A Note on the Recursive Unsolvability of Primitive Recursive Arithmetic

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1966English

Proof Without Words: Limit of a Recursive Arithmetic Mean

Mathematics Magazine
Mathematics
2016English

Recursive N-Gram Hashing Is Pairwise Independent, at Best

Computer Speech and Language
Theoretical Computer ScienceHuman-Computer InteractionSoftware
2010English

On the Axiomatizability of Priority

BRICS Report Series
2006English

A Programming Language Theorem Which Is Independent of Peano Arithmetic

1979English

Axiomatizability of Reducts of Algebras of Relations

Algebra Universalis
Number TheoryLogicAlgebra
2000English

Age-Independent and Age-Dependent Neural Substrate for Single-Digit Multiplication and Addition Arithmetic Problems

Developmental Neuropsychology
DevelopmentalPhysiological PsychologyNeuropsychologyEducational Psychology
2011English

Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1986English

Recursive Markov Decision Processes and Recursive Stochastic Games

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy