𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computable choice functions for computable linear orderings

✍ Scribed by Manuel Lerman; Richard Watnick

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
351 KB
Volume
49
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A choice set for a computable linear ordering is a set which contains one element from each maximal block of the ordering. We obtain a partial characterization of the computable linear order‐types for which each computable model has a computable choice set, and a full characterization in the relativized case; Every model of the linear order‐type α of degree ≤ d has a choice set of degree ≤ d iff α can written as a finite sum of order‐types, each of which either has finitely many blocks, or has order‐type n · η for some integer n.

📜 SIMILAR VOLUMES

Fifth-order Hermitian schemes for comput
Fifth-order Hermitian schemes for computational linear aeroacoustics
✍ G. Capdeville 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 760 KB

## Abstract We develop a class of fifth‐order methods to solve linear acoustics and/or aeroacoustics. Based on local Hermite polynomials, we investigate three competing strategies for solving hyperbolic linear problems with a fifth‐order accuracy. A one‐dimensional (1D) analysis in the Fourier seri

A computational method for determining q
A computational method for determining quadratic lyapunov functions for non-linear systems
✍ E.J. Davison; E.M. Kurak 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 703 KB

A numerical method may be used to obtain a quadratic Lyapunov Function for a high order system x= f(x), where f(x) is a continuous function of x, so that the vohtme of the asymptotic stability reagion obtained is maximised. Summary--This paper deals with the problem of automatically constructing a

Computation of transfer function matrice
Computation of transfer function matrices of linear multivariable systems
✍ P. Misra; R.V. Patel 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 499 KB

This paper is concerned with the computation of transfer function matrices of linear multivariable systems described by their state-space equations. The algorithm proposed here performs orthogonal similarity transformations to find the minimal order subsystem corresponding to each input-output pair