Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-I-93-230

Classical vs non-classical logics: the universality of classical logic

Gabbay, Dov M.

MPI-I-93-230. August 1993, 101 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Note:
This report investigates the question of the universality of classical
logic. The approach is to show that an almost arbitrary logical system
can be translated reasonably intuitively and almost automatically into
classical logic. The path leading to this result goes through the
analysis of what is a reasonable logic, how to find semantics for it,
how to build a labelled deductive system (LDS) for it, how to translate
a LDS into classical logic and how to automate the process using
SCAN. This report relies on other papers, published and/or to be
published as explained in the acknowledgements.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-93-230.pdfMPI-I-93-230.pdfMPI-I-93-230.dvi - MPI-I-93-230.dvi
496 KBytes; 525 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1993-230
Hide details for BibTeXBibTeX
@TECHREPORT{Gabbay93,
  AUTHOR = {Gabbay, Dov M.},
  TITLE = {Classical vs non-classical logics: the universality of classical logic},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-93-230},
  MONTH = {August},
  YEAR = {1993},
  ISSN = {0946-011X},
  NOTE = {This report investigates the question of the universality of classical
logic. The approach is to show that an almost arbitrary logical system
can be translated reasonably intuitively and almost automatically into
classical logic. The path leading to this result goes through the
analysis of what is a reasonable logic, how to find semantics for it,
how to build a labelled deductive system (LDS) for it, how to translate
a LDS into classical logic and how to automate the process using
SCAN. This report relies on other papers, published and/or to be
published as explained in the acknowledgements.},
}