Logic and Foundations Commons^™

Interstructure Lattices And Types Of Peano Arithmetic, Athar Abdul-Quader

Dissertations, Theses, and Capstone Projects

The collection of elementary substructures of a model of PA forms a lattice, and is referred to as the substructure lattice of the model. In this thesis, we study substructure and interstructure lattices of models of PA. We apply techniques used in studying these lattices to other problems in the model theory of PA.

In Chapter 2, we study a problem that had its origin in Simpson, who used arithmetic forcing to show that every countable model of PA has an expansion to PA^∗ that is pointwise definable. Enayat later showed that there are 2^ℵ₀ models with …

Ns-K-Nn: Neutrosophic Set-Based K-Nearest Neighbors Classifier, Florentin Smarandache, Yaman Akbulut, Abdulkadir Sengur, Yanhui Guo

Branch Mathematics and Statistics Faculty and Staff Publications

k-nearest neighbors (k-NN), which is known to be a simple and efficient approach, is a non-parametric supervised classifier. It aims to determine the class label of an unknown sample by its k-nearest neighbors that are stored in a training set. The k-nearest neighbors are determined based on some distance functions. Although k-NN produces successful results, there have been some extensions for improving its precision. The neutrosophic set (NS) defines three memberships namely T, I and F. T, I, and F shows the truth membership degree, the false membership degree, and the indeterminacy membership degree, respectively. In this paper, the NS …

The Feferman-Vaught Theorem, Mostafa Mirabi

Mostafa Mirabi

Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Luige Vladareanu

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed approach.

Complex Neutrosophic Soft Set, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Mumtaz Ali, Ganeshsree Selvachandran

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we propose the complex neutrosophic soft set model, which is a hybrid of complex fuzzy sets, neutrosophic sets and soft sets. The basic set theoretic operations and some concepts related to the structure of this model are introduced, and illustrated. An example related to a decision making problem involving uncertain and subjective information is presented, to demonstrate the utility of this model.

Complex Neutrosophic Graphs Of Type 1, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we introduced a new neutrosophic graphs called complex neutrosophic graphs of type1 (CNG1) and presented a matrix representation for it and studied some properties of this new concept. The concept of CNG1 is an extension of generalized fuzzy graphs of type 1 (GFG1) and generalized single valued neutrosophic graphs of type 1 (GSVNG1).

Joint Laver Diamonds And Grounded Forcing Axioms, Miha Habič

Dissertations, Theses, and Capstone Projects

In chapter 1 a notion of independence for diamonds and Laver diamonds is investigated. A sequence of Laver diamonds for κ is joint if for any sequence of targets there is a single elementary embedding j with critical point κ such that each Laver diamond guesses its respective target via j. In the case of measurable cardinals (with similar results holding for (partially) supercompact cardinals) I show that a single Laver diamond for κ yields a joint sequence of length κ, and I give strict separation results for all larger lengths of joint sequences. Even though the principles get …

Choice Of Choice: Paradoxical Results Surrounding Of The Axiom Of Choice, Connor Hurley

Honors Theses

When people think of mathematics they think "right or wrong," "empirically correct" or "empirically incorrect." Formalized logically valid arguments are one important step to achieving this definitive answer; however, what about the underlying assumptions to the argument? In the early 20th century, mathematicians set out to formalize these assumptions, which in mathematics are known as axioms. The most common of these axiomatic systems was the Zermelo-Fraenkel axioms. The standard axioms in this system were accepted by mathematicians as obvious, and deemed by some to be sufficiently powerful to prove all the intuitive theorems already known to mathematicians. However, this system …

Neutrosophy, A Sentiment Analysis Model, Florentin Smarandache, Mirela Teodorescu, Daniela Gifu

Branch Mathematics and Statistics Faculty and Staff Publications

This paper describes the importance of Neutrosophy Theory in order to find a method that could solve the uncertainties arising on discursive analysis. The aim of this pilot study is to find a procedure to diminish the uncertainties from public discourse induced, especially, by humans (politicians, journalists, etc.). We consider that Neutrosophy Theory is a sentiment analysis specific case regarding processing of the three states: positive, negative, and neutral. The study is intended to identify a method to answer to uncertainties solving in order to support politician's staff, NLP specialists, artificial intelligence researchers and generally the electors.

Representation And Decomposition Of An Intuitionistic Fuzzy Matrix Using Some (Α, Α') Cuts, T. Muthuraji, S. Sriram

Applications and Applied Mathematics: An International Journal (AAM)

The aim of this paper is to study the properties of various (α, α') cuts on Intuitionistic Fuzzy Matrices. Here we introduce different kinds of cuts on Intuitionistic Fuzzy Sets. We discuss some properties of the cuts with some other existing operators on Intuitionistic Fuzzy Matrix. Finally some representation and decomposition of an Intuitionistic Fuzzy Matrix using (α, α') cuts are given.

On Tarski's Axiomatic Foundations Of The Calculus Of Relations, Hajnal Andréka, Steven Givant, Peter Jipsen, István Németi

Mathematics, Physics, and Computer Science Faculty Articles and Research

It is shown that Tarski’s set of ten axioms for the calculus of relations is independent in the sense that no axiom can be derived from the remaining axioms. It is also shown that by modifying one of Tarski’s axioms slightly, and in fact by replacing the right-hand distributive law for relative multiplication with its left-hand version, we arrive at an equivalent set of axioms which is redundant in the sense that one of the axioms, namely the second involution law, is derivable from the other axioms. The set of remaining axioms is independent. Finally, it is shown that if …

Mcdm Method For N-Wise Criteria Comparisons And Inconsistent Problems, Florentin Smarandache, Azeddine Elhassouny

Branch Mathematics and Statistics Faculty and Staff Publications

The purpose of this paper is to present an e[xtension and alternative of the hybrid method based on Saaty’s Analytical Hierarchy Process and Technique for Order Preference by Similarity to Ideal Solution method (AHP-TOPSIS), that based on the AHP and its use of pairwise comparisons, to a new method called α -D MCDM-TOPSIS( α -Discounting Method for multicriteria decision making-TOPSIS). The new method overcomes limits of AHP which work only for pairwise comparisons of criteria to any-wise (n-wise) comparisons, with crisp coefficients or with interval-valued coefficients. α-D MCDM-TOPSIS is verified by some examples to demonstrate how it allows for consistency, …

Relation Algebras, Idempotent Semirings And Generalized Bunched Implication Algebras, Peter Jipsen

Mathematics, Physics, and Computer Science Faculty Articles and Research

This paper investigates connections between algebraic structures that are common in theoretical computer science and algebraic logic. Idempotent semirings are the basis of Kleene algebras, relation algebras, residuated lattices and bunched implication algebras. Extending a result of Chajda and Länger, we show that involutive residuated lattices are determined by a pair of dually isomorphic idempotent semirings on the same set, and this result also applies to relation algebras. Generalized bunched implication algebras (GBI-algebras for short) are residuated lattices expanded with a Heyting implication. We construct bounded cyclic involutive GBI-algebras from so-called weakening relations, and prove that the class of weakening …

Does Logic Help Us Beat Monty Hall?, Adam J. Hammett, Nathan A. Harold, Tucker R. Rhodes

The Research and Scholarship Symposium (2013-2019)

The classical Monty Hall problem entails that a hypothetical game show contestant be presented three doors and told that behind one door is a car and behind the other two are far less appealing prizes, like goats. The contestant then picks a door, and the host (Monty) is to open a different door which contains one of the bad prizes. At this point in the game, the contestant is given the option of keeping the door she chose or changing her selection to the remaining door (since one has already been opened by Monty), after which Monty opens the chosen …

On Benacerraf’S Dilemma, Again, Marco Panza

MPP Published Research

In spite of its enormous influence, Benacerraf’s dilemma admits no standard unanimously accepted formulation. This mainly depends on Benacerraf’s having originally presented it in a quite colloquial way, by avoiding any compact, somehow codified, but purportedly comprehensive formulation (Benacerraf 1973 cf. p. 29).

From Pythagoreans And Weierstrassians To True Infinitesimal Calculus, Mikhail Katz, Luie Polev

Journal of Humanistic Mathematics

In teaching infinitesimal calculus we sought to present basic concepts like continuity and convergence by comparing and contrasting various definitions, rather than presenting “the definition” to the students as a monolithic absolute. We hope that our experiences could be useful to other instructors wishing to follow this method of instruction. A poll run at the conclusion of the course indicates that students tend to favor infinitesimal definitions over epsilon-delta ones.

The Proscriptive Principle And Logics Of Analytic Implication, Thomas M. Ferguson

Dissertations, Theses, and Capstone Projects

The analogy between inference and mereological containment goes at least back to Aristotle, whose discussion in the Prior Analytics motivates the validity of the syllogism by way of talk of parts and wholes. On this picture, the application of syllogistic is merely the analysis of concepts, a term that presupposes—through the root ἀνά + λύω —a mereological background.

In the 1930s, such considerations led William T. Parry to attempt to codify this notion of logical containment in his system of analytic implication AI. Parry’s original system AI was later expanded to the system PAI. The hallmark of Parry’s systems—and of …

Introducing A Theory Of Neutrosophic Evolution: Degrees Of Evolution, Indeterminacy, And Involution, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

During the process of adaptation of a being (plant, animal, or human), to a new environment or conditions, the being partially evolves, partially devolves (degenerates), and partially is indeterminate i.e. neither evolving nor devolving, therefore unchanged (neutral), or the change is unclear, ambiguous, vague, as in neutrosophic logic. Thank to adaptation, one therefore has: evolution, involution, and indeterminacy (or neutrality), each one of these three neutrosophic components in some degree. The degrees of evolution/indeterminacy/involution are referred to both: the structure of the being (its body parts), and functionality of the being (functionality of each part, or inter-functionality of the parts …

Sudoku Variants On The Torus, Kira A. Wyld

HMC Senior Theses

This paper examines the mathematical properties of Sudoku puzzles defined on a Torus. We seek to answer the questions for these variants that have been explored for the traditional Sudoku. We do this process with two such embeddings. The end result of this paper is a deeper mathematical understanding of logic puzzles of this type, as well as a fun new puzzle which could be played.

Predicting Risk Of Adverse Outcomes In Knee Replacement Surgery With Reconstructability Analysis, Cecily Corrine Froemke, Martin Zwick

Systems Science Faculty Publications and Presentations

Reconstructability Analysis (RA) is a data mining method that searches for relations in data, especially non-linear and higher order relations. This study shows that RA can provide useful predictions of complications in knee replacement surgery.