Searching for "The Axiomatization of Arithmetic." – sorted by Relevance.
-
FUNCTORIAL CONCEPTS OF COMPLEXITY FOR FINITE AUTOMATA
- for Boolean algebras, as well as about the axiomatic arithmetic of finite combinatorial toposes, are closely
- Add To MetaCart
-
Shadows of the Mind
- 's how it gets messy. A. Whatever formal axiomatization of arithmetic the robot uses, Godel's theorem
- Cited by 134 (0 self) – Add To MetaCart
-
On Floyd and Putnam on Wittgenstein on Gödel
- to assume two things. First, we assume that our background axiomatization of arithmetic is sound
- Add To MetaCart
-
Research on Proof-Carrying Code for Mobile-Code Security
- problem is in the axiomatization of arithmetic. In our current experiments, we have freely added axioms
- Cited by 12 (0 self) – Add To MetaCart
-
Research on Proof-Carrying Code for Mobile-Code Security
- problem is in the axiomatization of arithmetic. In our current experiments, we have freely added axioms
- Add To MetaCart
-
T.: Foundational certification of data-flow analyses
- to relatively to the level of completeness of an axiomatization of arithmetic), if we replaced the two
- Cited by 2 (1 self) – Add To MetaCart
-
Consistency - What's Logic Got to Do with It?
- was that if one could axiomatize arithmetic in such a way which would allow a logical demonstration of its
- Add To MetaCart
-
Tennenbaum’s Theorem for Models of Arithmetic
- of the system of arithmetical axioms. To prove the incompleteness of axiomatic arithmetic without applying
- Cited by 1 (0 self) – Add To MetaCart
-
Hilbert’s Program Then and Now
- it clear that an axiomatic foundation of arithmetic and set theory requires a more precise development
- Cited by 1 (0 self) – Add To MetaCart
-
Definability in the Recursively Enumerable Degrees
- as providing us with models of some finite axiomatization of arithmetic. The real problem, now, is to definably
- Add To MetaCart

