#### Filter Results:

- Full text PDF available (38)

#### Publication Year

1937

2014

- This year (0)
- Last 5 years (2)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Fred Richman, Fred Richman
- 2000

Is it reasonable to do constructive mathematics without the axiom of countable choice? Serious schools of constructive mathematics all assume it one way or another, but the arguments for it are not compelling. The fundamental theorem of algebra will serve as an example of where countable choice comes into play and how to proceed in its absence. Along theâ€¦ (More)

- Fred Richman, Michel J. Blais's
- 1990

I was inspired, not to say provoked, to write this note by Michel J. Blais's article A pragmatic analysis of mathematical realism and intuitionism [2]. Having spent the greater part of my career doing intuitionistic mathematics, while continuing to do classical mathematics, I have come to feel that most comparisons of these two approaches to mathematicsâ€¦ (More)

- Aaron Meyerowitz, Fred Richman, Elbert A. Walker
- International Journal of Uncertainty, Fuzzinessâ€¦
- 1994

A common procedure for selecting a particular density from a given class of densities is to choose one with maximum entropy. The problem addressed here is this. Let S be a Â…nite set and let B be a belief function on 2 . Then B induces a density on 2 , which in turn induces a host of densities on S. Provide an algorithm for choosing from this host ofâ€¦ (More)

- Fred Richman
- Math. Log. Q.
- 2008

A notion of completeness and completion suitable for use in the absence of countable choice is developed. This encompasses the construction of the real numbers as well as the completion of an arbitrary metric space. The real numbers are characterized as a complete archimedean Heyting Â…eld, a terminal object in the category of archimedean Heyting Â…elds.

- Douglas S. Bridges, Fred Richman, Peter Schuster
- Ann. Pure Appl. Logic
- 1999

- Lee C. Klingler, Spyros S. Magliveras, Fred Richman, Michal Sramka
- Computing
- 2009

We present group-theoretic and cryptographic properties of a generalization of the traditional discrete logarithm problem from cyclic to arbitrary finite groups. Questions related to properties which contribute to cryptographic security are investigated, such as distributional, coverage and complexity properties. We show that the distribution of elements inâ€¦ (More)

- Fred Richman
- J. Philosophical Logic
- 2000

- Fred Richman
- 2010

- Fred Richman
- 2007

At the center of the theory of abelian p-groups are the classical theorems of Ulm, Zippin and Kaplansky, going back to the thirties, that classify countable p-groups by their Ulm invariants: the uniqueness theorem is referred to as Ulm's theorem, the existence theorem as Zippin's theorem. For each ordinal , the -th Ulm invariant of G can be de ned as theâ€¦ (More)