Mathematics Commons^™

Mathematical Rebuses, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

A Special Class Of Almost Disjoint Families, Thomas E. Leathrum

Dartmouth Scholarship

The collection of branches (maximal linearly ordered sets of nodes) of the tree ${}^{<\omega}\omega$ (ordered by inclusion) forms an almost disjoint family (of sets of nodes). This family is not maximal -- for example, any level of the tree is almost disjoint from all of the branches. How many sets must be added to the family of branches to make it maximal? This question leads to a series of definitions and results: a set of nodes is {\it off-branch} if it is almost disjoint from every branch in the tree; an {\it off-branch family} is an almost disjoint family of off-branch sets; ${\frak o}=\min\{|{\Cal O}|: {\Cal O}$ is a maximal off-branch family$\}$. Results concerning $\frak o$ include: (in ZFC) ${\frak a}\leq{\frak o}$, and (consistent with ZFC) $\frak o$ is not equal to any of the standard small cardinal invariants $\frak b$, $\frak a$, $\frak d$, or ${\frak c}=2^\omega$. Most of these consistency results use standard forcing notions -- for example, $Con({\frak b}={\frak a}<{\frak o}={\frak d}={\frak c})$ comes from starting with a model of $ZFC+CH$ and adding $\omega_2$-many Cohen reals. Many interesting open questions remain, though -- for example, $Con({\frak o}<{\frak d})$.

A Partial "Squeezing Theorem" For A Particular Class Of Many-Valued Logics, Stephen Michael Walk

Dissertations and Theses @ UNI

The problem to be studied for this thesis was that of whether the usual statement calculus is a suitable formal system for every many-valued logic in a particular collection of logics. The logics in question are those that fall between the usual two-valued logic and a modified form of the Lukasiewicz-Tarski three-valued logic.

Since this betweenness relationship was an original concept and appeared nowhere in the literature, the first goal in the research plan was to define this relationship precisely. Preliminary concepts included truth value mapping and forgivingness of logics, concepts that, like betweenness, are original to this paper and …

Splitting Theorems In Recursion Theory, Rod G. Downey, Michael Stob

University Faculty Publications and Creative Works

A splitting of an r.e. set A is a pair A1, A2 of disjoint r.e. sets such that A1 ∪ A2 = A. Theorems about splittings have played an important role in recursion theory. One of the main reasons for this is that a splitting of A is a decomposition of A in both the lattice, ε, of recursively enumerable sets and in the uppersemilattice, R, of recursively enumerable degrees (since A1 ≤T A, A2 ≤T A and A ≤T A1 ⊕ A2). Thus splitting theor ems have been used to obtain results about the structure of ε, the structure …

Friedberg Splittings Of Recursively Enumerable Sets, Rod G. Downey, Michael Stob

University Faculty Publications and Creative Works

A splitting A1{square cup}A2 = A of an r.e. set A is called a Friedberg splitting if for any r.e. set W with W - A not r.e., W - Ai≠0 for i = 1,2. In an earlier paper, the authors investigated Friedberg splittings of maximal sets and showed that they formed an orbit with very interesting degree-theoretical properties. In the present paper we continue our investigations, this time analyzing Friedberg splittings and in particular their orbits and degrees for various classes of r.e. sets.

On Matching Ann Structure To Problem Domain Structure, George G. Lendaris, Martin Zwick, Karl Mathia

Complex Systems Faculty Publications and Presentations

To achieve reduced training time and improved generalization with artificial neural networks (ANN, or NN), it is important to use a reduced complexity NN structure. A "problem" is defined by constraints among the variables describing it. If knowledge about these constraints could be obtained a priori, this could be used to reduce the complexity of the ANN before training it. Systems theory literature contains methods for determining and representing structural aspects of constrained data (these methods are herein called GSM, general systems method). The suggestion here is to use the GSM model of the given data as a pattern for …

Only Problems, Not Solutions! (Fourth Edition), Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

Proof In Law And Science, David H. Kaye

Faculty Scholarship

This article addresses proof in both science and law. Both disciplines utilize proof of facts and proof of theories, but for different purposes and, consequently, in different ways. Some similarities exist, however, in how both disciplines use a series of premises followed by a conclusion to form an argument, and thus constitute a logic. This article analyzes the ways in which legal logic and scientific logic differ. Finding facts in law involves the same logic but quite different procedures than scientific fact-finding. Finding, or rather constructing, the law is also very different from scientific theorizing. But such differences do not …

De Re And De Dicto, Thomas Jager

University Faculty Publications and Creative Works

No abstract provided.

Competing Risks In Parallel And Series Systems, Lloyd R. Jaisingh

Morehead State Theses and Dissertations

A research paper written by Lloyd R. Jaisingh of the Department of Mathematical Sciences at Morehead State University on November 24, 1987.

Improving The Lower Bound For The Reliability When The Strength Distribution Is Gamma And The Stress Distribution In Chi-Square, Lloyd R. Jaisingh

Morehead State Theses and Dissertations

A research paper written by Lloyd R. Jaisingh of the Department of Mathematical Sciences at Morehead State University in August of 1987.

Structural Interactions Of The Recursively Enumerable T- And W-Degrees, Rod G. Downey, Michael Stob

University Faculty Publications and Creative Works

No abstract provided.

Aggregating Inductive Expertise, Daniel N. Osherson, Michael Stob, Scott Weinstein

University Faculty Publications and Creative Works

The aggregation problem is to design an inferential agent that makes intelligent use of the theories offered by a team of inductive inference machines working in a common environment. The present paper formulates several versions of the aggregation problem and investigates them from a recursion theoretic point of view.

Generalisations Et Generalites, Florentin Smarandache, Eleonora Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

"Généralisations et Généralités" , pourquoi ce titre? Parce Que l'auteur a voulu rassembler ici Quelques-unes de ses recherches originales C Qui sont donc des "s~n:§rali tés") , df'2ls diverses branches des mathématiques (algèl)re, thôorie des nombres, Gométrie, analyse, linguistique, mathématiQues distrayantes) , mêlne si les articles qui composent ce recueil n'ont pas toujours de liaison entre eux.

The Intervals Of The Lattice Of Recursively Enumerable Sets Determined By Major Subsets, Wolfgang Maass, Michael Stob

University Faculty Publications and Creative Works

No abstract provided.

On Measures And Distinguishability, Gregory Mellema

University Faculty Publications and Creative Works

No abstract provided.

An Actualistic Semantics For Quantified Modal Logic, Thomas Jager

University Faculty Publications and Creative Works

No abstract provided.

Axiomatic Structure And The Method Of Analysis: Shifting Styles In The History Of Mathematics, Calvin Jongsma

Faculty Work Comprehensive List

No abstract provided.

An Alternative Semantics For Knowledge, Gregory Mellema

University Faculty Publications and Creative Works

No abstract provided.

Finite Topologies And Boolean Matrices, Jon Michael Kelley

Morehead State Theses and Dissertations

A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in the Department of Mathematics at Morehead State University by Jon Michael Kelley in July of 1974.

Probable Circular Error (Cep) Of Ballistic Missiles, James Edward Moran Jr.

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The survival of our nation, during a nuclear exchange, depends upon an effective national defense structure. The prime weapon system in this defense structure is the ballistic missile. Although many factors enter into an evaluation of the effectiveness of a ballistic missile, one of the most important measure is accuracy. Without an accurate weapon system we have no weapon system.

The Department of Defense has places emphasis on using a method of accuracy evaluation called "Probably Circular Error (CEP)." Probably Circular Error is defined as "The radius of a circle, centered at the intended target, within which 50% of the …

Error Structure Of Randomized Design Under Background Correlation With A Missing Value, Tseng-Chi Chang

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The analysis of variance technique is probably the most popular statistical technique used for testing hypotheses and estimating parameters. Eisenhart (12) presents two classes of problems solvable by the analysis of variance and the assumption underlying each class. Cochran (9) lists the assumptions and also discusses the consequences when these assumptions are not met. It is evident that if all the assumptions are not satisfied, the confidence placed in any result obtained in this manner is adversly affected to varying degrees according to the extent of the violation.

Investigation Of The Properties Of The Iterations Of A Homeomorphism On A Metric Space, Murray B. Peterson, Jr.

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Considerable study has been made concerning the properties of the iterations of a homeomorphism on a metric space. Much of this material is scattered throughout the literature and understood solely by a specialist. The main object of this paper is to put into readable form proofs of theorems found in G.T. Whyburn's "Analytic Topology" pertaining to this topic in topology. Properties of the decomposition space of point-orbits induced by the iterations of a homeomorphism will compose a major part of the study. Some theorems will be established through series of lemmas required to fill in much of the detail lacking …