Logic and Foundations Commons^™

Nominal Coalgebraic Data Types With Applications To Lambda Calculus, Alexander Kurz, Daniela Petrişan, Paula Severi, Fer-Jan De Vries

Engineering Faculty Articles and Research

We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.

Nominal Computation Theory (Dagstuhl Seminar 13422), Mikołaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts

Engineering Faculty Articles and Research

This report documents the program and the outcomes of Dagstuhl Seminar 13422 “Nominal Computation Theory”. The underlying theme of the seminar was nominal sets (also known as sets with atoms or Fraenkel-Mostowski sets) and they role and applications in three distinct research areas: automata over infinite alphabets, program semantics using nominal sets and nominal calculi of concurrent processes.

Epistemic Updates On Algebras, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

We develop the mathematical theory of epistemic updates with the tools of duality theory. We focus on the Logic of Epistemic Actions and Knowledge (EAK), introduced by Baltag-Moss-Solecki, without the common knowledge operator. We dually characterize the product update construction of EAK as a certain construction transforming the complex algebras associated with the given model into the complex algebra associated with the updated model. This dual characterization naturally generalizes to much wider classes of algebras, which include, but are not limited to, arbitrary BAOs and arbitrary modal expansions of Heyting algebras (HAOs). As an application of this dual characterization, we …

Residuated Frames With Applications To Decidability, Nikolaos Galatos, Peter Jipsen

Mathematics, Physics, and Computer Science Faculty Articles and Research

Residuated frames provide relational semantics for substructural logics and are a natural generalization of Kripke frames in intuitionistic and modal logic, and of phase spaces in linear logic. We explore the connection between Gentzen systems and residuated frames and illustrate how frames provide a uniform treatment for semantic proofs of cut-elimination, the finite model property and the finite embeddability property, which imply the decidability of the equational/universal theories of the associated residuated lattice-ordered groupoids. In particular these techniques allow us to prove that the variety of involutive FL-algebras and several related varieties have the finite model property.

Subset Polynomial Semirings And Subset Matrix Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors introduce the notion of subset polynomial semirings and subset matrix semirings. The study of algebraic structures using subsets were recently carried out by the authors. Here we define the notion of subset row matrices, subset column matrices and subset m × n matrices. Study of this kind is developed in chapter two of this book. If we use subsets of a set X; say P(X), the power set of the set X....

Hence if P(X) is replaced by a group or a semigroup we get the subset matrix to be only a subset matrix semigroup. If …

Subset Interval Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

The study of groupoids is meager and we have recently introduced the new notion of subset groupoids and have studied them. It is interesting to keep on record that interval groupoids have been studied by us in 2010. Further when the subsets of a loop are taken they also form only a subset groupoid and not a subset loop. Thus we do not have the concept of subset interval loop they only form a subset interval groupoid. Special elements like subset interval zero divisors, subset interval idempotents and subset interval units are studied. Concept of subset interval groupoid homomorphism is …

Subset Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors introduce the new notion of constructing non associative algebraic structures using subsets of a groupoid. Thus subset groupoids are constructed using groupoids or loops. Even if we use subsets of loops still the algebraic structure we get with it is only a groupoid. However we can get a proper subset of it to be a subset loop which will be isomorphic with the loop which was used in the construction of the subset groupoid. To the best of the authors’ knowledge this is the first time non associative algebraic structures are constructed using subsets. We get …

Algebraic Structures Using [0,N), Florentin Smarandache, Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce a new method of building algebraic structures on the interval [0, n). This study is interesting and innovative. However, [0, n) is a semigroup under product, × modulo n and a semigroup under min or max operation. Further [0, n) is a group under addition modulo n. We see [0, n) under both max and min operation is a semiring. [0, n) under + and × is not in general a ring. We define S = {[0, n), +, ×} to be a pseudo special ring as the distributive law is …

Variance On Topics Of Plane Geometry, Florentin Smarandache, Ion Patrascu

Branch Mathematics and Statistics Faculty and Staff Publications

This book contains 21 papers of plane geometry. It deals with various topics, such as: quasi-isogonal cevians, nedians, polar of a point with respect to a circle, anti-bisector, aalsonti-symmedian, anti-height and their isogonal. A nedian is a line segment that has its origin in a triangle’s vertex and divides the opposite side in Q equal segments. The papers also study distances between remarkable points in the 2D-geometry, the circumscribed octagon and the inscribable octagon, the circles adjointly ex-inscribed associated to a triangle, and several classical results such as: Carnot circles, Euler’s line, Desargues theorem, Sondat’s theorem, Dergiades theorem, Stevanovic’s theorem, …

Filters Via Neutrosophic Crisp Sets, A. A. Salama, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we introduce the notion of filter on the neutrosophic crisp set, then we consider a generalization of the filter’s studies. Afterwards, we present the important neutrosophic crisp filters. We also study several relations between different neutrosophic crisp filters and neutrosophic topologies. Possible applications to database systems are touched upon.

More On Intuitionistic Neutrosophic Soft Sets, Said Broumi, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Intuitionistic Neutrosophic Soft Set theory proposed by S. Broumi and F. Samarandache [28], has been regarded as an effective mathematical tool to deal with uncertainties. In this paper new operations on intuitionistic neutrosophic soft sets have been introduced . Some results relating to the properties of these operations have been established. Moreover ,we illustrate their interconnections between each other.

N-Valued Refined Neutrosophic Logic And Its Applications To Physics, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we present a short history of logics: from particular cases of 2-symbol or numerical valued logic to the general case of n-symbol or numerical valued logic. We show generalizations of 2-valued Boolean logic to fuzzy logic, also from the Kleene’s and Lukasiewicz’ 3-symbol valued logics or Belnap’s 4-symbol valued logic to the most general n-symbol or numerical valued refined neutrosophic logic. Two classes of neutrosophic norm (n-norm) and neutrosophic conorm (n-conorm) are defined. Examples of applications of neutrosophic logic to physics are listed in the last section. Similar generalizations can be done for n-Valued Refined Neutrosophic Set, …

Subset Non Associative Topological Spaces, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

The concept of non associative topological space is new and innovative. In general topological spaces are defined as union and intersection of subsets of a set X. In this book authors for the first time define non associative topological spaces using subsets of groupoids or subsets of loops or subsets of groupoid rings or subsets of loop rings. This study leads to several interesting results in this direction.

Over hundred problems on non associative topological spaces using of subsets of loops or groupoids is suggested at the end of chapter two. Also conditions for these non associative subset topological spaces …

Algebraic Structures Using Subsets, Florentin Smarandache, W.B Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

The study of subsets and giving algebraic structure to these subsets of a set started in the mid 18th century by George Boole. The first systematic presentation of Boolean algebra emerged in 1860s in papers written by William Jevons and Charles Sanders Peirce. Thus we see if P(X) denotes the collection of all subsets of the set X, then P(X) under the op erations of union and intersection is a Boolean algebra. Next the subsets of a set was used in the construction of topological spaces. We in this book consider subsets of a semigroup or a group or a …

Set Theoretic Approach To Algebraic Structures In Mathematics - A Revelation, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors bring out how sets in algebraic structure can be used to construct most generalized algebraic structures, like set linear algebra/vector space, set ideals in rings and semigroups. This sort of study is not only innovative but infact very helpful in cases instead of working with a large data we can work with a considerably small data. Thus instead of working with a vector space or a linear algebra V over a field F we can work with a subset in V and a needed subset in F, this can save both time and economy. The concept …

Intuitionistic Neutrosophic Soft Set, Said Broumi, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper we study the concept of intuitionistic neutrosophic set of Bhowmik and Pal. We have introduced this concept in soft sets and defined intuitionistic neutrosophic soft set. Some definitions and operations have been introduced on intuitionistic neutrosophic soft set. Some properties of this concept have been established.

A Constructive Proof Of Fundamental Theory For Fuzzy Variable Linear Programming Problems, A. Ebrahimnejad

Applications and Applied Mathematics: An International Journal (AAM)

Two existing methods for solving fuzzy variable linear programming problems based on ranking functions are the fuzzy primal simplex method proposed by Mahdavi-Amiri et al. (2009) and the fuzzy dual simplex method proposed by Mahdavi-Amiri and Nasseri (2007). In this paper, we prove that in the absence of degeneracy these fuzzy methods stop in a finite number of iterations. Moreover, we generalize the fundamental theorem of linear programming in a crisp environment to a fuzzy one. Finally, we illustrate our proof using a numerical example.

Solution Of Fuzzy System Of Linear Equations With Polynomial Parametric Form, Diptiranjan Behera, S. Chakraverty

Applications and Applied Mathematics: An International Journal (AAM)

This paper proposed two new and simple solution methods to solve a fuzzy system of linear equations having fuzzy coefficients and crisp variables using a polynomial parametric form of fuzzy numbers. Related theorems are stated and proved. The proposed methods are used to solve example problems. The results obtained are also compared with the known solutions and are found to be in good agreement.

Math, Minds, Machines, Christopher V. Carlile

Chancellor’s Honors Program Projects

No abstract provided.

Craig Interpolation For Networks Of Sentences, H Jerome Keisler, Jeffrey M. Keisler

Jeffrey Keisler

The Craig Interpolation Theorem can be viewed as saying that in first order logic, two agents who can only communicate in their common language can cooperate in building proofs. We obtain generalizations of the Craig Interpolation Theorem for finite sets of agents with the following properties. (1) The agents are vertices of a directed graph. (2) The agents have knowledge bases with overlapping signatures. (3) The agents can only communicate by sending to neighboring agents sentences that they know and that are in the common language of the two agents.