Sciweavers

JSYML
2002
63views more  JSYML 2002»
13 years 10 months ago
Wellordering Proofs for Metapredicative Mahlo
In this article we provide wellordering proofs for metapredicative systems of explicit mathematics and admissible set theory featuring suitable axioms about the Mahloness of the u...
Thomas Strahm
SCL
2008
76views more  SCL 2008»
13 years 11 months ago
Probabilistic output admissible set for systems with time-varying uncertainties
This paper considers time-varying uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set. This set consists of the initial ...
Takeshi Hatanaka, Kiyotsugu Takaba
AUTOMATICA
2008
78views more  AUTOMATICA 2008»
13 years 11 months ago
Exact determinations of the maximal output admissible set for a class of nonlinear systems
This paper is concerned with obtaining necessary and sufficient conditions for fulfilling specified state and control pointwise-in-time constraints against a certain class of nonli...
Kenji Hirata, Yoshito Ohta
ANTS
1998
Springer
114views Algorithms» more  ANTS 1998»
14 years 3 months ago
Dense Admissible Sets
Call a set of integers {b1, b2, . . . , bk} admissible if for any prime p, at least one congruence class modulo p does not contain any of the bi. Let (x) be the size of the largest...
Daniel M. Gordon, Eugene R. Rodemich