✦ LIBER ✦

The Equivalence of Equational and Sentential General Recursive Arithmetics

✍ Scribed by Ryan, W. J.

Book ID: 120096368
Publisher: Oxford University Press
Year: 1976
Tongue: English
Weight: 317 KB
Volume: s2-14
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-14.3.463

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Equivalence Between Logic-Free an

On the Equivalence Between Logic-Free and Logic-Bearing Systems of Primitive Recursive Arithmetic

✍ Daniel G. Schwartz 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 523 KB

The equivalence of bar recursion and ope

The equivalence of bar recursion and open recursion

✍ Powell, Thomas 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 575 KB

On the equivalence of generalized Langev

On the equivalence of generalized Langevin equation and generalized master equation

✍ H. Grabert 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 312 KB

On the Consistency and Undecidability of

On the Consistency and Undecidability of Recursive Arithmetic

✍ H. E. Rose 📂 Article 📅 1961 🏛 John Wiley and Sons 🌐 English ⚖ 556 KB

On the equivalence of time-convolutionle

On the equivalence of time-convolutionless master equations and generalized Langevin equations

✍ P. Hänggi; P. Talkner 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 235 KB

On the Equivalence of Recursive and Nonr

On the Equivalence of Recursive and Nonrecursive Datalog Programs

✍ Surajit Chaudhuri; Moshe Y Vardi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 591 KB

We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. Since nonrecursive Datalog programs are equivalent to unions of conjunctive queries, we study also the problem of determining whether a given recursive Datalog program