A combinatorial analysis of functions provably recursive in
Z. Ratajczyk (1988)
Fundamenta Mathematicae
Similarity:
Z. Ratajczyk (1988)
Fundamenta Mathematicae
Similarity:
Zofia Adamowicz (1990)
Fundamenta Mathematicae
Similarity:
P. L. Papini (1987)
Matematički Vesnik
Similarity:
J. Prasad (1972)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Nobuyoshi Motohashi (1984)
Fundamenta Mathematicae
Similarity:
R. Taberski (1977)
Annales Polonici Mathematici
Similarity:
Fernando Cobos (1988)
Colloquium Mathematicae
Similarity:
Jiři Močkoř (1975)
Colloquium Mathematicae
Similarity:
Matthews, Charles A. (2001)
Experimental Mathematics
Similarity:
R. B. Saxena (1962)
Annales Polonici Mathematici
Similarity:
Adam Grabowski (2016)
Formalized Mathematics
Similarity:
Rough sets, developed by Zdzisław Pawlak [12], are an important tool to describe the state of incomplete or partially unknown information. In this article, which is essentially the continuation of [8], we try to give the characterization of approximation operators in terms of ordinary properties of underlying relations (some of them, as serial and mediate relations, were not available in the Mizar Mathematical Library [11]). Here we drop the classical equivalence- and tolerance-based...