de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

Towards Automating Duality

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44183

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

Gabbay,  Dov M.
Max Planck Society;

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

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

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Brink, C., Gabbay, D. M., & Ohlbach, H. J. (1994). Towards Automating Duality. Journal of Computers and Mathematics with Applications, 29(2), 73-90.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-ADB5-5
Zusammenfassung
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 OTTER theorem prover to experiment herself.