English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Towards Automating Duality

MPS-Authors
/persons/resource/persons44183

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

Gabbay,  Dov M.
Max Planck Society;

/persons/resource/persons45140

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

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

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


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