arXiv 2016-11-11 EN Uniform definition of sets using relations and complement of Presburger Arithmetic Milchior, Arthur
arXiv 2011-08-20 EN Some consequences of interpreting the associated logic of the first-order Peano Arithmetic PA finitarily Anand, Bhupinder Singh
arXiv 2009-02-06 EN The significance of Nathanson's 'boss' factor in legitimising Aristotle's particularisation: Why we need to revise current interpretations of Cantor's, Goedel's, Turing's and Tarski's formal reasoning Anand, Bhupinder Singh
arXiv 2007-03-24 EN Two presumptions in Goedel's interpretation of his own, formal, reasoning that are classically objectionable Anand, Bhupinder Singh
arXiv 2006-07-14 EN Why we shouldn't fault Lucas and Penrose for continuing to believe in the Goedelian argument against computationalism Anand, Bhupinder Singh
arXiv 2006-03-26 EN Why Brouwer was right in suggesting that Hilbert's Law of the Excluded Middle needed qualification Anand, Bhupinder Singh
arXiv 2005-07-03 EN PA is instantiationally complete, but algorithmically incomplete: An alternative interpretation of Goedelian incompleteness under Church's Thesis that links formal logic and computability Anand, Bhupinder Singh
arXiv 2005-06-07 EN Is the Halting problem effectively solvable non-algorithmically, and is the Goedel sentence in NP, but not in P? Anand, Bhupinder Singh
arXiv 2005-02-23 EN An arguable addition to the standard Deduction Theorems of first order theories Anand, Bhupinder Singh
arXiv 2004-07-30 EN Do Goedel's incompleteness theorems set absolute limits on the ability of the brain to express and communicate mental concepts verifiably? Anand, Bhupinder Singh
arXiv 2003-11-07 EN How definitive is the standard interpretation of Goodstein's argument? Anand, Bhupinder Singh
arXiv 2003-07-09 EN Can Laplace's formula model a deterministic universe that is irreducibly probabilistic? Anand, Bhupinder Singh
