de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Towards automating duality

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44183

Brink,  Chris
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45140

Ohlbach,  Hans Jürgen
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

MPI-I-93-220.pdf
(Any fulltext), 240KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Brink, C., Gabbay, D. M., & Ohlbach, H. J.(1993). Towards automating duality (MPI-I-93-220). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B45A-D
Abstract
Dualities between different theories occur frequently in mathematics and logic --- between syntax and semantics of a logic, between structures and power structures, between relations and relational algebras, to name just a few. In this paper we show for the case of structures and power structures how corresponding properties of the two related structures can be computed fully automatically by means of quantifier elimination algorithms and predicate logic theorem provers. We illustrate the method with a large number of examples and we give enough technical hints to enable the reader who has access to the {\sc Otter} theorem prover to experiment herself.