✦ LIBER ✦

An Asymptotic Formula for the Number of Complete Propositional Connectives

✍ Scribed by Roger F. Wheeler

Publisher: John Wiley and Sons
Year: 1962
Tongue: English
Weight: 205 KB
Volume: 8
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19620080102

No coin nor oath required. For personal study only.

✦ Synopsis

The present article is really a continuation of the author's earlier paper [,l] on this subject. The line of investigation described previously is rounded off by deriving some further numcrical results, which include, in particular, an asymptotic fonnula for the number of complete propositional connectives of n variables in 2 -v a l ~t d logic.

📜 SIMILAR VOLUMES

An Asymptotic Formula for the Number of

An Asymptotic Formula for the Number of Smooth Values of a Polynomial

✍ Greg Martin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 402 KB

Wright's formulae for the number of conn

Wright's formulae for the number of connected sparsely edged graphs

✍ P. M. D. Gray; A. M. Murray; N. A. Young 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract We have written computer programs to determine exactly the coefficients in Wright's formula for __f(n, n + k)__, the number of connected sparsely edged labeled graphs (see preceding paper), and used them up to __k__ = 24. We give the results up to __k__ = 7.

On Differences of Twokth Powers: An Asym

On Differences of Twokth Powers: An Asymptotic Formula for the Mean-Square of the Error Term

✍ M Kühleitner 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 195 KB

The arithmetic function r & k (n) counts the number of ways to write a natural number n as the difference of two kth powers (k 2 fixed). The investigation of the asymptotic behaviour of the Dirichlet summatory function of r & k (n) leads in a natural way to a certain error term 2 & k (t). In this ar

An Approximate Formula for the Expected

An Approximate Formula for the Expected Number of Real Zeros of a Random Polynomial

✍ K. Farahmand; N.H. Smith 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Probabilistic analysis of an asymptotica

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

✍ C.T. Ng; X. Cai; T.C.E. Cheng 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 2 views

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well-known NP-hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optima