+612 9045 4394
Provability, Computability and Reflection - Lev D. Beklemishev

Provability, Computability and Reflection


Published: 1st April 2000
Format: PDF
or 4 easy payments of $92.38 with Learn more
    Good For
  • IOS and Android Devices (Booktopia Reader app)
  • PC & Mac (Adobe Digital Editions)
  • Kobo / Sony / eReaders
    Not supported
  • Amazon Kindle
  • Windows Smart Phones
  • Adobe Overdrive
  • Adobe Reader
  • Scanned pages
  • Resizeable Text
  • Flowing Text
  • Reproducing or Printing Pages

Provability, Computability and Reflection

Validity and statisfiability in finite domains -- Decision proglem -- Solution of the decision problem for well-formed formulas only monadic predicate variables -- Some general theorems about the validity of formulas of the predicate calculus of first order including equality -- Solution of the decision problem for Wffs with special prefixes -- Further classes of prefixes for which the decision problem can be solved -- General remarks about further investigations -- Decision problem for Wffs with functional variables.

ISBN: 9780080957357
ISBN-10: 0080957358
Format: PDF
Language: English
Published: 1st April 2000
Publisher: Elsevier Science