✦ LIBER ✦

Completeness of axiom systems in algorithmic algebras

✍ Scribed by G. M. Kirsanov; G. E. Tseitlin

Publisher: Springer US
Year: 1977
Tongue: English
Weight: 280 KB
Volume: 13
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01069542

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Revisiting the axiom of completeness in

Revisiting the axiom of completeness in health care

✍ Mandy Ryan; Fernando San Miguel 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB 👁 1 views

## Abstract Experiments concerned with modelling individual preferences are based on the assumption of completeness i.e. it is assumed that individuals have well‐defined preferences for any choice they are presented with. However, this may not be the case for goods such as health care, where indivi

Problems of completeness in Boolean func

Problems of completeness in Boolean function algebras

✍ G. E. Tseitlin 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 147 KB

Algorithmic complexity of algebraic syst

Algorithmic complexity of algebraic systems

✍ V. L. Selivanov 📂 Article 📅 1988 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 437 KB

Completeness in sums of Boolean algebras

Completeness in sums of Boolean algebras and logics

✍ Vladimír Janiš; Zdenka Riečanová 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 347 KB

Realization of the tools of algorithmic

Realization of the tools of algorithmic algebras in uniform structures

✍ V. I. Kekeliya; G. M. Kirsanov; G. E. Tseitlin 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 50 KB

Realization of the means of algorithmic

Realization of the means of algorithmic algebras in homogeneous structures

✍ V. I. Kekeliya; G. M. Kirsanov; G. E. Tseitlin 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 606 KB