See this document in CiteSeerX!

An Equational Re-Engineering of Set Theories (1998)  (Make Corrections)  (3 citations)
Andrea Formisano, Eugenio Omodeo
FTP (LNCS Selection)



  Home/Search   Context   Related

 
View or download:
logic.at/pub/ftp98...isano_omodeo.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  strudel.di.unipi.it/p40/p...pubbl (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: New successes in dealing with set theories by means of state-of-the-art theoremprovers may ensue from terse and concise axiomatizations, such as can be moulded in the framework of the (fully equational) Tarski-Givant map calculus. In this paper we carry out this task in detail, setting the ground for a number of experiments. Key words: Set theory, relation algebras, first-order theorem-proving, algebraic logic. 1 Introduction Like other mature fields of mathematics, Set Theory deserves... (Update)

Context of citations to this paper:   More

.... but one instructs on the two formalisms strong theories such as theories of numbers (cf. End72, FOT98] of lists and sets (cf. [Kri71, FO98]) or of geometric spaces (cf. Tar69] The main weakness of relational systems remains, in our opinion, the diculty of a direct...

.... with it as a necessary preliminary step towards a broader experimental activity on equational set theory, such as the one envisaged in [6]. symbol : 1l 2 4 1 n [ degree : 2 2 0 0 0 0 2 2 2 1 1 2 2 priority : 1 1 5 3 6 7 2 2 P [Q Def P 4Q4P Q P nQ Def P...

Cited by:   More
Compiling Dyadic First-Order Specications into Map Algebra - Cantone, Formisano..   (Correct)
Benchmark #1 for Equational Set Theory - Chiacchiaretta, Formisano, Omodeo   (Correct)
Compiling Dyadic First-Order Specifications into Map .. - Cantone, Formisano, ..   (Correct)

Active bibliography (related documents):   More   All
2.5:   An Equational Re-Engineering of Set Theories - Formisano, Omodeo (1998)   (Correct)
0.7:   Map calculus: Initial application scenarios and.. - Aureli.. (1998)   (Correct)
0.5:   Formative processes with applications to the decision.. - Cantone, Omodeo, Ursino   (Correct)

Similar documents based on text:   More   All
0.4:   Mappings Between Domain Models in Answer Set - Programming Stefania Costantini   (Correct)
0.2:   Plan of Activities on the Map Calculus - Formisano, Omodeo, Temperini (1998)   (Correct)
0.2:   Solvable set/hyperset contexts: I. Some decision procedures.. - Omodeo, Policriti   (Correct)

Related documents from co-citation:   More   All
3:   Map calculus: Initial application scenarios and experiments based on Otter - Aureli, Omodeo et al. - 1998
3:   Goals and benchmarks for automated map reasoning (context) - Formisano, Omodeo et al.
3:   Problems of expressibility in nite languages (context) - Kwatinetz - 1981

BibTeX entry:   (Update)

A. Formisano and E. G. Omodeo. An equational re-engineering of set theories. In R. Caferra and G. Salzer, eds., Proc. of the FTP98 Int. workshop on rst-order theorem proving, Technische Universitat Wien. Technical Report E1852-GS-981:142-151, 1998. (To appear in a volume of the LNCS series of Springer-Verlag.) http://citeseer.ist.psu.edu/formisano98equational.html   More

@inproceedings{ formisano98equational,
    author = "Andrea Formisano and Eugenio G. Omodeo",
    title = "An Equational Re-engineering of Set Theories",
    booktitle = "{FTP} ({LNCS} Selection)",
    pages = "175-190",
    year = "1998",
    url = "citeseer.ist.psu.edu/formisano98equational.html" }
Citations (may not include all citations):
181   Mathematical logic (context) - Shoenfield - 1967
97   A formalization of set theory without variables (context) - Tarski, Givant - 1987
39   From foundations to functions (context) - Paulson, for - 1993
28   Automated development of fundamental mathematical theories (context) - Quaife - 1992
27   Automating higher-order logic (context) - Andrews, Miller et al. - 1984
27   Automated deduction in von Neumann-Bernays-Godel Set Theory (context) - Quaife - 1992
26   Set theory in first-order logic: Clauses for Godel's axioms (context) - Boyer, Lusk et al. - 1986
19   Set theory and its logic (context) - Quine - 1971
16   Experimenting with Isabelle in ZF set theory (context) - Noel - 1993
13   Series of Monographs on Computer Science (context) - Cantone, Ferro et al. - 1989
9   basic research problems (context) - Wos - 1988
8   Mechanizing set theory (context) - Paulson, Gr - 1996
5   On existentially quantified conjunctions of atomic formulae .. - Cantone, Cavarra et al. - 1997
4   Sur les ensembles fini (context) - Tarski - 1924
4   II: Induction and recursion (context) - Paulson, for - 1995
4   Plan of activities on the map calculus - Formisano, Omodeo et al. - 1998
2   Expressing infinity without foundation (context) - Parlamento, Policriti - 1991
2   The problem of finding an inference rule for set theory (context) - Wos - 1989
2   Some decision procedures for the pure (context) - Omodeo, Policriti et al. - 1995

Documents on the same site (http://strudel.di.unipi.it/p40/pubbl/pubbl.html):   More
Uniform Closures: Order-Theoretically Reconstructing Logic.. - Giacobazzi, al. (1998)   (Correct)
Static Analysis of Processes for No Read-Up and No.. - Bodei, Degano, Nielson.. (1999)   (Correct)
Matching for the Lambda Calculus of Objects - Bono, Bugliesi (1998)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC