✦ LIBER ✦

A new face of the branching recurrence of computability logic

✍ Scribed by Giorgi Japaridze

Book ID: 116217485
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 210 KB
Volume: 25
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2011.11.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Toggling-Branching Recurrence of

On the Toggling-Branching Recurrence of Computability Logic

✍ Mei-Xia Qu, Jun-Feng Luan, Da-Ming Zhu… 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 369 KB

The taming of recurrences in computabili

The taming of recurrences in computability logic through cirquent calculus, Part I

✍ Japaridze, Giorgi 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 366 KB

The taming of recurrences in computabili

The taming of recurrences in computability logic through cirquent calculus, Part II

✍ Japaridze, Giorgi 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 479 KB

The new role of mathematical logic: A to

The new role of mathematical logic: A tool for computer science

✍ Giuseppe Longo 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 444 KB

New Techniques for the Computation of Li

New Techniques for the Computation of Linear Recurrence Coefficients

✍ Victor Y. Pan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The n coe$cients of a "xed linear recurrence can be expressed through its m42n terms or, equivalently, the coe$cients of a polynomial of a degree n can be expressed via the power sums of its zeros\*by means of a polynomial equation known as the key equation for decoding the BCH error-correcting code

[Lecture Notes in Computer Science] Logi

[Lecture Notes in Computer Science] Logics of Programs Volume 164 || Deciding branching time logic: A triple exponential decision procedure for CTL

✍ Clarke, Edmund; Kozen, Dexter 📂 Article 📅 1984 🏛 Springer Berlin Heidelberg ⚖ 994 KB