Open Access. Powered by Scholars. Published by Universities.®

Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Logic and Foundations

Institution
Keyword
Publication Year
Publication
Publication Type

Articles 481 - 510 of 563

Full-Text Articles in Mathematics

Coalgebras And Their Logics, Alexander Kurz Jan 2006

Coalgebras And Their Logics, Alexander Kurz

Engineering Faculty Articles and Research

"Transition systems pervade much of computer science. This article outlines the beginnings of a general theory of specification languages for transition systems. More specifically, transition systems are generalised to coalgebras. Specification languages together with their proof systems, in the following called (logical or modal) calculi, are presented by the associated classes of algebras (e.g., classical propositional logic by Boolean algebras). Stone duality will be used to relate the logics and their coalgebraic semantics."


Some Neutrosophic Algebraic Structures And Neutrosophic N-Algebraic Structures, Florentin Smarandache, W.B. Vasantha Kandasamy Jan 2006

Some Neutrosophic Algebraic Structures And Neutrosophic N-Algebraic Structures, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book, for the first time we introduce the notion of neutrosophic algebraic structures for groups, loops, semigroups and groupoids and also their neutrosophic N-algebraic structures. One is fully aware of the fact that many classical theorems like Lagrange, Sylow and Cauchy have been studied only in the context of finite groups. Here we try to shift the paradigm by studying and introducing these theorems to neutrosophic semigroups, neutrosophic groupoids, and neutrosophic loops. We have intentionally not given several theorems for semigroups and groupoid but have given several results with proof mainly in the case of neutrosophic loops, biloops …


Sequences Of Numbers Involved In Unsolved Problems, Florentin Smarandache Jan 2006

Sequences Of Numbers Involved In Unsolved Problems, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Here it is a long list of sequences, functions, unsolved problems, conjectures, theorems, relationships, operations, etc. Some of them are inter-connected. 1) Consecutive Sequence: 1,12,123,1234,12345,123456,1234567,12345678,123456789,12345678910, 1234567891011,123456789101112,12345678910111213,... How many primes are there among these numbers? In a general form, the Consecutive Sequence is considered in an arbitrary numeration base B.

References:

Student Conference, University of Craiova, Department of Mathematics, April 1979, "Some problems in number theory" by Florentin Smarandache.

Arizona State University, Hayden Library, "The Florentin Smarandache papers" special collection, Tempe, AZ 85287-1006, USA.

The Encyclopedia of Integer Sequences", by N. J. A. Sloane and S. Plouffe, Academic Press, San Diego, …


Fuzzy Interval Matrices, Neutrosophic Interval Matrices And Their Applications, Florentin Smarandache, W.B. Vasantha Kandasamy Jan 2006

Fuzzy Interval Matrices, Neutrosophic Interval Matrices And Their Applications, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

The new concept of fuzzy interval matrices has been introduced in this book for the first time. The authors have not only introduced the notion of fuzzy interval matrices, interval neutrosophic matrices and fuzzy neutrosophic interval matrices but have also demonstrated some of its applications when the data under study is an unsupervised one and when several experts analyze the problem. Further, the authors have introduced in this book multiexpert models using these three new types of interval matrices. The new multi expert models dealt in this book are FCIMs, FRIMs, FCInMs, FRInMs, IBAMs, IBBAMs, nIBAMs, FAIMs, FAnIMS, etc. Illustrative …


Enumerations Of The Kolmogorov Function, Richard Beigel, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet Jan 2006

Enumerations Of The Kolmogorov Function, Richard Beigel, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, Leen Torenvliet

Computer Science Faculty Publication Series

A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x). f is a k(n)-enumerator if for every input x of length n, h(x) is among the first k(n) elements enumerated by f. If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A.

We determine exactly how hard it is to enumerate the Kolmogorov function, which assigns to each string x its Kolmogorov complexity:

  • For every underlying universal machine U, there is a constant a …


Application Of Information-Theoretic Data Mining Techniques In A National Ambulatory Practice Outcomes Research Network, Adam Wright, Thomas N. Ricciardi, Martin Zwick Oct 2005

Application Of Information-Theoretic Data Mining Techniques In A National Ambulatory Practice Outcomes Research Network, Adam Wright, Thomas N. Ricciardi, Martin Zwick

Complex Systems Faculty Publications and Presentations

The Medical Quality Improvement Consortium data warehouse contains de-identified data on more than 3.6 million patients including their problem lists, test results, procedures and medication lists. This study uses reconstructability analysis, an information-theoretic data mining technique, on the MQIC data warehouse to empirically identify risk factors for various complications of diabetes including myocardial infarction and microalbuminuria. The risk factors identified match those risk factors identified in the literature, demonstrating the utility of the MQIC data warehouse for outcomes research, and RA as a technique for mining clinical data warehouses.


Some Sober Conceptions Of Mathematical Truth, Marco Panza Mar 2005

Some Sober Conceptions Of Mathematical Truth, Marco Panza

MPP Published Research

It is not sufficient to supply an instance of Tarski’s schema, ⌈“p” is true if and only if p⌉ for a certain statement in order to get a definition of truth for this statement and thus fix a truth-condition for it. A definition of the truth of a statement x of a language L is a bi-conditional whose two members are two statements of a meta-language L’. Tarski’s schema simply suggests that a definition of truth for a certain segment x of a language L consists in a statement of the form: ⌈v(x) is true if and only if τ(x)⌉, …


Weak Factorizations, Fractions And Homotopies, Alexander Kurz, Jiří Rosický Jan 2005

Weak Factorizations, Fractions And Homotopies, Alexander Kurz, Jiří Rosický

Engineering Faculty Articles and Research

We show that the homotopy category can be assigned to any category equipped with a weak factorization system. A classical example of this construction is the stable category of modules. We discuss a connection with the open map approach to bisimulations proposed by Joyal, Nielsen and Winskel.


N-Algebraic Structures And S-N-Algebraic Structures, Florentin Smarandache, Vasantha Kandasamy Jan 2005

N-Algebraic Structures And S-N-Algebraic Structures, Florentin Smarandache, Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book, for the first time we introduce the notions of Ngroups, N-semigroups, N-loops and N-groupoids. We also define a mixed N-algebraic structure. We expect the reader to be well versed in group theory and have at least basic knowledge about Smarandache groupoids, Smarandache loops, Smarandache semigroups and bialgebraic structures and Smarandache bialgebraic structures. The book is organized into six chapters. The first chapter gives the basic notions of S-semigroups, S-groupoids and S-loops thereby making the book self-contained. Chapter two introduces N-groups and their Smarandache analogues. In chapter three, Nloops and Smarandache N-loops are introduced and analyzed. Chapter four …


Fuzzy And Neutrosophic Analysis Of Periyar’S Views On Untouchability, Florentin Smarandache, Vasantha Kandasamy, K. Kandasamy Jan 2005

Fuzzy And Neutrosophic Analysis Of Periyar’S Views On Untouchability, Florentin Smarandache, Vasantha Kandasamy, K. Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

“Day in and day out we take pride in claiming that India has a 5000 year old civilization. But the way Dalits and those suppressed are being treated by the people who wield power and authority speaks volumes for the degradations of our moral structure and civilized standards.” Ex-President of India, the late K. R. Narayanan The New Indian Express, Saturday, 12 Nov. 2005 K.R.Narayanan was a lauded hero and a distinguished victim of his Dalit background. Even in an international platform when he was on an official visit to Paris, the media headlines blazed, ‘An Untouchable at Elysee’. He …


Fuzzy And Neutrosophic Analysis Of Women With Hiv/Aids, Florentin Smarandache, W.B. Vasantha Kandasamy Jan 2005

Fuzzy And Neutrosophic Analysis Of Women With Hiv/Aids, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

Fuzzy theory is one of the best tools to analyze data, when the data under study is an unsupervised one, involving uncertainty coupled with imprecision. However, fuzzy theory cannot cater to analyzing the data involved with indeterminacy. The only tool that can involve itself with indeterminacy is the neutrosophic model. Neutrosophic models are used in the analysis of the socio-economic problems of HIV/AIDS infected women patients living in rural Tamil Nadu. Most of these women are uneducated and live in utter poverty. Till they became seriously ill they worked as daily wagers. When these women got admitted in the hospital …


Enhancements To Crisp Possibilistic Reconstructability Analysis, Anas Al-Rabadi, Martin Zwick Aug 2004

Enhancements To Crisp Possibilistic Reconstructability Analysis, Anas Al-Rabadi, Martin Zwick

Complex Systems Faculty Publications and Presentations

Modified Reconstructibility Analysis (MRA), a novel decomposition within the framework of set-theoretic (crisp possibilistic) Reconstructibility Analysis, is presented. It is shown that in some cases while 3-variable NPN-classified Boolean functions are not decomposable using Conventional Reconstructibility Analysis (CRA), they are decomposable using Modified Reconstructibility Analysis (MRA). Also, it is shown that whenever a decomposition of 3-variable NPN-classified Boolean functions exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. A comparison of the corresponding complexities for Ashenhurst-Curtis decompositions, and Modified Reconstructibility Analysis (MRA) is also presented. While both AC and MRA decompose some but …


Tesselland: A Mathematical Oddment, Martin Glover Jan 2004

Tesselland: A Mathematical Oddment, Martin Glover

Humanistic Mathematics Network Journal

No abstract provided.


Bridging To Infinity, Mike Pinter Jan 2004

Bridging To Infinity, Mike Pinter

Humanistic Mathematics Network Journal

The author's own experiences as a mathematics student and teacher have influenced how he thinks about the infinite. Author Madeleine L'Engle has also shaped his thinking with her writing. The author offers some thoughts that connect some of L'Engle's writing with his experience.


Mathematics, The Liberal Arts, And Slavish Devotions, J. D. Phillips Jan 2004

Mathematics, The Liberal Arts, And Slavish Devotions, J. D. Phillips

Humanistic Mathematics Network Journal

No abstract provided.


Algebraic Semantics For Coalgebraic Logics, Clemens Kupke, Alexander Kurz, Dirk Pattinson Jan 2004

Algebraic Semantics For Coalgebraic Logics, Clemens Kupke, Alexander Kurz, Dirk Pattinson

Engineering Faculty Articles and Research

With coalgebras usually being defined in terms of an endofunctor T on sets, this paper shows that modal logics for T-coalgebras can be naturally described as functors L on boolean algebras. Building on this idea, we study soundness, completeness and expressiveness of coalgebraic logics from the perspective of duality theory. That is, given a logic L for coalgebras of an endofunctor T, we construct an endofunctor L such that L-algebras provide a sound and complete (algebraic) semantics of the logic. We show that if L is dual to T, then soundness and completeness of the algebraic semantics immediately yield the …


Preface, Thomas Hildebrandt, Alexander Kurz Jan 2004

Preface, Thomas Hildebrandt, Alexander Kurz

Engineering Faculty Articles and Research

No abstract provided.


Coalgebras And Modal Expansions Of Logics, Alexander Kurz, Alessandra Palmigiano Jan 2004

Coalgebras And Modal Expansions Of Logics, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

In this paper we construct a setting in which the question of when a logic supports a classical modal expansion can be made precise. Given a fully selfextensional logic S, we find sufficient conditions under which the Vietoris endofunctor V on S-referential algebras can be defined and we propose to define the modal expansions of S as the logic that arises from the V-coalgebras. As an example, we also show how the Vietoris endofunctor on referential algebras extends the Vietoris endofunctor on Stone spaces. From another point of view, we examine when a category of ‘spaces’ (X,A), ie sets X …


Analysis Of Social Aspects Of Migrant Labourers Living With Hiv/Aids Using Fuzzy Theory And Neutrosophic Cognitive Maps, Florentin Smarandache, W.B. Vasantha Kandasamy Jan 2004

Analysis Of Social Aspects Of Migrant Labourers Living With Hiv/Aids Using Fuzzy Theory And Neutrosophic Cognitive Maps, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic logic grew as an alternative to the existing topics and it represents a mathematical model of uncertainty, vagueness, ambiguity, imprecision, undefined-ness, unknown, incompleteness, inconsistency, redundancy and contradiction. Despite various attempts to reorient logic, there has remained an essential need for an alternative system that could infuse into itself a representation of the real world. Out of this need arose the system of neutrosophy and its connected logic, neutrosophic logic. This new logic, which allows also the concept of indeterminacy to play a role in any real-world problem, was introduced first by one of the authors Florentin Smarandache. In this …


A Comparison Of Modified Reconstructability Analysis And Ashenhurst‐Curtis Decomposition Of Boolean Functions, Anas Al-Rabadi, Marek Perkowski, Martin Zwick Jan 2004

A Comparison Of Modified Reconstructability Analysis And Ashenhurst‐Curtis Decomposition Of Boolean Functions, Anas Al-Rabadi, Marek Perkowski, Martin Zwick

Complex Systems Faculty Publications and Presentations

Modified reconstructability analysis (MRA), a novel decomposition technique within the framework of set‐theoretic (crisp possibilistic) reconstructability analysis, is applied to three‐variable NPN‐classified Boolean functions. MRA is superior to conventional reconstructability analysis, i.e. it decomposes more NPN functions. MRA is compared to Ashenhurst‐Curtis (AC) decomposition using two different complexity measures: log‐functionality, a measure suitable for machine learning, and the count of the total number of two‐input gates, a measure suitable for circuit design. MRA is superior to AC using the first of these measures, and is comparable to, but different from AC, using the second.


State-Based Reconstructability Analysis, Martin Zwick, Michael S. Johnson Jan 2004

State-Based Reconstructability Analysis, Martin Zwick, Michael S. Johnson

Complex Systems Faculty Publications and Presentations

Reconstructability analysis (RA) is a method for detecting and analyzing the structure of multivariate categorical data. While Jones and his colleagues extended the original variable‐based formulation of RA to encompass models defined in terms of system states, their focus was the analysis and approximation of real‐valued functions. In this paper, we separate two ideas that Jones had merged together: the “g to k” transformation and state‐based modeling. We relate the idea of state‐based modeling to established variable‐based RA concepts and methods, including structure lattices, search strategies, metrics of model quality, and the statistical evaluation of model fit for analyses based …


Reversible Modified Reconstructability Analysis Of Boolean Circuits And Its Quantum Computation, Anas Al-Rabadi, Martin Zwick Jan 2004

Reversible Modified Reconstructability Analysis Of Boolean Circuits And Its Quantum Computation, Anas Al-Rabadi, Martin Zwick

Complex Systems Faculty Publications and Presentations

Modified Reconstructability Analysis (MRA) can be realized reversibly by utilizing Boolean reversible (3,3) logic gates that are universal in two arguments. The quantum computation of the reversible MRA circuits is also introduced. The reversible MRA transformations are given a quantum form by using the normal matrix representation of such gates. The MRA-based quantum decomposition may play an important role in the synthesis of logic structures using future technologies that consume less power and occupy less space.


Modified Reconstructability Analysis For Many-Valued Functions And Relations, Anas Al-Rabadi, Martin Zwick Jan 2004

Modified Reconstructability Analysis For Many-Valued Functions And Relations, Anas Al-Rabadi, Martin Zwick

Complex Systems Faculty Publications and Presentations

A novel many-valued decomposition within the framework of lossless Reconstructability Analysis is presented. In previous work, Modified Recontructability Analysis (MRA) was applied to Boolean functions, where it was shown that most Boolean functions not decomposable using conventional Reconstructability Analysis (CRA) are decomposable using MRA. Also, it was previously shown that whenever decomposition exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. In this paper, MRA is extended to many-valued logic functions, and logic structures that correspond to such decomposition are developed. It is shown that many-valued MRA can decompose many-valued functions when CRA fails to do …


Using Reconstructability Analysis To Select Input Variables For Artificial Neural Networks, Stephen Shervais, Martin Zwick Jul 2003

Using Reconstructability Analysis To Select Input Variables For Artificial Neural Networks, Stephen Shervais, Martin Zwick

Complex Systems Faculty Publications and Presentations

We demonstrate the use of Reconstructability Analysis to reduce the number of input variables for a neural network. Using the heart disease dataset we reduce the number of independent variables from 13 to two, while providing results that are statistically indistinguishable from those of NNs using the full variable set. We also demonstrate that rule lookup tables obtained directly from the data for the RA models are almost as effective as NNs trained on model variables.


Developing Into Series And Returning From Series: A Note On The Foundations Of Eighteenth-Century Analysis, Giovanni Ferraro, Marco Panza Mar 2003

Developing Into Series And Returning From Series: A Note On The Foundations Of Eighteenth-Century Analysis, Giovanni Ferraro, Marco Panza

MPP Published Research

In this paper we investigate two problems concerning the theory of power series in 18th-century mathematics: the development of a given function into a power series and the inverse problem, the return from a given power series to the function of which this power series is the development. The way of conceiving and solving these problems closely depended on the notion of function and in particular on the conception of a series as the result of a formal transformation of a function. After describing the procedures considered acceptable by 18th-century mathematicians, we examine in detail the different strategies—both direct and …


A Unifying Field In Logics: Neutrosophic Logic Neutrosophy, Neutrosophic Set, Neutrosophic Probability (In Traditional Chinese), Florentin Smarandache, Feng Liu Jan 2003

A Unifying Field In Logics: Neutrosophic Logic Neutrosophy, Neutrosophic Set, Neutrosophic Probability (In Traditional Chinese), Florentin Smarandache, Feng Liu

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.


A Unifying Field In Logics: Neutrosophic Logic Neutrosophy, Neutrosophic Set, Neutrosophic Probability (Chinese Translation), Florentin Smarandache, Feng Liu Jan 2003

A Unifying Field In Logics: Neutrosophic Logic Neutrosophy, Neutrosophic Set, Neutrosophic Probability (Chinese Translation), Florentin Smarandache, Feng Liu

Branch Mathematics and Statistics Faculty and Staff Publications

中智学为何诞生? 中智学(neutrosophy)起源于1995年美国, 它站在东西文化交融的立场上, 从对立统一的角度探索从科学技术到文学 艺术的一切宏观及微观结构, 构造超越一切学科、超越自然科学与社会科学界限的统一场, 以解决当今认知科学、信息 科学、系统科学、经济学、量子力学等科学技术前沿难题——非确定性问题。中智学努力通过新型开放模式改造当今 各自然科学与社会科学, 实现它们的新陈代谢、改革创新和更新换代。中智学在我们中国还属空白, 故借此对学科正式 命名并引入中国。 科学是真理吗? 比如, 当今信息科学的突出问题之一就是知识表达、知识处理及知识交流中的逻辑单一性: 不是真就是假, 从而不 能面对任何矛盾和冲突。由此, 人工智能、计算机网络、数据库、信息工程, 乃至电子商务、电子政务多多少少在走死 胡同。从表面上看, 它是模糊数学或协调逻辑的问题, 而从本质上看, 它属于结构性问题, 涉及到对哲学、逻辑学、集 合论、概率论、认知科学、信息科学基本概念以及众多相关领域的重新认识、重新塑造问题。 众所周知, 我国学习西方, 只图表面, 而不注重科学的内在结构, 不懂科学的概念和原理中也有基础设施 (换句话 说, 就是基础设施的基础设施), 从而建不起高楼大厦, 更谈不上科学上的自主, 从而形成盲目跟从西方的弊病。 科学, 这个被认为是永恒的真理, 其本质上没有半点永恒, 相反, 它时刻处于新老交替、新陈代谢、自我否定、自 我淘汰的动态之中——即使存在什么永恒的真理, 也终究会被后人推翻。科学实际上是一种战争, 而中智学正是关于它 的战略战术的科学。 当今世界上高深的科学莫过于爱因斯坦的相对论, 然而一切的一切, 都是建立在恒定光速的基础上——它正 在被现代的人们推翻!


Stone Coalgebras, Clemens Kupke, Alexander Kurz, Yde Venema Jan 2003

Stone Coalgebras, Clemens Kupke, Alexander Kurz, Yde Venema

Engineering Faculty Articles and Research

In this paper we argue that the category of Stone spaces forms an interesting base category for coalgebras, in particular, if one considers the Vietoris functor as an analogue to the power set functor. We prove that the so-called descriptive general frames, which play a fundamental role in the semantics of modal logics, can be seen as Stone coalgebras in a natural way. This yields a duality between the category of modal algebras and that of coalgebras over the Vietoris functor. Building on this idea, we introduce the notion of a Vietoris polynomial functor over the category of Stone spaces. …


Does A Mathematical/Scientific Worldview Lead To A Clearer Or More Distorted View Of Reality?: Purposive Musings Inspired From Readings In The Urantia Book, The Cosmic Family, Volume I, And Elsewhere, Jeru Jun 2002

Does A Mathematical/Scientific Worldview Lead To A Clearer Or More Distorted View Of Reality?: Purposive Musings Inspired From Readings In The Urantia Book, The Cosmic Family, Volume I, And Elsewhere, Jeru

Humanistic Mathematics Network Journal

No abstract provided.


Notes On Formal Constructivism, D. Joyner, P. Lejarraga Jun 2002

Notes On Formal Constructivism, D. Joyner, P. Lejarraga

Humanistic Mathematics Network Journal

Our aim is to sketch some ideas related to how we (as in, we two) think we (as in, we humans) think. "That theory is useless. It isn't even wrong." - Wolfgang Pauli. Our hope in this paper is to provide a theory, admittedly somewhat vague, of how we think about mathematics. We also hope our ideas do not cause the reader to be reminded of Pauli's quote above. These notes were motivated by the interesting book by Changeaux and Connes.