8 citations · 16 across the 22 of their papers we have counts for
6 papers · 1 filter
The Goebbellian Syndrome
Bhupinder Singh Anand
Can we really falsify truth by dictat? A critical note on J. R. Lucas' 1996 remarks concerning non-standard models of first-order Peano Arithmetic.
The Mechanist's Challenge
Bhupinder Singh Anand
Did we really hope to get away with The Goedelian Argument? A critical response to J. R. Lucas' 1996 articulation of his 1961 argument.
PA is instantiationally complete, but algorithmically incomplete: An alternative interpretation of Goedelian incompleteness under Church's Thesis that links formal logic and computability
Bhupinder Singh Anand
We define instantiational and algorithmic completeness for a formal language. We show that, in the presence of Church's Thesis, an alternative interpretation of Goedelian incomplet…
Is the Halting problem effectively solvable non-algorithmically, and is the Goedel sentence in NP, but not in P?
Bhupinder Singh Anand
We consider the thesis that an arithmetical relation, which holds for any, given, assignment of natural numbers to its free variables, is Turing-decidable if, and only if, it is th…
An arguable inconsistency in ZF
Bhupinder Singh Anand
Classical theory proves that every primitive recursive function is strongly representable in PA; that formal Peano Arithmetic, PA, and formal primitive recursive arithmetic, PRA, c…
An arguable addition to the standard Deduction Theorems of first order theories
Bhupinder Singh Anand
We consider the immediate consequence of an arguable addition to the standard Deduction Theorems of first order theories.