✦ LIBER ✦

On the quality of recursively identified FIR models

✍ Scribed by Gunnarsson, S.

Book ID: 119789141
Publisher: IEEE
Year: 1992
Tongue: English
Weight: 334 KB
Volume: 40
Category: Article
ISSN: 1053-587X
DOI: 10.1109/78.120811

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Recursively Enumerable and Arithmetic

On Recursively Enumerable and Arithmetic Models of Set Theory

✍ Michael O. Rabin 📂 Article 📅 1958 🏛 Association for Symbolic Logic 🌐 English ⚖ 268 KB

The Recursively Saturated Part of Models

The Recursively Saturated Part of Models of Peano Arithmetic

✍ Henryk Kotlarski 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 403 KB 👁 1 views

PA we define the rfcursively saturated part of XU by RS(9Jl) = ( a E $1: ( 3 8 < YJ?) ( a E )%I and 8 is recursively saturated)). We shall study various possibilities for the relationship between 912 and RS(XU). Tliii paper has grown out of our observation that it may happen that , D is a simple ex

On the adequacy of identified Cole–Cole

On the adequacy of identified Cole–Cole models

✍ Jianping Xiang; Daizhan Cheng; F.S. Schlindwein; N.B. Jones 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 155 KB

A Modified Extended Recursive Least-Squa

A Modified Extended Recursive Least-Squares Method for Closed-Loop Identification of FIR Models

✍ Betts, Christopher L.; Karra, Srinivas; Karim, M. Nazmul; Riggs, James B. 📂 Article 📅 2009 🏛 American Chemical Society 🌐 English ⚖ 379 KB

On two questions concerning the automorp

On two questions concerning the automorphism groups of countable recursively saturated models of PA

✍ Roman Kossak; Nicholas Bamber 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 84 KB

On Recursively Enumerable and Arithmetic

On Recursively Enumerable and Arithmetic Models of Set Theoryby Michael O. Rabin

✍ Review by: J. C. Shepherdson 📂 Article 📅 1963 🏛 Association for Symbolic Logic 🌐 English ⚖ 348 KB