10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P] |
Full Idea: We can beef up Baby Arithmetic into Robinson Arithmetic (referred to as 'Q'), by restoring quantifiers and variables. It has seven generalised axioms, plus standard first-order logic. | |
From: Peter Smith (Intro to Gödel's Theorems [2007], 08.3) |
10852 | Robinson Arithmetic (Q) is not negation complete [Smith,P] |
Full Idea: Robinson Arithmetic (Q) is not negation complete | |
From: Peter Smith (Intro to Gödel's Theorems [2007], 08.4) |