Result 1 to 20 of 62 total
Low cardinality admissible meshes on quadrangles, triangles and disks. (English)
Math. Inequal. Appl. 15, No. 1, 229-235 (2012).
1
On optimal polynomial meshes. (English)
J. Approx. Theory 163, No. 9, 1107-1124 (2011).
2
Polynomial interpolation and cubature over polygons. (English)
J. Comput. Appl. Math. 235, No. 17, 5232-5239 (2011).
3
Maintaining limited-range connectivity among second-order agents. (English)
SIAM J. Control Optim. 48, No. 1, 187-205 (2009).
4
Explicit robust model predictive control using recursive closed-loop prediction. (English)
Int. J. Robust Nonlinear Control 16, No. 11, 519-546 (2006).
5
The theory of the metarecursively enumerable degrees. (English)
J. Math. Log. 6, No. 1, 49-68 (2006).
6
On mutually coherent enumerations of countable sets. (English)
Georgian Math. J. 12, No. 4, 671-678 (2005).
7
On the relationship between fixed points and iteration in admissible set theory without foundation. (English)
Arch. Math. Logic 44, No. 5, 561-580 (2005).
8
$Σ$-admissible families over linear orders. (Russian ;English)
Algebra Logika 41, No. 2, 228-252 (2002); translation in Algebra Logic 41, No. 2, 127-139 (2002).
9
Computability over models of decidable theories. (English)
Algebra Logika 39, No.2, 170-197 (2000); translation in Algebra Logic 39, No.2, 98-113 (2000).
10
Sigma predicates of finite types. (English)
Spreen, Dieter (ed.), Domains IV. Workshop, Haus Humboldtstein, Remagen-Rolandseck, Germany, October 2-4, 1998. Amsterdam: Elsevier, Electronic Notes in Theoretical Computer Science. 35, no pag., electronic only (2000).
11
Intersections of sequences of ideals generated by polynomials. (English)
J. Pure Appl. Algebra 131, No.1, 1-12 (1998).
12
Dense admissible sets. (English)
Buhler, J. P. (ed.), Algorithmic number theory. 3rd international symposium, ANTS-III, Portland, OR, USA, June 21‒25, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1423, 216-225 (1998).
13
On robust aggregation procedures. (English)
Bouchon-Meunier, Bernadette (ed.), Aggregation and fusion of imperfect information. Heidelberg: Physica-Verlag. Stud. Fuzziness Soft Comput. 12, 3-10 (1998).
14
The uniformization property in hereditary finite superstructures. (English)
Sib. Adv. Math. 7, No.1, 123-131 (1997).
15
On the proof-theoretic strength of monotone induction in explicit mathematics. (English)
Ann. Pure Appl. Logic 85, No.1, 1-46 (1997).
16
Definability and computability. Transl. from the Russian. (English)
Siberian School of Algebra and Logic. New York, NY: Consultants Bureau. xiv, 264 p. \$ 95.00 (1996).
17
Recent advances in ordinal analysis: $Π\sb 2\sp 1 - \bold C\bold A$ and related systems. (English)
Bull. Symb. Log. 1, No.4, 468-485 (1995).
18
Admissible proof theory and beyond. (English)
Prawitz, D. (ed.) et al., Logic, methodology and philosophy of science IX. Proceedings of the ninth international congress of logic, methodology and philosophy of science, Uppsala, Sweden, August 7-14, 1991. Amsterdam: North-Holland. Stud. Logic Found. Math. 134, 123-147 (1994).
19
Definability and infinitely deep languages. (English)
Annales Academiæ Scientiarum Fennicæ. Series A I. Mathematica. Dissertationes. 89. Helsinki: Suomalainen Tiedeakatemia. 62 p. Fmk 28.00 (1993).
20
Result 1 to 20 of 62 total
Start
Contact
Print
General Help
