Fast-growing hierarchy - PDFSEARCH.IO - Document Search Engine

Fast-growing hierarchy
Results: 9

#	Item
1	A LIGHTFACE ANALYSIS OF THE DIFFERENTIABILITY RANK LINDA BROWN WESTRICK Abstract. We examine the computable part of the differentiability hierarchy defined by Kechris and Woodin. In that hierarchy, the rank of a differen Add to Reading List Source URL: www.math.uconn.edu Language: English - Date: 2014-10-24 11:30:43 Ordinal numbers Proof theory Computability theory Mathematical notation Ordinal notation Continuous function Constructible universe Limit of a function Symbol NC Computable number Fast-growing hierarchy
2	On the asymptotic behavior of odd operators Ulrich Kohlenbach∗ Department of Mathematics Technische Universit¨at Darmstadt Schlossgartenstraße 7, 64289 Darmstadt, Germany 3. May 2011, some typos corrected 10. Dec. 20 Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Language: English - Date: 2013-12-10 15:08:50 Symbol Fourier analysis Table of stars with Bayer designations Fast-growing hierarchy
3	Bounding changes in probability over time: It is unlikely that you will change your mind very much very often Ernest Davis Dept. of Computer Science New York University Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2013-11-10 13:18:29 Valuation Proof theory Ordinal numbers Logic Transcendental numbers Fast-growing hierarchy Approximately finite dimensional C*-algebra Mathematics Mathematical logic Constructible universe
4	TOWARDS MECHANICAL LEVEL OF DETAIL FOR KNITWEAR SIMULATION Olivier Nocent, Jean-Michel Nourrit, Yannick Remion Laboratoire d’Etudes et de Recherches Informatiques, Université de Reims Champagne-Ardenne, Rue des crayè Add to Reading List Source URL: wscg.zcu.cz Language: English - Date: 2000-12-22 08:51:42 Ordinal numbers Proof theory Fast-growing hierarchy Ordinal arithmetic Mathematical logic Mathematics Continuous function
5	Appendix [Margins, Kernels and Non-linear Smoothed Perceptrons] 1. Unified Proof By Induction of Lemma 5, 8: Lµk (αk ) ≤ − 12 kpk k2G Let d(p) be 1-strongly convex with respect to the #-norm, ie d(q) − d(p) − Add to Reading List Source URL: jmlr.org Language: English - Date: 2014-03-18 20:13:21 Operator theory Mathematics Fast-growing hierarchy Isotope lists 73-96 Constructible universe Connection Fiber bundles
6	COVERING FOR CATEGORY AND TRIGONOMETRIC THIN SETS ˇ PETER ELIAS Abstract. In this work we consider several combinatorial principles satisfied for cardinals smaller than cov(M), the covering number of the ideal of first Add to Reading List Source URL: www.saske.sk Language: English - Date: 2012-02-20 06:06:19 Ordinal number Set theory Automata theory Fast-growing hierarchy Wreath product Mathematics Abstract algebra Mathematical logic
7	TWO MORE PERFECTLY NORMAL NON-METRIZABLE MANIFOLDS Add to Reading List Source URL: www.auburn.edu Language: English - Date: 2005-06-11 12:18:30 Topological spaces Constructible universe First uncountable ordinal Set theory Proof theory Ordinal arithmetic Fast-growing hierarchy Ordinal numbers Mathematical logic Mathematics
8	Infinite sets that admit fast exhaustive search Mart´ın Escard´o School of Computer Science, University of Birmingham, UK Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2007-03-27 09:33:39 Theoretical computer science Models of computation Lambda calculus Symbol Function Curry–Howard correspondence Fast-growing hierarchy Mathematics Mathematical logic Computability theory
9	PDF Document Add to Reading List Source URL: arxiv.org Language: English - Date: 2008-08-27 17:25:52 General topology Continuous function Ordinal number Weak topology Arzelà–Ascoli theorem Function Open set Locally convex topological vector space Fast-growing hierarchy Topology Mathematics Mathematical analysis