PA is instantiationally complete, but algorithmically incomplete: An alternative interpretation of Goedelian incompleteness under Church's Thesis that links formal logic and computability

Mathematics – General Mathematics

Scientific paper


  [ 0.00 ] – not rated yet Voters 0   Comments 0

Please leave your Comment & Rating

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.