Theory

1

A. Abian. The Theory of Sets and Transfinite Arithmetic. W. B. Saundners Company, Philadelphia and London, 1965.

2

P. Aczel. Non-well-founded sets., volume 14 of Lecture Notes, Center for the Study of Language and Information. Stanford, 1988.

3

S. Baratella and R. Ferro. A theory of sets with the negation of the axiom of infinity. (8), march-april 1991.

4

J. Barwise and L. Moss. Hypersets. The Mathematical Intelligencer, 13(4):31-41, 1991.

5

M. Beeson. Towards a computation system based on set theory. Theoretical Computer Science, 60:297-340, 1988.

6

D. Bellé and F. Parlamento. Undecidability of Weak Membership Theories. In Proceedings of the International Conference on Logic and Algebra (in memory of R. Magari), 1994. Siena.

7

P. Bernays. A system of axiomatic set theory. Part I. The Journal of symbolic logic, 2:65-77, 1937.

8

D. Cantone. A survey of computable set theory. Le Matematiche (Catania, Italy), 43(1):125-194, 1988.

9

D. Cantone, V. Cutello, and A. Policriti. Set-theoretic reductions of hilbert's tenth problem. Lecture Notes in Computer Science, 440:65-75, 1989.

10

D. Cantone, A. Ferro, and E. G. Omodeo. Computable Set Theory, Vol. 1. International Series of Monographs on Computer Science. Clarendon Press, Oxford, 1989.

11

D. Cantone, A. Ferro, and D. Sanfilippo. ETNA: Extensible Theorem prover in NAtural deduction. Technical report, Progetto finalizzato Sistemi Informatici e Calcolo Parallelo, november 1992.

12

A. Dovier. Computable Set Theory and Logic Programming. PhD thesis, Università degli Studi di Pisa, March 1996. TD-1/96.

13

F. R. Drake. Set Theory. An introduction to large cardinals. Studies in Logic. North Holland, 1974.

14

A. Ferro, E. G. Omodeo, and J. T. Schwartz. Decision procedures for elementary sublanguages of set theory I, Multi-level syllogistic and some extensions. Communications on Pure and Applied Mathematics, 33:599-608, 1980.

15

A. Ferro, E. G. Omodeo, and J. T. Schwartz. Decision procedures for some fragments of set theory. In Proceedings of the  conference on Automated Deduction, volume 87 of Lecture Notes in Computer Science, pages 88-96. Springer Verlag, 1980.

16

H. Friedman. The consistency of classical set theory relative to a set theory with intuitionistic logic. The Journal of Symbolic Logic, 38(2):315-319, June 1973.

17

D. Gogol. The  -completeness of Zermelo-Fraenkel set theory. Zeitschr. f. Logik und Grundlagen d. Math., 24(4):289-290, 1978.

18

T. J. Jech. Set Theory. Academic Press, 1978.

19

K. Kunen. Set Theory. An Introduction to Independence Proofs. Studies in Logic. North Holland, 1980.

20

A. Levy. Basic Set Theory. Perspectives in Mathematical Logic. Springer Verlag, 1979.

21

F. Montagna and A. Mancini. A minimal predicative set theory. Notre Dame Journal of Formal Logic, 35:186-203, 1994.

22

E. G. Omodeo, F. Parlamento, and A. Policriti. Decidability of  -sentences in Membership Theories. Research Report 6, University of Udine, may 1992.

23

E. G. Omodeo, F. Parlamento, and A. Policriti. A derived algorithm for evaluating  -expressions over abstract sets. J. Symbolic Computation, 15, 1993.

24

E. G. Omodeo, F. Parlamento, and A. Policriti. A derived algorithm for evaluating  -expressions over abstract sets. Journal of Symbolic Computation, (15):673-704, 1993.

25

E. G. Omodeo and A. Policriti. Solvable set/hyperset contexts: I. some decision procedures for the pure, finite case. Communication on Pure and Applied Mathematics, Special issue dedicated to J. T. Schwartz. To appear.

26

E. G. Omodeo and A. Policriti. Decision procedures for set/hyperset contexts. In Alfonso Miola, editor, Design and implementation of symbolic computation systems, volume 722 of Lecture Notes in Computer Science, pages 192-215. Springer Verlag, 1993.

27

F. Parlamento and A. Policriti. Decision Procedures for Elementary Sublanguages of Set Theory IX. Unsolvability of the Decision Problem for a Restricted Subclass of  -Formulas in Set Theory. Communications of Pure and Applied Mathematics, 41:221-251, 1988.

28

F. Parlamento and A. Policriti. The logically simplest form of the infinity axiom. American Mathematical Society, 103, 1988.

29

F. Parlamento and A. Policriti. Note on ``The logically simplest form of the infinity axiom''. American Mathematical Society, 108(1):285-286, January 1990.

30

F. Parlamento and A. Policriti. Undecidability Results for Restricted Universally Quantified Formulae of Set Theory. Communication on Pure and Applied Mathematics, XLVI:57-73, 1993.

31

A. Tarski. Sur les ensembles fini. Fundamenta Mathematicae, VI:45-95, 1924.

32

A. Tarski and S. Givant. A Formalization of Set Theory without Variables, volume 41 of Colloquium Publications. American Mathematical Society, 1986.

33

A. Tarski, A. Mostowski, and R. M. Robinson. Undecidable Theories. North Holland, 1953.

34

A.A. Fraenkel, Y. Bar-Hillel, and A. Levy. Foundations of Set Theory. North Holland, 1984.

35

S. Manandhar. An Attributive Logic with Set Descriptions and Set Operations. In 32nd Annual Meeting of the Association of Computational Linguistics, pgs. 255-262, Association for Computational Linguistics, 1984.

36

Bert de Brock. Foundations of Semantics Databases. Prentice Hall, 1995.

37

Peter Z. Revesz. Datalog Queries of Set Constraint Databases. In Proc. Fifth Intenational Conference on Database Theory. LNCS 893, Springer Verlag, pp. 425-438, 1995.

38

V.Yu. Sazonov. Bounded set theory and polynomial computability. In Fundamentals of Computation Theory. LNCS 278, Springer Verlag, pp. 391-397, 1987.

39

V.Yu. Sazonov. A bounded set theory with anti-foundation axiom and inductive In Computer Science Logic. LNCS 933, Springer Verlag, pp. 527-541, 1995.

40

V.Yu. Sazonov. On Bounded Set Theory In Logic and Scientific Method. Volume 1, Kluwer Academic Press, pp. 85-103, 1997.

41

A.P. Lisitsa and V.Yu. Sazonov. On linear ordering of strongly extensional ... graphs and non-well-founded sets. In Symp. Logical Foundations of Computer Science. LNCS 1234, Springer Verlag, pages 178-188, 1997.

Sat Nov 8 22:02:46 MST 1997