1  20
Next
Number of results to display per page
1. The Ins and Outs of Predication [2017]
 Berlin/Boston : De Gruyter, Inc., 2017.
 Description
 Book — 1 online resource (232 pages).
 Summary

 Intro; Preface; Table of Contents; A typology of entities; Modal shifts and predication types; Nonrestrictive relatives and the representation of complex sentences; Clause structure and modality in Functional Grammar; On zero terms and negative polarity; 'True' reflexives and pseudoreflexives with particular reference to SerboCroatian; Nominalization and basic constituent ordering; A cognitivepragmatic reconsideration of negative raising; Voice in Ancient Greek: Reflexives and passives; The possessive dative in Dutch: syntactic reanalysis and predicate formation.
 A representation of Latin relative clausesInfinitive incorporation; Functional Grammar as a formal language; References; Author index; Language index; Subject index.
 Bers Colloquium (1st : 1995 : City University of New York. Graduate School and University Center)
 Providence, R.I. : American Mathematical Society, c1997.
 Description
 Book — viii, 479 p. : ill. ; 26 cm.
 Summary

 Computing the DouadyEarle extension by W. Abikoff and T. Ye Selected problems in Kleinian groups and hyperbolic geometry by A. Basmajian The law of the iterated logarithm for Kleinian groups by C. J. Bishop and P. W. Jones WeilPetersson geometry and determinant bundles on inductive limits of moduli spaces by I. Biswas and S. Nag Iteration of mapping classes on a Bers slice: examples of algebraic and geometric limits of hyperbolic 3manifolds by J. F. Brock Lattice constants and a lemma of Zagier by C. Cao, F. W. Gehring, and G. J. Martin The quasiFuchsian space of fourpunctured spheres by Y. Chiang Approximating $L^2$ invariants of amenable covering spaces: A heat kernel approach by J. Dodziuk and V. Mathai Random walks on circle packings by T. Dubejko Some maximal holomorphic motions by C. J. Earle Vector fields for holomorphic motions of closed sets by C. J. Earle, F. P. Gardiner, and N. Lakic Theta constant identities with applications to combinatorial number theory by H. M. Farkas and I. Kra The topology of real projective structures by D. M. Gallo A discreteness condition for subgroups of $PSL(2, {\mathbfC})$ by J. Gilman On principally polarized abelian varieties and Riemann surfaces associated to prisms and pyramids by V. GonzalezAguilera and R. E. Rodriguez Schur products of certain polynomials by A. Hinkkanen Inverse problems for fluid flows with a moving boundary by Y. E. Hohlov and D. Y. Kleinbock On rigidity of onedimensional maps by Y. Jiang Twist maps and AubryMather sets by Y. Katznelson and D. S. Ornstein How to bend pairs of punctured tori by L. Keen and C. Series Lipman Bers, complex analyst by I. Kra and B. Maskit Strebel points by N. Lakic Remarks on $m$symmetric Riemann surfaces by B. Maskit Quasiconformal mappings of CarnotCaratheodory spaces by G. D. Mostow Lipman Bers and partial differential equations by L. Nirenberg Irrational rotations by D. J. Pinchbeck $\mu$homeomorphisms by U. Srebro and E. Yakubov.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request 
QA331 .B424 1995  Available 
 Trudy Vsesoi͡uznoĭ shkoly po teorii funkt͡sii. English
 Vsesoi͡uznai͡a shkola po teorii funkt͡siĭ (1989 : Miass, Russia)
 Providence, R.I. : American Mathematical Society, 1994.
 Description
 Book — vii, 255 p. ; 26 cm.
 Summary

 Best approximation of translation invariant unbounded operators by bounded linear operators by V. V. Arestov On the order of approximation of the Sobolev class $W_q^r$ by bilinear forms in $L_p$ for $1\le q\le 2\le p\le \infty$ by M.B. A. Babaev Asymptotic and extremal properties of orthogonal polynomials in the presence of singularities in the weight by V. M. Badkov Approximation by splines on an infinite interval by Yu. S. Vasilev On estimates of Gaussian sums and Waring's problem for a prime modulus by S. V. Konyagin Spline interpolation of functions of several variables, and bases in Sobolev spaces by O. V. Matveev On errors of parallelepiped cubature formulas on classes of differentiable functions by A. V. Reztsov On divergence of Fourier series in rearranged Price systems by V. V. Tarkaev On asymptotically monogenic functions by D. S. Telyakovskii On approximation of differentiable functions of high smoothness by Fourier sums by S. A. Telyakovskii On some thin sets in the theory of functions and topology by N. N. Kholshchevnikova Widths and an inequality of Jackson type for abstract functions by I. G. Tsarkov Jackson's inequality in $L_p(0,2\pi)$ $(1\le p<2)$ with sharp constant by N. I. Chernykh Lower estimates of the widths of some classes of periodic functions by V. T. Shevaldin.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request 
QA1 .A413 V.198  Available 
 Teorii͡a funkt͡siĭ. English
 Vsesoi͡uznai͡a shkola po teorii funkt͡siĭ (1987 : Amberd, Armenian S.S.R.).
 Providence, R.I. : American Mathematical Society, 1992.
 Description
 Book — 265 p.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request 
QA1 .A413 V.190  Available 
 Sbornik trudov Vsesoi͡uznoĭ shkoly po teorii funkt͡siĭ, Dushanbe, avgust 1986 g. English
 Vsesoi͡uznai͡a shkola po teorii funkt͡siĭ (1986 : Dushanbe, Tajik S.S.R.)
 Providence, R.I. : American Mathematical Society, c1991.
 Description
 Book — vii, 234 p. ; 27 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request 
QA1 .A413 V.189  Available 
 International Conference on Constructive Function Theory (1981 : Varna, Bulgaria)
 Sofii͡a : Izdvo Bolgarskoĭ akademii nauk, 1983.
 Description
 Book — 598 p. ; 25 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request 
QA331 .I5833 1981  Available 
 International Conference on Constructive Function Theory (1970 : Golden Sands, Varna)
 Sofiia, Izdvo Bulgarskoi akademii nauk, 1972.
 Description
 Book — 363 p. 25cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request 
QA331 .I5833 1970  Available 
 International Symposium on Generalized Convexity/Monotonicity (8th : 2005 : Varese, Italy)
 Berlin ; New York : Springer, c2007.
 Description
 Book — ix, 469 p.
 International Symposium on Generalized Convexity/Monotonicity (7th : 2002 : Hanoi, Vietnam)
 New York : Springer, c2005.
 Description
 Book — x, 350 p. : ill.
 International Symposium on Generalized Convexity/Monotonicity (6th : 1999 : Samos, Greece)
 Berlin ; New York : Springer, c2001.
 Description
 Book — ix, 410 p. : ill. ; 24 cm.
 Summary

 From the contents: Invited Papers: Minimization of the Sum of Several Linear Fractional Functions. Discrete Higher Order Convex Functions and their Applications. Cuts and Semidefinite Relaxations for Nonconvex Quadratic Problems. Contributed Papers.The complete table of contents can be found on the Internet:http://www.springer.de.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request 
QA331.5 .I595 1999  Available 
 Conference on Computability in Europe (7th : 2011 : Sofia, Bulgaria)
 Berlin ; New York : Springer, c2011.
 Description
 Book — 1 online resource (xiii, 318 p.)
 Online

 dx.doi.org SpringerLink
 Google Books (Full view)
 Providence, R.I. : American Mathematical Society ; Cambridge [Mass.] : Clay Mathematics Institute, c2011.
 Description
 Book — viii, 647 p. : ill. ; 26 cm.
 Online
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Stacks  
QA246 .O53 2007  Unknown 
 Conference on Computability in Europe (6th : 2010 : Ponta Delgada, Azores)
 Berlin : Springer, c2010.
 Description
 Book — xvi, 450 p. : ill.
 Summary

 Avoiding Simplicity Is Complex. HigherOrder Containers. On the Completeness of Quantum Computation Models. The Ordinal of Skolem + Tetration Is ? 0. Proofs, Programs, Processes. ErgodicType Characterizations of Algorithmic Randomness. How Powerful Are IntegerValued Martingales?. A Faster Algorithm for Finding Minimum Tucker Submatrices. Processes in Space. Computability of Countable Subshifts. The Limits of Tractability in ResolutionBased Propositional Proof Systems. Haskell before Haskell: Curry's Contribution to Programming (19461950). A Miniaturisation of Ramsey's Theorem. Graph Structures and Algorithms for QueryLog Analysis. On the Complexity of Local Search for Weighted Standard Set Problems. Computational Interpretations of Analysis via Products of Selection Functions. The Peirce Translation and the Double Negation Shift. Counting the Changes of Random
 Sets. Boole: From Calculating Numbers to Calculating Thoughts. Approximability and Hardness in Multiobjective Optimization.
 Is Not a Heyting Algebra. Lower Bounds for Reducibility to the Kolmogorov Random Strings. Spatial Models for Virtual Networks. DNA Rearrangements through Spatial Graphs. On Index Sets of Some Properties of Computable Algebras. The Strength of the BesicovitchDavies Theorem. Circuit Complexity and Multiplicative Complexity of Boolean Functions. Definability in the Subword Order. Undecidability in Weihrauch Degrees. Degrees with Almost Universal Cupping Property. Incomputability in Physics. Approximate Selfassembly of the Sierpinski Triangle. Hairpin Lengthening. Infinities in Quantum Field Theory and in Classical Computing: Renormalization Program. Computational Complexity Aspects in Membrane Computing. Computable Ordered Abelian Groups and Fields. Focusing in Asynchronous Games. A Note on the Least Informative Model of a Theory. Three Roots for Leibniz's Contribution to the Computational Conception of Reason. Development of a Bacteria Computer: From in silico Finite Automata to in vitro and in vivo. The Complexity of Explicit Constructions. Kolmogorov Complexity Cores. Every Set Is Natural, Up to Turing Equivalence. Computable Fields and Weak TruthTable Reducibility. What Is the Problem with Proof Nets for Classical Logic?. Quasilinear Dialectica Extraction. Computing with Concepts, Computing with Numbers: Llull, Leibniz, and Boole. Inference Concerning Physical Systems.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online

 dx.doi.org SpringerLink
 Google Books (Full view)
14. The Conference on LFunctions [electronic resource] : Fukuoka, Japan, 1823 February 2006 [2007]
 Conference on LFunctions (2006 : Fukuokaken, Japan)
 Singapore ; Hackensack, N.J. : World Scientific, c2007.
 Description
 Book — x, 370 p. : ill.
 Summary

 Quantum Maass Forms (R Bruggeman) invariant of pAdic LFunctions (H Hida) Siegel Modular Forms of Weight Three and Conjectural Correspondence of Shimura Type and Langlands Type (T Ibukiyama) Convolutions of Fourier Coefficients of Cusp Forms and the Circle Method (M Jutila) On an Extension of the Derivation Relation for Multiple Zeta Values (M Kaneko) On Symmetric Powers of Cusp Forms on GL2 (H H Kim) Zeta Functions of Root Systems (Y Komori et al.) Sums of Kloosterman Sums Revisted (Y Motohashi) The Lindelof Class of LFunctions (K Murty) A Proof of the Riemann Hypothesis for the Weng Zeta Function of Rank
 3 for the Rationals (M Suzuki) Elliptic Curves Arising from the Spectral Zeta Function for NonCommutative Harmonic Oscillators and 0(4)Modular Forms (K Kimoto & M Wakayama) A Geometric Approach to LFunctions (L Weng).
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Conference on Computability in Europe (2nd : 2006 : Swansea, Wales)
 Berlin : Springer, 2006.
 Description
 Book — xv, 608 p. : ill.
 Conference on Computability in Europe (2nd : 2006 : Swansea, Wales)
 Berlin ; New York : Springer, 2006.
 Description
 Book — xv, 608 p. : ill. ; 24 cm.
 Summary

This book constitutes the refereed proceedings of the Second International Conference on Computability in Europe, CiE 2006, held in Swansea, UK, in June/July 2006. The 31 revised full papers presented together with 30 invited papers were carefully reviewed and selected from about 80 submissions. Among them are papers corresponding to 8 plenary talks and papers of 6 special sessions entitled proofs and computation, computable analysis, challenges in complexity, foundations of programming, mathematical models of computers and hypercomputers, and Godel centenary: Godel's legacy for computability.
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request 
QA9.59 .C67 2006  Available 
 Conference on Computability in Europe (1st : 2005 : Amsterdam, Netherlands)
 Berlin ; New York : Springer, c2005.
 Description
 Book — xvii, 574 p. : ill. (some col.).
 Conference on Computability in Europe (1st : 2005 : Amsterdam, Netherlands)
 Berlin ; New York : Springer, c2005.
 Description
 Book — xvii, 574 p. : ill. ; 24 cm.
 Summary

This book constitutes the refereed proceedings of the first International Conference on Computability in Europe, CiE 2005, held in Amsterdam, The Netherlands in June 2005. The 68 revised full papers presented were carefully reviewed and selected from 144 submissions. Among them are papers corresponding to two tutorials, six plenary talks and papers of six special sessions involving mathematical logic and computer science at the same time as offering the methodological foundations for models of computation. The papers address many aspects of computability in Europe with a special focus on new computational paradigms. These include first of all connections between computation and physical systems (e.g., quantum and analog computation, neural nets, molecular computation), but also cover new perspectives on models of computation arising from basic research in mathematical logic and theoretical computer science.
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request 
QA9.59 .C67 2005  Available 
 Providence, R.I. : American Mathematical Society, c2000.
 Description
 Book — xvi, 320 p. : ill. ; 26 cm.
 Summary

 Randomness in computability theory by K. AmbosSpies and A. Kucera Open questions about the $n$c.e. degrees by M. Arslanov The theory of numberings: Open problems by S. Badaev and S. Goncharov $\mathrm{\Pi}^0_1$ classes
 Structure and applications by D. Cenzer and C. G. Jockusch, Jr. The global structure of computably enumerable sets by P. A. Cholak Computability theory in arithmetic: Provability, structure and techniques by C. T. Chong and Y. Yang How many Turing degrees are there? by R. Dougherty and A. S. Kechris Questions in computable algebra and combinatorics by R. Downey and J. B. Remmel Issues and problems in reverse mathematics by H. Friedman and S. G. Simpson Open problems in the theory of constructive algebraic systems by S. Goncharov and B. Khoussainov Independence results from ZFC in computability theory: Some open problems by M. Groszek Problems related to arithmetic by J. F. Knight Embeddings into the computably enumerable degrees by M. Lerman Definability in the c.e. degrees: Questions and results by A. Nies Strong reducibilities, again by P. Odifreddi Finitely axiomatizable theories and Lindenbaum algebras of semantic classes by M. Peretyat'kin Towards an analog of Hilbert's tenth problem for a number field by A. Shlapentokh Natural definability in degree structures by R. A. Shore Recursion theory in set theory by T. A. Slaman Extensions, automorphisms, and definability by R. I. Soare Open problems in the enumeration degrees by A. Sorbi.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request 
QA9.59 .C66 1999  Available 
 Providence, R.I. : American Mathematical Society, c1992.
 Description
 Book — 259 p.
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request 
QA353 .H9 H97 1992  Available 
Articles+
Journal articles, ebooks, & other eresources
 Articles+ results include