Tarski, A. and Givant, S.: A Formalization of Set Theory Without Variables. American Mathematical Society Colloquium Publications, Volume 41, 1987. Received September 1997 Accepted in revised form January 2000 byIJMayes  Home/Search   Document Not in Database   Summary   Related Articles   Check

....is not preserved by homomorphisms, as shown by an example near the end of the paper. The reasons for suspecting that pair density implies representability are as follows. Relation algebraic equations correspond to first order sentences in which no more than three different variables occur ([TG87]) It is possible to assert, with only three variables, that there are no more than two elements, but the assertion that there are no more than three elements requires four variables. Thus relation algebraic equations can handle and distinguish sets up to cardinality 2, but for cardinality 3 or ....

.... case of the associative law, namely (x;1) 1 = x; 1;1) The class of semiassociative relation algebras has special significance for algebraic logic, since it is the algebraic equivalent of first order logic with binary relation symbols and exactly three individual variables ( Ma83] Ma89] and [TG87]) We will show that every point dense semiassociative relation algebra is a relation algebra, and will use this fact to obtain results about point dense semiassociative relation algebras as corollaries of results concerning pair dense relation algebras. So far we have encountered two new ....

[Article contains additional citation context not shown here]

Alfred Tarski and Steven Givant, A Formalization of Set Theory without Variables, Colloquium Publications 41, American Mathematical Society, Providence, 1987. 45

....13, 14] have been able to retain the traits of ZF, by resorting to higher order features of specific theorem provers such as Isabelle. In this paper we will pursue a minimalist approach, to propose a purely equational formulation of both ZF and finite set theory. Our approach heavily relies on [21], but we go into much finer detail with the axioms, ending in such a concise formulation as to offer a good starting point for experimentation (with Otter [9] say, or with a more markedly equational theorem prover) Our formulation of the axioms is based on the formalism of [21] which is ....

.... relies on [21] but we go into much finer detail with the axioms, ending in such a concise formulation as to offer a good starting point for experimentation (with Otter [9] say, or with a more markedly equational theorem prover) Our formulation of the axioms is based on the formalism of [21], which is equational and devoid of variables, but somewhat out of standards. Work partially supported by the CNR of Italy, coordinated project SETA, and by MURST 40 , Tecniche speciali per la specifica, l analisi, la verifica, la sintesi e la trasformazione di programmi . University La ....

[Article contains additional citation context not shown here]

A. Tarski and S. Givant. A formalization of set theory without variables, volume 41 of Colloquium Publications. American Mathematical Society, 1987.

.... [50] A fragment of this calculus was axiomatized by Alfred Tarski [52] Tarski s axiomatization, in a slightly altered form, became the definition of relation algebras [6] 25] 27] For further introductory and historical material on relation algebras see [6] 23] 24] 27] 32] 33] and [54]. This section contains just enough basic definitions and results for the applications given later. Most of the material in this section can be found in [6] or [27] Definition 23. A relation algebra is an algebraic structure of the form where hA; i is a Boolean algebra, is a ....

Alfred Tarski and Steven R. Givant, A Formalization of Set Theory without Variables, Colloquium Publications, vol. 41, American Mathematical Society, 1987.

....first order logic. Furthermore, the axiomatic approach, as exemplified by Tarski s abstract algebraic definition of relation algebras, was considered by Peirce ( P1870] For the calulus of relations, see Schroder [S1895] The best survey of relation algebras is [J82] and briefer ones appear in [TG87], Chapter 8, and [HMT85] x5.3. Other good sources are [CT51] JT52] Ma82] and [Ma85] The fundamental operations of the calculus of relations are certain natural settheoretic operations on binary relations over a given universal set U . First, there are the Boolean operations of union, ....

....for relation algebras. For example, it is enough to say that ; is associative, 1 , is an identity element for ; and the first or second variation on De Morgan s Theorem K holds. This definition is used in [JT52] It is shown in [CT51] to be equivalent to the official set of axioms ([TG87], 8.2(i) which is listed below. The tenth axiom is yet another variation on De Morgan s Theorem K. 1) a b) c = a (b c) 2) a b = b a, 3) a = a b) a b) 4) a; b;c) a;b) c, 5) a b) c = a;c b;c, 6) a;1 = a, 7) a = a, 8) a b) a b, b ;a, 10) ....

Alfred Tarski and Steven Givant, A Formalization of Set Theory without Variables, Colloquium Publications 41, American Mathematical Society.

....[Boole1847] Lowenheim1915] See [Moore1987] for more details. Schroder1895] See [DPP1911] For another brief history of the calculus of relations, including remarks on the forty years following Peirce s summary, see the first four paragraphs of [Tarski1941] pp. 73 74. See also [Tarski Givant1987], p. xv, and [Lewis1918] See [Peirce1933] Volume III, pp. 404 409, for Peirce s article on relatives. The historical sketch is paragraph 3.643. References to [Peirce1933] of the form n:m refer to paragraph number m in volume n. De Morgan did the first systematic work in his fourth ....

....everyone is loved by someone . In the notation of Note B, this becomes [Peirce1983] pp. 192 193, and [Peirce1933] 3.342. This result, which was first announced in [Tarski1941] p. 88, is equivalent to the undecidability of the equational theory of representable relation algebras. See also [Tarski Givant1987], x8.7, p. 268. Peirce1983] p. 200, and [Peirce1933] 3.351. Peirce1983] p. 201, and [Peirce1933] 3.353. 1; l y 0) 1; l y 0, a special case of (B12) one of the [t]wo formulae so constantly used that hardly anything can be done without them . Peirce gives a couple similar rules, and ....

[Article contains additional citation context not shown here]

Alfred Tarski and Steven Givant, A Formalization of Set Theory without Variables, Colloquium Publications 41, American Mathematical Society, 1987.

.... for the 3 sentences obtained from (4) 6) 7) and (8) On the other hand, while it is easy to prove (2) using four variables, the difficulties encountered when trying to do it with only three led Tarski to explicitly include (2) in the axiomatization of the 3 variable logic L 3 defined in [28], where the problem of axiomatizing n variable logic for n 3 is discussed at length. Let Ls be obtained from L 3 by deleting (2) 28, p 89] Tarski established that (2) is not provable in Ls by considering an algebra, constructed by J. C. C. McKinsey, that satisfies (4) 9) i.e. all of ....

....show that the class of representable relation algebras is not finitely axiomatizable, and also the corresponding 3 dimensional cylindric algebras that were used by Monk [20] to show that the class of 3 dimensional cylindric algebras is not finitely axiomatizable. The first order language L used in [28] has an equality symbol and exactly one binary relation symbol, the appropriate choice for the development of set theory, in which the sole nonlogical predicate is the membership relation. To prove for this language that there are 3 sentences that require arbitrarily large numbers of variables to ....

A. Tarski and S. Givant, A formalization of set theory without variables, American Mathematical Society, Providence, RI, 1987.

....will be inferred to have the same type as p itself. 2. 3 Expressive Power Tarski developed a formalization of set theory that required no variables or quantifiers, based on a relational calculus comprising only the identity constant, union, complement, transpose, composition and equality [Tar41, TG87]. Tarski showed that his calculus is weaker than first order logic, but that it can express any first order formula containing no subformulas with more than 3 free variables. Our language is essentially a version of Tarski s calculus with some convenient shorthands, plus transitive closure (which ....

Alfred Tarski and Steven Givant. A Formalization of Set Theory Without Variables. American Mathematical Society, Colloquium Publications, Volume 41, 1987.

....that has become almost universal represents the most that can be expressed conveniently in diagrammatic form. 7. 6 Scalars and Partial Functions The idea of treating a scalar as a singleton set appears in Quine s set theory [50] and in Tarski and Givant s relational reconstruction of set theory [59]. Hehner proposed the idea of a bunch, a data structure just like a set but of the same type as its elements, as a practical device for simplifying notation [28] In bunch theory, however, a bunch is used to represent non deterministic choice of a scalar value; functions take scalars as ....

Alfred Tarski and Steven Givant. A Formalization of Set Theory Without Variables. American Mathematical Society Colloquium Publications, Volume 41, 1987.

....de Moor [Algebra] Three particularly important coreflexive relations associated with any binary relation R are its formal diagonal, domain and range. Delta(R) R id Dom(R) R1 id = RR id Ran(R) R 1 id = R R id 8 2 Logic without variables One of the main results in [TarGiv] due to Tarski, Maddux and Givant (the so called equipollence theorem) is that every first order sentence in a theory over a theory with a pairing operator has a semantically equivalent equational counterpart X = 1 in the theory QRA of relation algebras with quasi projections. Tarski and ....

Tarski, A. and Givant, S., A formalization of set theory without variables, Colloquium publications, V. 41, American Mathematical Society, Providence, RI, 1987. 28

....f(q) 2 FREL such that j= REL f(q) Semigroups j= q: Conclude that LREL cannot be decidable because that would provide a decision algorithm for the quasi equations of semigroups. There are other ways of handling this problem besides the semigroup one, cf. e.g. the important book Tarski Givant [TG87]. There is a formula 2 FREL such that (f g) is undecidable. Moreover, LREL has the G odel s incompleteness property that is, 9 2 FREL ) 8T FREL ) T ) is undecidable) Observe the contrast between LPAIR and LREL (4) The others (Ex s.2.2.3 (3) 5) for LREL ) follow from the ....

Tarski,A. and Givant,S., \A formalization of set theory without variables," AMS Colloquium publications Vol 41, Providence, Rhode Island, 1987.

.... more subtle, and more useful for understanding the interaction of the three theories of relations (and logics) On the logical aspect of these connections: The logical counterpart of RA (and of its semiassociative variant SA) is a propositional bi modal logic in which the book Tarski Givant [TG87] builds up set theory. Variants of this logic are studied under the name arrow logics by the AmsterdamLondon school, cf. e.g. MPM96] van Benthem [Ben91] BM97] Arrow logic is also the core of both dynamic logic and many susbstructural logics, cf. e.g. Pratt [Pra94] Marx [Mar95] Mikulas ....

....[AT88] who proved that by adding extra axiom schemas to CA n , its members become representable by relativized RCA n s. To be precise, we note that twisting adds an extra dimension of generality to these models, which, we think, was not explicitly discussed in the quoted papers. [TG87] builds up set theory in RA. For SA, this task was carried through in Nemeti [Nem86] cf. also Nemeti [Nem85] The logical counterpart of CA is L , which is the structural version of standard predicate logic, cf. e.g. Blok Pigozzi [BP89, Appendix] or [HMT85, x4.3] Here again, the emphasis ....

[Article contains additional citation context not shown here]

A. Tarski and S. Givant. A formalization of set theory without variables. American Mathematical Society, Providence, R.I., 1987.

....ha; ci 2 R and hc; di 2 S we conclude that ha; di 2 RjS, which, combined with hd; bi 2 T , gives ha; bi 2 (RjS)jT . Note that four objects, namely a, b c, d, are used in the proof. This much was apparent to A. De Morgan[21, 22, 24, 23] C. S. Peirce [26, 27, 28] and E. Schr oder [30] A. Tarski [31, 32] discovered that the reference to four objects is required to prove (1) it can t be proved with reference to only three objects. To see how to prove this formally, start by restating (1) as a sentence in a rst order language that has only binary relations symbols. The equation R = S between two ....

....The equation E is equivalent to its translation E , so every equation is equivalent to a sentence in L 3 . Tarski proved the converse, that every sentence in L 3 is equivalent to an equation. For a much stronger version of the following theorem that involves a recursive translation function, see [32]. Theorem 1. Tarski [32] For every in L 3 there is some equation E such that E 3 . FINITE, INTEGRAL, AND FINITE DIMENSIONAL RELATION ALGEBRAS 3 Here 3 denotes semantic equivalence in L 3 , but Tarski showed that the theorem is still true when 3 denotes provable equivalence. To ....

[Article contains additional citation context not shown here]

Alfred Tarski and Steven R. Givant, A formalization of set theory without variables, Colloquium Publications, vol. 41, American Mathematical Society, 1987.

....this easily readable paper makes the classical main reference books on cylindric algebra theory in particular, and AL in general ( 5] 6] more easily accessible for the reader. Since [6] discusses relation algebras, too, this way the reader is led up to the third main reference book on AL: [11] (with a strong emphasis on relation algebras) As we mentioned, the core part of AL consists of cylindric algebras, relation algebras, and polyadic algebras. The originator of polyadic algebras is Paul Halmos, who gave a paper to the present volume, discussing the mathematician s motivation for ....

A. Tarski and S. Givant. A Formalization of Set Theory Without Variables. Volume 41 of AMS Colloquium Publications, Providence, Rhode Island, 1987.

....0 , v n 1 ) # #) with v distinct from v 0 , v n 1 . Any quasi modal sentence is preserved by #, # , and #d while conversely, if a set of first order sentences is preserved by these three operations, then it is logically equivalent to a set of quasi modal sentences. This was proven in [59] for the language of a binary predicate, and in [14, Section 4] for languages of arbitrary type. This preservation theorem was analysed further in [19, Section 7] where quasimodal sentences were called pseudo equational ) The analysis showed that if #K is the set of all quasi modal sentences ....

....K. Thomason. An Incompleteness Theorem in Modal Logic. Theoria, 40:30 34, 1974. 57] S. K. Thomason. Categories of Frames for Modal Logic. Journal of Symbolic Logic, 40:439 442, 1975. 58] A. Urquhart. Decidability and the finite model property. J. Philosophical Logic, pages 367 370, 1981. [59] J. F. A. K. van Benthem. Modal Correspondence Theory. PhD thesis, University of Amsterdam, 1976. 60] Yde Venema. Many Dimensional Modal Logic. PhD thesis, University of Amsterdam, 1992. 61] F. Wolter. Properties of Tense Logics. Mathematical Logic Quarterly, 42:481 500, 1996. Received 26 ....

[Article contains additional citation context not shown here]

A. Tarski and S. Givant. A Formalization of Set Theory Without Variables.Volume41ofAMS Colloquium Publications, Providence, Rhode Island, 1987.

No context found.

Tarski, A. and Givant, S.: A Formalization of Set Theory Without Variables. American Mathematical Society Colloquium Publications, Volume 41, 1987. Received September 1997 Accepted in revised form January 2000 byIJMayes

No context found.

Tarski, A. and Givant, S. (1987). A formalization of set theory without variables, volume 41 of Colloquium Publications. Amer. Math. Soc., Providence.

No context found.

A. Tarski and S. Givant. A formalization of set theory without variables. AMS Colloquium Publications, Vol. 41. American Mathematical Society, 1988. This article was typeset using the L T E X macro package with the LLNCS2E class. 15

No context found.

A. Tarski and S. Givant. A Formalization of Set Theory without Variables, volume 41. AMS Colloquium publications, Providence, Rhode Island, 1987.

No context found.

Tarski, A. and Givant, S. (1987). A formalization of Set Theory without variables, volume 41 of Colloquium Publications. American Mathematical Society.

No context found.

A. Tarski and S. Givant. A formalization of set theory without variables. Amer. Math. Soc., 1987.

No context found.

Alfred Tarski and Steven R. Givant, A Formalization of Set Theory without Variables, Colloquium Publications 41, American Mathematical Society, 1987. 24

No context found.

Tarski, A., and Givant, S.R., A Formalization of Set Theory without Variables, Colloquium Publications in Math. 41, Amer. Math. Soc., 1987.

No context found.

Alfred Tarski and Steven R. Givant, A Formalization of Set Theory without Variables, Colloquium Publications, vol. 41, American Mathematical Society, 1987.

No context found.

Alfred Tarski and Steven Givant, A Formalization of Set Theory without Variables, Colloquium Publications 41, American Mathematical Society, Providence, 1987.

No context found.

Tarski, A. & Givant, S. (1987). A formalization of set theory without variables, vol. 41 of Colloquium Publications. Providence: Amer. Math. Soc. 15

First 50 documents  Next 50

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