Areas of Mathematics

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.

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, (...) coordination, negotiation, games, and reasoning under uncertainty in a distributed environment. In 2007, the third FAMAS workshop, FAMAS'007, was one of the agent workshops gathered together under the umbrella of Multi-Agent Logics, Languages, and Organ- isations - Federated Workshops, MALLOW'007, taking place from 3 to 7 September 2007 in Durham. This current special issue of the Logic Journal of the IGPL gathers together the revised and updated versions of the five best FAMAS'007 contributions. (shrink)

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 (...) calculus, then modern infinitesimal frameworks are more appropriate to interpreting Leibnizian infinitesimal calculus than modern Weierstrassian ones. (shrink)

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 (...) the most natural minimal way of distinguishing content and form and suggest further problems arising for this route. (shrink)

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.

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).

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 (...) the first-order theory of the generating class C, and indicate the problems obstructing such general results for the other classes. These problems arise from the possible existence of nondefinable paths in trees, that need not satisfy the first-order theory of C, so we have started analysing first order definable and undefinable paths in trees. (shrink)

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.

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 (...) m-graph whose nodes are language expressions and the m-edges represent the inference rules of the two original systems. The sobriety of the approach is confirmed by proving that all the fibring notions are universal constructions. This graph-theoretic view is general enough to accommodate very different fibrings of propositional based logics encompassing logics with non-deterministic semantics, logics with an algebraic semantics, logics with partial semantics and substructural logics, among others. Soundness and weak completeness are proved to be preserved under very general conditions. Strong completeness is also shown to be preserved under tighter conditions. In this setting, the collapsing problem appearing in several combinations of logic systems can be avoided. (shrink)

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.

If $U$ is a normal ultrafilter on a measurable cardinal $\kappa$, then the intersection of the $\omega$ first iterated ultrapowers of the universe by $U$ is a Prikry generic extension of the $\omega$th iterated ultrapower.

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.

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 (...) are elementary canonical and thus extend Sahlqvist’s theorem over them. In particular, we give a simple example of an inductive formula which is not frame-equivalent to any Sahlqvist formula. Then, after a deeper analysis of the inductive formulae as set-theoretic operators in descriptive and Kripke frames, we establish a somewhat stronger model-theoretic characterization of these formulae in terms of a suitable equivalence to syntactically simpler formulae in the extension of the language with reversive modalities. Lastly, we study and characterize the elementary canonical formulae in reversive languages with nominals, where the relevant notion of persistence is with respect to discrete frames. (shrink)

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 (...) impossible) is important, namely that it implies a new verdict on a decision puzzle propounded by Jeffrey Barrett and Frank Arntzenius. (shrink)

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.

Reid, Constance. Hilbert (a Biography). Reviewed by Corcoran in Philosophy of Science 39 (1972), 106–08. -/- Constance Reid was an insider of the Berkeley-Stanford logic circle. Her San Francisco home was in Ashbury Heights near the homes of logicians such as Dana Scott and John Corcoran. Her sister Julia Robinson was one of the top mathematical logicians of her generation, as was Julia’s husband Raphael Robinson for whom Robinson Arithmetic was named. Julia was a Tarski PhD and, in recognition of (...) a distinguished career, was elected President of the American Mathematics Society. https://en.wikipedia.org/wiki/Julia_Robinson http://www.awm-math.org/noetherbrochure/Robinson82.html. (shrink)

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 (...) with its treatment of the first three topics, namely generality, necessity, and time. But I am not satisfied with its treatment of normativity, so my comments are exclusively on that topic. (shrink)

We review Solomon Feferman's 1998 essay collection In The Light of Logic (Oxford University Press).

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.

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?

This paper presents a model-theoretic semantics for discourse "about" natural numbers, one that captures what I call "the mathematical-object picture", but avoids what I can "the mathematical-object theory".

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.

We investigate the algebraic structures of square grid graphs and obtain isomorphism theorems.

This essay explores the concept of emergence within the framework of noncommutative systems, challenging traditional views that tie emergent behaviour to commutative rule sets. Emergence typically refers to the phenomena where higher-level complexity arises from the interactions of simpler components, often under deterministic and commutative systems. However, noncommutative systems, where the order of operations affects the outcome, introduce a unique layer of complexity that complicates this understanding. By examining the properties of noncommutative systems through formal mathematical analysis and exploring case (...) studies from quantum mechanics, this essay investigates whether emergence can genuinely arise under noncommutative conditions. The findings suggest that noncommutative rule sets lead to a richer and more intricate form of emergent behaviour, characterised by path dependence and sequence sensitivity. This challenges our existing models of complexity and opens up new pathways for understanding emergent phenomena in both physical and cognitive systems. The implications of this analysis extend beyond theoretical curiosity, suggesting that emergent properties may exist in unexpected and non-linear domains, reshaping our perception of order, chaos, and complexity. (shrink)

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.

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.

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 (...) linear algebra. Linear algebra is used extensively in statistics, mechanical engineering, circuit theory, signal processing, economics and data science/machine learning. I have found in my teaching career that students tend to struggle the most with motivating the "why" behind the abstract concepts discussed in linear algebra. This can be difficult for professors to understand because we are so used to using the language of linear algebra we take for granted why these questions are important in the first place. In other words, we may understand the “why” (after years of using these tools), but our students may not. This text seeks to explain this “why” in an accessible, engaging way. (shrink)

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 (...) diagrams form genuine notational systems, and I argue that this explains why they can play a role in the inferential structure of proofs without undermining their reliability. I then consider whether diagrams can be essential to the proofs in which they appear. (shrink)

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 (...) neutrosophic semigroup rings respectively. This is basically the collection of parameterized subneutrosophic group ring and subneutrosophic semigroup ring of a neutrosophic group ring and neutrosophic semigroup ring respectively. These soft neutrosophic algebraic structures are even bigger than the corresponding classical algebraic structures. It is interesting to see that it wider the area of research for the researcher of algebraic structures. (shrink)

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 (...) neutosophic loop over a neutrosophic loop. It is interesting to note that these notions are defined over finite and infinite neutrosophic algebraic structures. These structures are even bigger than the classical algebraic structures. This book contains five chapters. Chapter one is about the introductory concepts. In chapter two the notions of soft neutrosophic group, soft neutrosophic bigroup and soft neutrosophic N-group are introduced and many fantastic properties are given with illustrative examples. (shrink)

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.

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 (...) a paradigm shift is essential in this computerized world. (shrink)

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.

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.

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.

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.

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.

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.

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.

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).