✦ LIBER ✦

Complexity of the decidability of the unquantified set theory with a rank operator

✍ Scribed by M. Tetruashvili

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of the decidability of one cl

✍ M. Tetruashvili 📂 Article 📅 1996 🏛 Walter de Gruyter GmbH & Co. KG 🌐 English ⚖ 232 KB

The Complexity of Early Deciding Set Agr

✍ Gafni, Eli; Guerraoui, Rachid; Pochon, Bastian 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 220 KB

A note on the decidability of mls extend

✍ A. Ferro 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 335 KB

An extension of the ranked set sampling

✍ Shingo Shirahata 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 946 KB

On proximinality and sets of operators.

✍ Aref Kamal 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Decidability of the elementary theory of

✍ L. V. Shabunin 📂 Article 📅 1990 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 464 KB