✦ LIBER ✦

Arithmetical Functions and Minimalization

✍ Scribed by George S. Boolos

Publisher: John Wiley and Sons
Year: 1974
Tongue: English
Weight: 107 KB
Volume: 20
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19740202302

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Arithmetical identities and zeta-functio

Arithmetical identities and zeta-functions

✍ Shigeru Kanemitsu; Jing Ma; Yoshio Tanigawa 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract In this paper we establish a class of arithmetical Fourier series as a manifestation of the intermediate modular relation, which is equivalent to the functional equation of the relevant zeta‐functions. One of the examples is the one given by Riemann as an example of a continuous non‐dif

Matrices Associated with Classes of Arit

Matrices Associated with Classes of Arithmetical Functions

✍ K. Bourque; S. Ligh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 311 KB

Polynomial induction and length minimiza

Polynomial induction and length minimization in intuitionistic bounded arithmetic

✍ Morteza Moniri 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

## Abstract It is shown that the feasibly constructive arithmetic theory IPV does not prove (double negation of) LMIN(NP), unless the polynomial hierarchy CPV‐provably collapses. It is proved that PV plus (double negation of) LMIN(NP) intuitionistically proves PIND(coNP). It is observed that PV + P

Distribution functions of hyperadditive

Distribution functions of hyperadditive arithmetic functions

✍ Miriam Hausman; Harold N. Shapiro 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB

Substructure lattices and almost minimal

Substructure lattices and almost minimal end extensions of models of Peano arithmetic

✍ James H. Schmerl 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views

## Abstract This paper concerns intermediate structure lattices Lt(𝒩/ℳ︁), where 𝒩 is an almost minimal elementary end extension of the model ℳ︁ of Peano Arithmetic. For the purposes of this abstract only, let us say that ℳ︁ attains __L__ if __L__ ≅ Lt(𝒩/ℳ︁) for some almost minimal elementary end ex

Epistemic entrenchment and arithmetical

Epistemic entrenchment and arithmetical hierarchy

✍ Petr Hájek 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Hfijek, P., Epistemic entrenchment and arithmetical hierarchy (Research Note), Artificial Intelligence 62 (1993) 79-87. If the underlying theory is sufficiently rich (e.g. like first-order arithmetic), then no epistemic entrenchment preorder of sentences is recursively enumerable. Consequently, the