Amanote Research
Register
Sign In
A Programming Language Theorem Which Is Independent of Peano Arithmetic
doi 10.1145/800135.804411
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 1979
Authors
Michael O'Donnell
Publisher
ACM Press
Related search
LARA as a Language-Independent Aspect-Oriented Programming Approach
Is Python an Appropriate Programming Language for Teaching Programming in Secondary Schools?
International Journal of Information and Communication Technologies in Education
Independent Recursive Axiomatizability in Arithmetic
Proceedings of the American Mathematical Society
Mathematics
Applied Mathematics
Reducibilities Among Decision Problems for HNN Groups, Vector Addition Systems and Subsystems of Peano Arithmetic
Proceedings of the American Mathematical Society
Mathematics
Applied Mathematics
Integrative Self-Sorting Is a Programming Language for High Level Self-Assembly
Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
Can a Language Be Before “The First Programming Language”?
Teaching Mathematics and Computer Science
A General Sufficiency Theorem for Nonsmooth Nonlinear Programming
Transactions of the American Mathematical Society
Mathematics
Applied Mathematics
HackPPL: A Universal Probabilistic Programming Language
A Tamper-Resistant Programming Language System
