Areas of Mathematics

Edited by Nemi Boris Pelgrom (Ludwig Maximilians Universität, München)
Related

Contents
435 found
Order:
1 — 50 / 435
Material to categorize
  1. Chương trình đào tạo Toán kinh tế 2.Hà Huy Huyền - 2018 - Chương Trình Đào Tạo Qtkd Trường Đại Học Đồng Nai 2018.
    Mục tiêu của học phần: Sau khi nghiên cứu môn học, sinh viên vừa được trang bị các kiến thức cơ bản về bản chất và nguyên lý tính toán trong các nghiệp vụ tài chính, vừa biết vận dụng các kiến thức đó để xây dựng các bài toán tài chính trong những hoàn cảnh riêng với môi trường và các điều kiện khác nhau.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Constructive Type Theory, an appetizer.Laura Crosilla - forthcoming - In Peter Fritz & Nicholas K. Jones (eds.), Higher-Order Metaphysics. Oxford University Press.
    Recent debates in metaphysics have highlighted the significance of type theories, such as Simple Type Theory (STT), for our philosophical analysis. In this chapter, I present the salient features of a constructive type theory in the style of Martin-Löf, termed CTT. My principal aim is to convey the flavour of this rich, flexible and sophisticated theory and compare it with STT. I especially focus on the forms of quantification which are available in CTT. A further aim is to argue that (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. Dualities for modal N4-lattices.R. Jansana & U. Rivieccio - 2014 - Logic Journal of the IGPL 22 (4):608-637.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  4. Modal twist-structures over residuated lattices.H. Ono & U. Rivieccio - 2014 - Logic Journal of the IGPL 22 (3):440-457.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  5. Introduction: Formal approaches to multi-agent systems: Special issue of best papers of FAMAS 2007.B. Dunin-Keplicz & R. Verbrugge - 2013 - Logic Journal of the IGPL 21 (3):309-310.
    Over the last decade, multi-agent systems have come to form one of the key tech- nologies for software development. The Formal Approaches to Multi-Agent Systems (FAMAS) workshop series brings together researchers from the fields of logic, theoreti- cal computer science and multi-agent systems in order to discuss formal techniques for specifying and verifying multi-agent systems. FAMAS addresses the issues of logics for multi-agent systems, formal methods for verification, for example model check- ing, and formal approaches to cooperation, multi-agent planning, communication, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  6. Is Leibnizian calculus embeddable in first order logic?Piotr Błaszczyk, Vladimir Kanovei, Karin U. Katz, Mikhail G. Katz, Taras Kudryk, Thomas Mormann & David Sherry - 2017 - Foundations of Science 22 (4):73 - 88.
    To explore the extent of embeddability of Leibnizian infinitesimal calculus in first-order logic (FOL) and modern frameworks, we propose to set aside ontological issues and focus on pro- cedural questions. This would enable an account of Leibnizian procedures in a framework limited to FOL with a small number of additional ingredients such as the relation of infinite proximity. If, as we argue here, first order logic is indeed suitable for developing modern proxies for the inferential moves found in Leibnizian infinitesimal (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  7. Assertion, denial, content, and (logical) form.Jack Woods - 2016 - Synthese 193 (6):1667-1680.
    I discuss Greg Restall’s attempt to generate an account of logical consequence from the incoherence of certain packages of assertions and denials. I take up his justification of the cut rule and argue that, in order to avoid counterexamples to cut, he needs, at least, to introduce a notion of logical form. I then suggest a few problems that will arise for his account if a notion of logical form is assumed. I close by sketching what I take to be (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  8. Book review of: M. Schagrin, R. Dipert, and W. Rapaport, Logic: A Computer Approach. [REVIEW]Gary James Jason - 1987 - Philosophia 17 (4):557-558.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  9. The Notion of Infinity in Plotinus and Cantor.Giannis Stamatellos & Dionysis Mentzeniotis (eds.) - 2008
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  10. Decidable Formulas Of Intuitionistic Primitive Recursive Arithmetic.Saeed Salehi - 2002 - Reports on Mathematical Logic 36 (1):55-61.
    By formalizing some classical facts about provably total functions of intuitionistic primitive recursive arithmetic (iPRA), we prove that the set of decidable formulas of iPRA and of iΣ1+ (intuitionistic Σ1-induction in the language of PRA) coincides with the set of its provably ∆1-formulas and coincides with the set of its provably atomic formulas. By the same methods, we shall give another proof of a theorem of Marković and De Jongh: the decidable formulas of HA are its provably ∆1-formulas.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  11. Erratum to “The Ricean Objection: An Analogue of Rice's Theorem for First-Order Theories” Logic Journal of the IGPL, 16: 585–590. [REVIEW]Igor Oliveira & Walter Carnielli - 2009 - Logic Journal of the IGPL 17 (6):803-804.
    This note clarifies an error in the proof of the main theorem of “The Ricean Objection: An Analogue of Rice’s Theorem for First-Order Theories”, Logic Journal of the IGPL, 16(6): 585–590(2008).
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  12. Classes and theories of trees associated with a class of linear orders.Valentin Goranko & Ruaan Kellerman - 2011 - Logic Journal of the IGPL 19 (1):217-232.
    Given a class of linear order types C, we identify and study several different classes of trees, naturally associated with C in terms of how the paths in those trees are related to the order types belonging to C. We investigate and completely determine the set-theoretic relationships between these classes of trees and between their corresponding first-order theories. We then obtain some general results about the axiomatization of the first-order theories of some of these classes of trees in terms of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  13. Expanding the universe of universal logic.James Trafford - 2014 - Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 29 (3):325-343.
    In [5], Béziau provides a means by which Gentzen’s sequent calculus can be combined with the general semantic theory of bivaluations. In doing so, according to Béziau, it is possible to construe the abstract “core” of logics in general, where logical syntax and semantics are “two sides of the same coin”. The central suggestion there is that, by way of a modification of the notion of maximal consistency, it is possible to prove the soundness and completeness for any normal logic. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  14. Il carteggio fra Peano e Camillo Berneri.Enrico Pasini - 2001 - In Clara Silvia Roero (ed.), Giuseppe Peano. Matematica, Cultura E Società. L’Artistica. pp. 49-59.
    Between Giuseppe Peano and Camillo Berneri, a foremost protagonist of the Italian anarchist movement, an interesting correspondence was exchanged in the years 1925-1929. Along with a presentation of the correspondence, Peano's political attitude and the role of his international language projects in early 20th century Italian left are discussed.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  15. On graph-theoretic fibring of logics.A. Sernadas, C. Sernadas, J. Rasga & M. Coniglio - 2009 - Journal of Logic and Computation 19 (6):1321-1357.
    A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems is an (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  16. Modal Logics for Topological Spaces.Konstantinos Georgatos - 1993 - Dissertation, City University of New York
    In this thesis we present two logical systems, $\bf MP$ and $\MP$, for the purpose of reasoning about knowledge and effort. These logical systems will be interpreted in a spatial context and therefore, the abstract concepts of knowledge and effort will be defined by concrete mathematical concepts.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   11 citations  
  17. Le Wittgenstein de Hintikka : percées et excès d'une interprétation hétérodoxe.Ludovic Soutif - 2009 - Revue Internationale de Philosophie 250 (4):423-434.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  18. Uniformly convex Banach spaces are reflexive—constructively.Douglas S. Bridges, Hajime Ishihara & Maarten McKubre-Jordens - 2013 - Mathematical Logic Quarterly 59 (4-5):352-356.
    We propose a natural definition of what it means in a constructive context for a Banach space to be reflexive, and then prove a constructive counterpart of the Milman-Pettis theorem that uniformly convex Banach spaces are reflexive.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  19. Elementary canonical formulae: extending Sahlqvist’s theorem.Valentin Goranko & Dimiter Vakarelov - 2006 - Annals of Pure and Applied Logic 141 (1):180-217.
    We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive formulae (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   26 citations  
  20. A path to the epistemology of mathematics: homotopy theory.Jean-Pierre Marquis - 2006 - In Jeremy Gray & Jose Ferreiros (eds.), The Architecture of Modern Mathematics: Essays in History and Philosophy. Oxford University Press. pp. 239--260.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  21. A proof of the impossibility of completing infinitely many tasks.Jeremy Gwiazda - 2012 - Pacific Philosophical Quarterly 93 (1):1-7.
    In this article, I argue that it is impossible to complete infinitely many tasks in a finite time. A key premise in my argument is that the only way to get to 0 tasks remaining is from 1 task remaining, when tasks are done 1-by-1. I suggest that the only way to deny this premise is by begging the question, that is, by assuming that supertasks are possible. I go on to present one reason why this conclusion (that supertasks are (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  22. This Side of Paradox.Nathan Salmon - 1993 - Philosophical Topics 21 (2):187-197.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   14 citations  
  23. From Traditional Set Theory – that of Cantor, Hilbert , Gödel, Cohen – to Its Necessary Quantum Extension.Edward G. Belaga - manuscript
    The original purpose of the present study, 2011, started with a preprint «On the Probable Failure of the Uncountable Power Set Axiom», 1988, is to save from the transfinite deadlock of higher set theory the jewel of mathematical Continuum — this genuine, even if mostly forgotten today raison d’être of all traditional set-theoretical enterprises to Infinity and beyond, from Georg Cantor to David Hilbert to Kurt Gödel to W. Hugh Woodin to Buzz Lightyear.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  24. Topological Representations of Mereological Systems.Thomas Mormann - 2000 - Poznan Studies in the Philosophy of the Sciences and the Humanities 76:463 -486.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   7 citations  
  25. “Barriers to implication”.Peter B. M. Vranas - unknown
    I was quite excited when I first read Restall and Russell’s (2010) paper. For two reasons. First, because the paper provides rigorous formulations and formal proofs of implication barrier theses, namely “theses [which] deny that one can derive sentences of one type from sentences of another”. Second (and primarily), because the paper proves a general theorem, the Barrier Construction Theorem, which unifies implication barrier theses concerning four topics: generality, necessity, time, and normativity. After thinking about the paper, I am satisfied (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  26. Review of S. Feferman's in the light of logic. [REVIEW]Andrew Arana - 2005 - Mathematical Intelligencer 27 (4).
    We review Solomon Feferman's 1998 essay collection In The Light of Logic (Oxford University Press).
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  27. Epistemic truth and excluded middle.Cesare Cozzo - 1998 - Theoria 64 (2-3):243-282.
    Can an epistemic conception of truth and an endorsement of the excluded middle (together with other principles of classical logic abandoned by the intuitionists) cohabit in a plausible philosophical view? In PART I I describe the general problem concerning the relation between the epistemic conception of truth and the principle of excluded middle. In PART II I give a historical overview of different attitudes regarding the problem. In PART III I sketch a possible holistic solution.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  28. Logic and limits of knowledge and truth.Patrick Grim - 1988 - Noûs 22 (3):341-367.
    Though my ultimate concern is with issues in epistemology and metaphysics, let me phrase the central question I will pursue in terms evocative of philosophy of religion: What are the implications of our logic-in particular, of Cantor and G6del-for the possibility of omniscience?
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   19 citations  
  29. Book review of: R. Turner, Logics for AI. [REVIEW]Gary James Jason - 1989 - Philosophia 19 (1):73-83.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  30. Meaning and Justification: The Case of Modus Ponens.Joshua Schechter & David Enoch - 2006 - Noûs 40 (4):687 - 715.
    In virtue of what are we justified in employing the rule of inference Modus Ponens? One tempting approach to answering this question is to claim that we are justified in employing Modus Ponens purely in virtue of facts concerning meaning or concept-possession. In this paper, we argue that such meaning-based accounts cannot be accepted as the fundamental account of our justification.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   35 citations  
Algebra
  1. Some Results on a Generalized Version of Congruent Numbers.Leomarich Casinillo & Emily Casinillo - 2021 - Inprime: Indonesian Journal of Pure and Applied Mathematics 3 (1):1-6.
    This paper aims to construct a new formula that generates a generalized version of congruent numbers based on a generalized version of Pythagorean triples. Here, an elliptic curve equation is constructed from the derived generalized version of Pythagorean triples and congruent numbers and gives some new results.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. Cubic Polynomial for the Series of Consecutive Cubes under Alternating Signs.Leomarich Casinillo - 2021 - Inprime: Indonesian Journal of Pure and Applied Mathematics 3 (2):86-91.
    This paper aims to develop an elegant formula for the series of consecutive cubes of natural numbers under alternating signs. In addition, this paper investigates the formula under odd and even number of terms and discuss some important findings.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. Principles and Philosophy of Linear Algebra: A Gentle Introduction.Paul Mayer - manuscript
    Linear Algebra is an extremely important field that extends everyday concepts about geometry and algebra into higher spaces. This text serves as a gentle motivating introduction to the principles (and philosophy) behind linear algebra. This is aimed at undergraduate students taking a linear algebra class - in particular engineering students who are expected to understand and use linear algebra to build and design things, however it may also prove helpful for philosophy majors and anyone else interested in the ideas behind (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. Who's Afraid of Mathematical Diagrams?Silvia De Toffoli - 2023 - Philosophers' Imprint 23 (1).
    Mathematical diagrams are frequently used in contemporary mathematics. They are, however, widely seen as not contributing to the justificatory force of proofs: they are considered to be either mere illustrations or shorthand for non-diagrammatic expressions. Moreover, when they are used inferentially, they are seen as threatening the reliability of proofs. In this paper, I examine certain examples of diagrams that resist this type of dismissive characterization. By presenting two diagrammatic proofs, one from topology and one from algebra, I show that (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  5. SOFT NEUTROSOPHIC ALGEBRAIC STRUCTURES AND THEIR GENERALIZATION, Vol. 2.Florentin Smarandache, Mumtaz Ali & Muhammad Shabir - 2014 - Columbus, OH, USA: Educational Publisher.
    In this book we define some new notions of soft neutrosophic algebraic structures over neutrosophic algebraic structures. We define some different soft neutrosophic algebraic structures but the main motivation is two-fold. Firstly the classes of soft neutrosophic group ring and soft neutrosophic semigroup ring defined in this book is basically the generalization of two classes of rings: neutrosophic group rings and neutrosophic semigroup rings. These soft neutrosophic group rings and soft neutrosophic semigroup rings are defined over neutrosophic group rings and (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  6. SOFT NEUTROSOPHIC ALGEBRAIC STRUCTURES AND THEIR GENERALIZATION, Vol. 1.Florentin Smarandache, Mumtaz Ali & Muhammad Shabir - 2014 - Columbus, OH, USA: Educational Publisher.
    In this book the authors introduced the notions of soft neutrosophic algebraic structures. These soft neutrosophic algebraic structures are basically defined over the neutrosophic algebraic structures which means a parameterized collection of subsets of the neutrosophic algebraic structure. For instance, the existence of a soft neutrosophic group over a neutrosophic group or a soft neutrosophic semigroup over a neutrosophic semigroup, or a soft neutrosophic field over a neutrosophic field, or a soft neutrosophic LA-semigroup over a neutrosophic LAsemigroup, or a soft (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. Super Special Codes using Super Matrices.W. B. Vasantha Kandasamy, Florentin Smarandache & K. Ilanthenral - 2010 - Stockholm, Sweden: Svenska fysikarkivet.
    The new classes of super special codes are constructed in this book using the specially constructed super special vector spaces. These codes mainly use the super matrices. These codes can be realized as a special type of concatenated codes.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  8. Super Linear Algebra.W. B. Vasantha Kandasamy & Florentin Smarandache - 2008 - Ann Arbor, MI, USA: ProQuest Information & Learning.
    In this book, the authors introduce the notion of Super linear algebra and super vector spaces using the definition of super matrices defined by Horst (1963). Many theorems on super linear algebra and its properties are proved. Some theorems are left as exercises for the reader. These new class of super linear algebras which can be thought of as a set of linear algebras, following a stipulated condition, will find applications in several fields using computers. The authors feel that such (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  9. Algebraic Structures using Super Interval Matrices.W. B. Vasantha Kandasamy & Florentin Smarandache - 2011 - Columbus, OH, USA: Educational Publisher.
    In this book authors for the first time introduce the notion of super interval matrices using special intervals. The advantage of using super interval matrices is that one can build only one vector space using m × n interval matrices, but in case of super interval matrices we can have several such spaces depending on the partition on the interval matrix.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  10. Superbimatrices and Their Generalizations.W. B. Vasantha Kandasamy & Florentin Smarandache - 2009 - Slatina, Romania: CuArt.
    The systematic study of supermatrices and super linear algebra has been carried out in 2008. These new algebraic structures find their applications in fuzzy models, Leontief economic models and data-storage in computers.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. Introduction to Neutrosophic Restricted SuperHyperGraphs and Neutrosophic Restricted SuperHyperTrees and several of their properties.Masoud Ghods, Zahra Rostami & Florentin Smarandache - 2022 - Neutrosophic Sets and Systems 50 (1):480-487.
    In this article, we first provide a modified definition of SuperHyperGraphs (SHG) and we call it Restricted SuperHyperGraphs (R-SHG). We then generalize the R-SHG to the neutrosophic graphs and then define the corresponding trees. In the following, we examine the Helly property for subtrees of SuperHyperGraphs.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  12. Neutrosophic Super Matrices and Quasi Super Matrices.Florentin Smarandache & W. B. Vasantha Kandasamy - 2012 - Columbus, OH, USA: Zip Publishing.
    In this book authors study neutrosophic super matrices. The concept of neutrosophy or indeterminacy happens to be one the powerful tools used in applications like FCMs and NCMs where the expert seeks for a neutral solution. Thus this concept has lots of applications in fuzzy neutrosophic models like NRE, NAM etc. These concepts will also find applications in image processing where the expert seeks for a neutral solution.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  13. NeutroOrderedAlgebra: Applications to Semigroups.Madeleine Al-Tahan, Florentin Smarandache & Bijan Davvaz - 2021 - Neutrosophic Sets and Systems 39 (1):133-147.
    Starting with a partial order on a NeutroAlgebra, we get a NeutroStructure. The latter if it satisfies the conditions of NeutroOrder, it becomes a NeutroOrderedAlgebra. In this paper, we apply our new defined notion to semigroups by studying NeutroOrderedSemigroups. More precisely, we define some related terms like NeutrosOrderedSemigroup, NeutroOrderedIdeal, NeutroOrderedFilter, NeutroOrderedHomomorphism, etc., illustrate them via some examples, and study some of their properties.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  14. On Some NeutroHyperstructures.Madeleine Al-Tahan, Bijan Davvaz, Florentin Smarandache & Osman Anis - 2021 - Symmetry 13 (4):1-12.
    Neutrosophy, the study of neutralities, is a new branch of Philosophy that has applications in many different fields of science. Inspired by the idea of Neutrosophy, Smarandache introduced NeutroAlgebraicStructures (or NeutroAlgebras) by allowing the partiality and indeterminacy to be included in the structures’ operations and/or axioms.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  15. The SuperHyperFunction and the Neutrosophic SuperHyperFunction (revisited again).Florentin Smarandache - 2022 - Neutrosophic Sets and Systems 49 (1):594-600.
    In this paper, one recalls the general definition of the SuperHyperAlgebra with its SuperHyperOperations and SuperHyperAxioms [2, 6]. Then one introduces for the first time the SuperHyperTopology and especially the SuperHyperFunction and Neutrosophic SuperHyperFunction. One gives a numerical example of a Neutro-SuperHyperGroup.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  16. Introduction to SuperHyperAlgebra and Neutrosophic SuperHyperAlgebra.Florentin Smarandache - 2022 - Journal of Algebraic Hyperstructures and Logical Algebras 3 (2):17-24.
    In this paper we recall our concepts of n th-Power Set of a Set, SuperHyperOperation, SuperHyperAxiom, SuperHyperAlgebra, and their corresponding Neutrosophic SuperHyperOperation, Neutrosophic SuperHyperAxiom and Neutrosophic SuperHyperAlgebra. In general, in any field of knowledge, one actually encounters SuperHyperStructures (or more accurately (m, n)- SuperHyperStructures).
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  17. Introducción a la Super-Hiper-Álgebra y la Super-HiperÁlgebra Neutrosófica.Florentin Smarandache - 2022 - Neutrosophic Computing and Machine Learning 20 (1):1-6.
    In this article, the concepts of Nth Power Set of a Set, Super-Hyper-Oper-Operation, Super-Hyper-Axiom, SuperHyper-Algebra, and their corresponding Neutrosophic Super-Hyper-Oper-Operation, Neutrosophic Super-Hyper-Axiom and Neutrosophic Super-Hyper-Algebra are reviewed. In general, in any field of knowledge, really what are found are Super-HyperStructures (or more specifically Super-Hyper-Structures (m, n)).
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  18. Algebraic structures of neutrosophic triplets, neutrosophic duplets, or neutrosophic multisets. Volume I.Florentin Smarandache, Xiaohong Zhang & Mumtaz Ali - 2018 - Basel, Switzerland: MDPI. Edited by Florentin Smarandache, Xiaohong Zhang & Mumtaz Ali.
    The topics approached in the 52 papers included in this book are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  19. Algunos tópicos de Lógica matemática y los Fundamentos de la matemática.Franklin Galindo - manuscript
    En este trabajo matemático-filosófico se estudian cuatro tópicos de la Lógica matemática: El método de construcción de modelos llamado Ultraproductos, la Propiedad de Interpolación de Craig, las Álgebras booleanas y los Órdenes parciales separativos. El objetivo principal del mismo es analizar la importancia que tienen dichos tópicos para el estudio de los fundamentos de la matemática, desde el punto de vista del platonismo matemático. Para cumplir con tal objetivo se trabajará en el ámbito de la Matemática, de la Metamatemática y (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  20. Álgebras booleanas, órdenes parciales y axioma de elección.Franklin Galindo - 2017 - Divulgaciones Matematicas 18 ( 1):34-54.
    El objetivo de este artículo es presentar una demostración de un teorema clásico sobre álgebras booleanas y ordenes parciales de relevancia actual en teoría de conjuntos, como por ejemplo, para aplicaciones del método de construcción de modelos llamado “forcing” (con álgebras booleanas completas o con órdenes parciales). El teorema que se prueba es el siguiente: “Todo orden parcial se puede extender a una única álgebra booleana completa (salvo isomorfismo)”. Donde extender significa “sumergir densamente”. Tal demostración se realiza utilizando cortaduras de (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 435