A classical first order language (1990)
Cached
Download Links
by
Czesław Byliński
| Venue: | Journal of Formalized Mathematics |
| Citations: | 153 - 0 self |
BibTeX
@ARTICLE{Byliński90aclassical,
author = {Czesław Byliński},
title = {A classical first order language},
journal = {Journal of Formalized Mathematics},
year = {1990},
volume = {2},
pages = {676}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper. In this paper i, j, k are natural numbers. Let x, y, a, b be sets. The functor (x = y a,b) yields a set and is defined as follows: (Def. 1) (x = y a,b) = a, if x = y, b, otherwise. Let D be a non empty set, let x, y be sets, and let a, b be elements of D. Then (x = y a,b) is an element of D
Citations
| 1274 | Tarski Grothendieck set theory - Trybulec - 1989 |
| 1237 | Functions and their basic properties - Byliński - 1989 |
| 1164 | Properties of subsets - Trybulec - 1989 |
| 991 | Functions from a set to a set - Byliński - 1989 |
| 971 | Relations and their basic properties - Woronowicz - 1989 |
| 370 | Subsets of real numbers - Trybulec |
| 246 | Binary operations applied to functions - Trybulec - 1990 |
| 28 | and Andrzej Trybulec. A first order language - Rudnicki - 1989 |
| 20 | Introduction to arithmetic - Committee - 2003 |
| 18 | Connectives and subformulae of the first order language - Bancerek - 1989 |
| 5 | Pogorzelski and Tadeusz Prucnal. The substitution rule for predicate letters in the first-order predicate calculus - Witold - 1975 |
