# Browse by Subject "Mathematics"

• (1959)

application/pdf

PDF (4Mb)
• (1980)
It is known that many decision problems are unsolvable in the class of all finitely presented groups. When the class of groups is restricted, problems previously unsolvable can become solvable. In this work we investigate ...

application/pdf

PDF (4Mb)
• (1977)

application/pdf

PDF (2Mb)
• (1967)

application/pdf

PDF (1Mb)
• (1969)

application/pdf

PDF (1Mb)
• (1973)

application/pdf

PDF (2Mb)
• (1968)

application/pdf

PDF (2Mb)
• (1954)

application/pdf

PDF (1Mb)
• (1971)

application/pdf

PDF (986Kb)
• (1988)
In The Nature of Mathematical Knowledge (1984) Philip Kitcher develops an exciting and insightful picture of arithmetical reality by considering mathematical activities--not objects--as ontologically primitive. Yet, his ...

application/pdf

PDF (7Mb)
• (1992)
A theory T admits elimination of imaginaries (EI) if every definable equivalence relation $\sim$ is the kernel of a definable map f. (I.e., $\vec{x}\sim\vec{y}\Longleftrightarrow f(\vec{x})=f(\vec{y}).)$ This term was ...

application/pdf

PDF (5Mb)
• (1987)
Consider the second order non-linear differential operator ${\cal L}y$ = Ly + $\eta y\sp3$, where $\eta$ = $\pm$1 and L, the linear part of ${\cal L}$, is of the form Ly = $y\sp{\prime\prime}$ + $p(x)y\sp\prime$ + q(x)y. ...

application/pdf

PDF (2Mb)
• (1977)

application/pdf

PDF (3Mb)
• (1960)

application/pdf

PDF (795Kb)
• (1967)

application/pdf

PDF (2Mb)
• (1961)

application/pdf

PDF (938Kb)
• (1968)

application/pdf

PDF (2Mb)
• (1970)

application/pdf

PDF (1Mb)
• (1996)
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. This thesis gives two constructions for large spherical codes that may be used for channel coding and for source coding. ...

application/pdf

PDF (5Mb)
• (1988)
I consider algebraic relations between explicitly presented analytic functions with particular emphasis on Tarski's high school algebra problem.

application/pdf

PDF (5Mb)