✦ LIBER ✦

The problem of finding an inference rule for set theory

✍ Scribed by Larry Wos

Publisher: Springer Netherlands
Year: 1989
Tongue: English
Weight: 150 KB
Volume: 5
Category: Article
ISSN: 0168-7433
DOI: 10.1007/bf00245023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The problem of finding a semantic strate

The problem of finding a semantic strategy for focusing inference rules

✍ Larry Wos 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 131 KB

An algorithm for finding the essential s

An algorithm for finding the essential sets of arcs of certain graphs

✍ Pierre Robert 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 481 KB

THE DECISION PROBLEM FOR RESTRICTED UNIV

THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION

✍ Franco Parlamento; Alberto Policriti 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 775 KB

## Abstract The still unsettled decision problem for the restricted purely universal formulae ((∀)~0~‐formulae) of the first order set‐theoretic language based over =, ∈ is discussed in relation with the adoption or rejection of the axiom of foundation. Assuming the axiom of foundation, the related

The cauchy problem for an equation in th

The cauchy problem for an equation in the theory of infiltration

✍ B. H. Gilding; L. A. Peletier 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 612 KB

Some algorithms for finding the approxim

Some algorithms for finding the approximate solution of incorrect problems in a set of monotonic functions

✍ A.V. Goncharskii; L.G. Gushchina; A.S. Leonov; A.G. Yagola 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 877 KB

Solution of the Chebyshev approximation

Solution of the Chebyshev approximation problem for an incompatible set of nonlinear equations

✍ B.I. Kurlin 📂 Article 📅 1970 🏛 Elsevier Science ⚖ 742 KB