Towards automating duality

C. Brink, D. M. Gabbay, H. J. Ohlbach

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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 some examples that were computed with the Otter theorem prover.

Original languageEnglish
Pages (from-to)73-90
Number of pages18
JournalComputers and Mathematics with Applications
Volume29
Issue number2
DOIs
StatePublished - Jan 1995
Externally publishedYes

Keywords

  • Automated reasoning
  • Duality
  • Power structures
  • Quantifier elimination

Fingerprint

Dive into the research topics of 'Towards automating duality'. Together they form a unique fingerprint.

Cite this