che-chandler.de

Effective Mathematics of the Uncountable

Classical computable model theory is most naturally concerned with countable domains. There are, ...

Effective Mathematics of the Uncountable

Classical computable model theory is most naturally concerned with countable domains. There are, ...

Computability and Complexity

This Festschrift is published in honor of Rodney G. Downey, eminent logician and computer sc...

Role of True Finiteness in the Admissible Recursively Enumerable Degrees

When attempting to generalize recursion theory to admissible ordinals, it may seem as if all clas...

A Hierarchy of Turing Degrees

Computability theory is a branch of mathematical logic and computer science that has become incre...

The World According to Tomdispatch

From America's most influential political blog, a grand survey of the world since 9 11

Algebraic Curves and Riemann Surfaces for Undergraduates

The theory relating algebraic curves and Riemann surfaces exhibits the unity of mathematics: topo...

ASPECTS OF COMPUTATION AND AUTOMATA THEORY WITH APPLICATIONS

Aspects Of Computation And Automata Theory With Applications

This volume results from two programs that took place at the Institute for Mathematical Sciences ...

Computability and Complexity

This Festschrift is published in honor of Rodney G. Downey, eminent logician and computer scienti...

Algebraic Curves and Riemann Surfaces for Undergraduates

The theory relating algebraic curves and Riemann surfaces exhibits the unity of mathematics: topo...

Effective Mathematics of the Uncountable

Classical computable model theory is most naturally concerned with countable domains. There are, ...