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

Logic and Foundations Commons

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

573 Full-Text Articles 521 Authors 172,138 Downloads 60 Institutions

All Articles in Logic and Foundations

Faceted Search

573 full-text articles. Page 7 of 22.

Tripleta De Estructura Neutrosófica Y Tripleta De Estructura Neutrosófica Extendida, Florentin Smarandache 2019 University of New Mexico

Tripleta De Estructura Neutrosófica Y Tripleta De Estructura Neutrosófica Extendida, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

En el presente estudio se realiza una revisión de las tripletas de estructura neutrosófica y tripleta de estructura neutrosófica extendida, con el fin de introducir nuevos conceptos a emplear en trabajos futuros.


Historia De Las Teorías Neutrosóficas Y Sus Aplicaciones (Actualizado), Florentin Smarandache 2019 University of New Mexico

Historia De Las Teorías Neutrosóficas Y Sus Aplicaciones (Actualizado), Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

Historia de las Teorías Neutrosóficas y sus Aplicaciones (actualizado)


A Short Remark On Gödel Incompleteness Theorem And Its Self-Referential Paradox From Neutrosophic Logic Perspective, Florentin Smarandache, Victor Christianto 2019 University of New Mexico

A Short Remark On Gödel Incompleteness Theorem And Its Self-Referential Paradox From Neutrosophic Logic Perspective, Florentin Smarandache, Victor Christianto

Branch Mathematics and Statistics Faculty and Staff Publications

It is known from history of mathematics, that Gödel submitted his two incompleteness theorems, which can be considered as one of hallmarks of modern mathematics in 20th century. Here we argue that Gödel incompleteness theorem and its self-referential paradox have not only put Hilbert’s axiomatic program into question, but he also opened up the problem deep inside the then popular Aristotelian Logic. Although there were some attempts to go beyond Aristotelian binary logic, including by Lukasiewicz’s three-valued logic, here we argue that the problem of self-referential paradox can be seen as reconcilable and solvable from Neutrosophic Logic perspective. Motivation of …


A Bipolar Fuzzy Extension Of The Multimoora Method, Florentin Smarandache, Dragisa Stanujkic, Darjan Karabasevic, Edmundas Kazimieras Zavadskas, Willem Brauer 2019 University of New Mexico

A Bipolar Fuzzy Extension Of The Multimoora Method, Florentin Smarandache, Dragisa Stanujkic, Darjan Karabasevic, Edmundas Kazimieras Zavadskas, Willem Brauer

Branch Mathematics and Statistics Faculty and Staff Publications

The aim of this paper is to make a proposal for a new extension of the MULTIMOORA method extended to deal with bipolar fuzzy sets. Bipolar fuzzy sets are proposed as an extension of classical fuzzy sets in order to enable solving a particular class of decision-making problems. Unlike other extensions of the fuzzy set of theory, bipolar fuzzy sets introduce a positive membership function, which denotes the satisfaction degree of the element x to the property corresponding to the bipolar-valued fuzzy set, and the negative membership function, which denotes the degree of the satisfaction of the element x to …


Special Subset Vertex Multisubgraphs For Multi Networks, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilanthenral K 2019 University of New Mexico

Special Subset Vertex Multisubgraphs For Multi Networks, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilanthenral K

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors study special type of subset vertex multi subgraphs; these multi subgraphs can be directed or otherwise. Another special feature of these subset vertex multigraphs is that we are aware of the elements in each vertex set and how it affects the structure of both subset vertex multisubgraphs and edge multisubgraphs. It is pertinent to record at this juncture that certain ego centric directed multistar graphs become empty on the removal of one edge, there by theorising the importance, and giving certain postulates how to safely form ego centric multi networks. Given any subset vertex multigraph we …


Special Issue: New Types Of Neutrosophic Set/Logic/Probability, Neutrosophic Over-/Under-/ Off-Set, Neutrosophic Refined Set, And Their Extension To Plithogenic Set/Logic/ Probability, With Applications, Florentin Smarandache 2019 University of New Mexico

Special Issue: New Types Of Neutrosophic Set/Logic/Probability, Neutrosophic Over-/Under-/ Off-Set, Neutrosophic Refined Set, And Their Extension To Plithogenic Set/Logic/ Probability, With Applications, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.


Grado De Dependencia E Independencia De Los (Sub) Componentes De Conjuntos Borrosos Y Neutrosóficos, Florentin Smarandache 2019 University of New Mexico

Grado De Dependencia E Independencia De Los (Sub) Componentes De Conjuntos Borrosos Y Neutrosóficos, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

La introducción del grado de dependencia (y en consecuencia el grado de independencia) entre los componentes del conjunto difuso, y también entre los componentes del conjunto neutrosófico, se introduce por primera vez en la quinta edición del libro de Neutrosofía en el año 2006, basado en los elementos descritos en dicha edición del libro, se comienza a conocer conceptos de conjuntos neutrosóficos de los componentes borrosos así como los grados de dependencia e independencia, Por tal motivo el objetivo del presente trabajo es extender el conjunto neutrosófico refinado, teniendo en cuenta la grado de dependencia o independencia de los subcomponentes …


Induced Hesitant 2-Tuple Linguistic Aggregation Operators With Application In Group Decision Making, Tabasam Rashid, Ismat Beg, Raja N. Jamil 2018 University of Management and Technology Lahore

Induced Hesitant 2-Tuple Linguistic Aggregation Operators With Application In Group Decision Making, Tabasam Rashid, Ismat Beg, Raja N. Jamil

Applications and Applied Mathematics: An International Journal (AAM)

In this article, hesitant 2-tuple linguistic arguments are used to evaluate the group decision making problems which have inter dependent or inter active attributes. Operational laws are developed for hesitant 2-tuple linguistic elements and based on these operational laws hesitant 2- tuple weighted averaging operator and generalized hesitant 2- tuple averaging operator are proposed. Combining Choquet integral with hesitant 2-tuple linguistic information, some new aggregation operators are defined, including the hesitant 2-tuple correlated averaging operator, the hesitant 2-tuple correlated geometric operator and the generalized hesitant 2-tuple correlated averaging operator. These proposed operators successfully manage the correlations among the elements. After …


Enhancing Value-Based Healthcare With Reconstructability Analysis: Predicting Cost Of Care In Total Hip Replacement, Cecily Corrine Froemke, Martin Zwick 2018 Portland State University

Enhancing Value-Based Healthcare With Reconstructability Analysis: Predicting Cost Of Care In Total Hip Replacement, Cecily Corrine Froemke, Martin Zwick

Systems Science Faculty Publications and Presentations

Legislative reforms aimed at slowing growth of US healthcare costs are focused on achieving greater value per dollar. To increase value healthcare providers must not only provide high quality care, but deliver this care at a sustainable cost. Predicting risks that may lead to poor outcomes and higher costs enable providers to augment decision making for optimizing patient care and inform the risk stratification necessary in emerging reimbursement models. Healthcare delivery systems are looking at their high volume service lines and identifying variation in cost and outcomes in order to determine the patient factors that are driving this variation and …


Keyword-Based Patent Citation Prediction Via Information Theory, Farshad Madani, Martin Zwick, Tugrul U. Daim 2018 Portland State University

Keyword-Based Patent Citation Prediction Via Information Theory, Farshad Madani, Martin Zwick, Tugrul U. Daim

Engineering and Technology Management Faculty Publications and Presentations

Patent citation shows how a technology impacts other inventions, so the number of patent citations (backward citations) is used in many technology prediction studies. Current prediction methods use patent citations, but since it may take a long time till a patent is cited by other inventors, identifying impactful patents based on their citations is not an effective way. The prediction method offered in this article predicts patent citations based on the content of patents. In this research, Reconstructability Analysis (RA), which is based on information theory and graph theory, is applied to predict patent citations based on keywords extracted from …


Asymptotic Quasi-Completeness And Zfc, Mirna Džamonja, Marco Panza 2018 University of East Anglia

Asymptotic Quasi-Completeness And Zfc, Mirna Džamonja, Marco Panza

MPP Published Research

The axioms ZFC of first order set theory are one of the best and most widely accepted, if not perfect, foundations used in mathematics. Just as the axioms of first order Peano Arithmetic, ZFC axioms form a recursively enumerable list of axioms, and are, then, subject to Gödel’s Incompleteness Theorems. Hence, if they are assumed to be consistent, they are necessarily incomplete. This can be witnessed by various concrete statements, including the celebrated Continuum Hypothesis CH. The independence results about the infinite cardinals are so abundant that it often appears that ZFC can basically prove very little about such cardinals. …


Was Frege A Logicist For Arithmetic?, Marco Panza 2018 Chapman University

Was Frege A Logicist For Arithmetic?, Marco Panza

MPP Published Research

The paper argues that Frege’s primary foundational purpose concerning arithmetic was neither that of making natural numbers logical objects, nor that of making arithmetic a part of logic, but rather that of assigning to it an appropriate place in the architectonics of mathematics and knowledge, by immersing it in a theory of numbers of concepts and making truths about natural numbers, and/or knowledge of them transparent to reason without the medium of senses and intuition.


The Philosophical Foundations Of Plen: A Protocol-Theoretic Logic Of Epistemic Norms, Ralph E. Jenkins 2018 The Graduate Center, City University of New York

The Philosophical Foundations Of Plen: A Protocol-Theoretic Logic Of Epistemic Norms, Ralph E. Jenkins

Dissertations, Theses, and Capstone Projects

In this dissertation, I defend the protocol-theoretic account of epistemic norms. The protocol-theoretic account amounts to three theses: (i) There are norms of epistemic rationality that are procedural; epistemic rationality is at least partially defined by rules that restrict the possible ways in which epistemic actions and processes can be sequenced, combined, or chosen among under varying conditions. (ii) Epistemic rationality is ineliminably defined by procedural norms; procedural restrictions provide an irreducible unifying structure for even apparently non-procedural prescriptions and normative expressions, and they are practically indispensable in our cognitive lives. (iii) These procedural epistemic norms are best analyzed in …


Enthymemathical Proofs And Canonical Proofs In Euclid’S Plane Geometry, Abel Lassalle, Marco Panza 2018 Universidade Federal da Bahia

Enthymemathical Proofs And Canonical Proofs In Euclid’S Plane Geometry, Abel Lassalle, Marco Panza

MPP Published Research

Since the application of Postulate I.2 in Euclid’s Elements is not uniform, one could wonder in what way should it be applied in Euclid’s plane geometry. Besides legitimizing questions like this from the perspective of a philosophy of mathematical practice, we sketch a general perspective of conceptual analysis of mathematical texts, which involves an extended notion of mathematical theory as system of authorizations, and an audience-dependent notion of proof.


Fast Adjustable Npn Classification Using Generalized Symmetries, Xuegong Zhou, Lingli Wang, Peiyi Zhao, Alan Mishchenko 2018 Fudan University

Fast Adjustable Npn Classification Using Generalized Symmetries, Xuegong Zhou, Lingli Wang, Peiyi Zhao, Alan Mishchenko

Mathematics, Physics, and Computer Science Faculty Articles and Research

NPN classification of Boolean functions is a powerful technique used in many logic synthesis and technology mapping tools in FPGA design flows. Computing the canonical form of a function is the most common approach of Boolean function classification. In this paper, a novel algorithm for computing NPN canonical form is proposed. By exploiting symmetries under different phase assignments and higher-order symmetries of Boolean functions, the search space of NPN canonical form computation is pruned and the runtime is dramatically reduced. The algorithm can be adjusted to be a slow exact algorithm or a fast heuristic algorithm with lower quality. For …


The Rubbish Researchers Puzzle, Michael W. Lucht 2018 Nil

The Rubbish Researchers Puzzle, Michael W. Lucht

Journal of Humanistic Mathematics

The Rubbish Researchers Puzzle is a humorous short story about the Blue-Eyed Islanders Puzzle, cultural insensitivity in logic problems, and the quality of research.


Introduction To Reconstructability Analysis, Martin Zwick 2018 Portland State University

Introduction To Reconstructability Analysis, Martin Zwick

Systems Science Faculty Publications and Presentations

This talk will introduce Reconstructability Analysis (RA), a data modeling methodology deriving from the 1960s work of Ross Ashby and developed in the systems community in the 1980s and afterwards. RA, based on information theory and graph theory, is a member of the family of methods known as ‘graphical models,’ which also include Bayesian networks and log-linear techniques. It is designed for exploratory modeling, although it can also be used for confirmatory hypothesis testing. RA can discover high ordinality and nonlinear interactions that are not hypothesized in advance. Its conceptual framework illuminates the relationships between wholes and parts, a subject …


Preliminary Results Of Bayesian Networks And Reconstructability Analysis Applied To The Electric Grid, Marcus Harris, Martin Zwick 2018 Portland State University

Preliminary Results Of Bayesian Networks And Reconstructability Analysis Applied To The Electric Grid, Marcus Harris, Martin Zwick

Systems Science Faculty Publications and Presentations

Reconstructability Analysis (RA) is an analytical approach developed in the systems community that combines graph theory and information theory. Graph theory provides the structure of relations (model of the data) between variables and information theory characterizes the strength and the nature of the relations. RA has three primary approaches to model data: variable based (VB) models without loops (acyclic graphs), VB models with loops (cyclic graphs) and state-based models (nearly always cyclic, individual states specifying model constraints). These models can either be directed or neutral. Directed models focus on a single response variable whereas neutral models focus on all relations …


Beyond Spatial Autocorrelation: A Novel Approach Using Reconstructability Analysis, David Percy, Martin Zwick 2018 Portland State University

Beyond Spatial Autocorrelation: A Novel Approach Using Reconstructability Analysis, David Percy, Martin Zwick

Systems Science Faculty Publications and Presentations

Raster data are digital representations of spatial phenomena that are organized into rows and columns that typically have the same dimensions in each direction. They are used to represent image data at any scale. Common raster data are medical images, satellite data, and photos generated by modern smartphones.
Satellites capture reflectance data in specific bands of wavelength that correspond to red, green, blue, and often some infrared and thermal bands. These composite vectors can then be classified into actual land use categories such as forest or water using automated techniques. These classifications are verified on the ground using hand-held sensors. …


Reconstructability & Dynamics Of Elementary Cellular Automata, Martin Zwick 2018 Portland State University

Reconstructability & Dynamics Of Elementary Cellular Automata, Martin Zwick

Systems Science Faculty Publications and Presentations

Reconstructability analysis (RA) is a method to determine whether a multivariate relation, defined set- or information-theoretically, is decomposable with or without loss into lower ordinality relations. Set-theoretic RA (SRA) is used to characterize the mappings of elementary cellular automata. The decomposition possible for each mapping w/o loss is a better predictor than the λ parameter (Walker & Ashby, Langton) of chaos, & non-decomposable mappings tend to produce chaos. SRA yields not only the simplest lossless structure but also a vector of losses for all structures, indexed by parameter τ. These losses are analogous to transmissions in information-theoretic RA (IRA). IRA …


Digital Commons powered by bepress