PDF Document

Source URL: www.ma.huji.ac.il

• Model theory
• Mathematical structures
• Mathematical logic
• Complexity classes
• Computability theory
• Equivalence relation
• Structure
• FO
• Metric space
• Arithmetical hierarchy
• Definable set
• Mutation

On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness Ulrich Kohlenbach BRICSy

Source URL: www.mathematik.tu-darmstadt.de

• Complexity classes
• Computability theory
• Effective descriptive set theory
• Arithmetical hierarchy
• Hierarchy
• FO

Journal de Th´eorie des Nombres de Bordeaux), 45–59 On the Delta set of a singular arithmetical congruence monoid par Paul BAGINSKI, Scott T. CHAPMAN et George

Source URL: almira.math.u-bordeaux.fr

In Mathematics “It is interesting to note that as early as 1957 one of the regulations sections states that some of the questions may be set on the application of certain arithmetical processes to problems of everyday

Source URL: www.aea-europe.net

The Volume of the Fundamental Domain for Some Arithmetical Subgroups of Chevalley Groups by R.P. Langlands Let gQ be a split semisimple Lie algebra of linear transformations of the finite dimensional vector

Source URL: www.sunsite.ubc.ca

• Spectral theory of ordinary differential equations
• World glyph set
• Symbol
• Character encoding
• Digital typography

THE ITERATIVE CONCEPTION OF SET

Source URL: www.pgrim.org

• Computability theory
• Complexity classes
• Urelements
• Z notation
• S
• Naive set theory
• Constructible universe
• Arithmetical hierarchy
• Axiom of extensionality
• Mathematical logic
• Mathematics
• Set theory

Modular forms and arithmetic geometry Stephen S. Kudla1 The aim of these notes is to describe some examples of modular forms whose Fourier coefficients involve quantities from arithmetical algebraic geometry. At the mome

Source URL: www.math.toronto.edu

• Modular forms
• Riemann surfaces
• Group theory
• Theta function
• Connection
• Elliptic curve
• Symbol
• World glyph set
• Mathematical analysis
• Mathematics
• Analytic number theory

THE AUTOMORPHISM GROUP OF THE ENUMERATION DEGREES MARIYA I. SOSKOVA†

Source URL: www.fmi.uni-sofia.bg

• Philosophy of mathematics
• Turing degree
• Turing jump
• Enumeration
• Theodore Slaman
• Arithmetical set
• Computability theory
• Mathematics
• Logic

The Turing universe in the context of enumeration reducibility Mariya I. Soskova Sofia University and University of California, Berkeley A fundamental goal of computability theory is to understand the way that

Source URL: www.fmi.uni-sofia.bg

• Mathematics
• Turing degree
• Turing reduction
• Turing jump
• Enumeration
• Low
• Recursively enumerable set
• Arithmetical hierarchy
• Halting problem
• Computability theory
• Theoretical computer science
• Mathematical logic