JAIST Logic@JAIST

On Some General Methods of Proving Decidability or Undecidability

  • Hsing-chien Tsai
  • Department of Philosophy, National Chung-Cheng University, Taiwan
Date: 2015/10/06 (Tue) 15:30
Place: JAIST, Collaboration room 7
Group: Logic Unit
This talk will first introduce some useful general methods of proving the decidability or the undecidability of a first-order logical theory, and then will show some applications of those methods. The methods to be looked into are heavily involved with checking whether or not two models (or two classes of models) stand in certain relations. Here the two most-checked relations between two models are back-and-forth equivalence and definability (that is, defining one into another). In this light, this talk will also briefly discuss some general theorems concerning the two aforementioned model theoretical relations.
Contact Katsuhiko Sano