Instructing Equational Set-Reasoning with Otter

Authors:
Andrea Formisano;Eugenio G. Omodeo;Marco Temperini
Affiliations:
-;-;-
Venue:
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Year:
2001

Citing 5
Cited 4

Set theory in first-order logic: clauses for Go¨del's axioms

Journal of Automated Reasoning
Automated reasoning: 33 BASIC research problems

Automated reasoning: 33 BASIC research problems
Automated deduction in von Neumann-Bernays-Go¨del set theory

Journal of Automated Reasoning
Automated Development of Fundamental Mathematical Theories

Automated Development of Fundamental Mathematical Theories
An Equational Re-engineering of Set Theories

Selected Papers from Automated Deduction in Classical and Non-Classical Logics

Compiling dyadic first-order specifications into map algebra

Theoretical Computer Science - Algebraic methods in language processing
Decidability results for sets with atoms

ACM Transactions on Computational Logic (TOCL)
Theory-specific automated reasoning

A 25-year perspective on logic programming
An environment for specifying properties of dyadic relations and reasoning about them II: relational presentation of non-classical logics

TARSKI'02-05 Proceedings of the 2006 international conference on Theory and Applications of Relational Structures as Knowledge Instruments - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

An experimentation activity in automated set-reasoning is reported. The methodology adopted is based on an equational reengineering of ZF set theory within the ground formalism L脳 developed by Tarski and Givant. On top of a kernel axiomatization of map algebra we develop a layered formalization of basic set-theoretical concepts. A first-order theorem prover is exploited to obtain automated certification and validation of this layered architecture.