Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Other Mathematics (18)
- Algebra (17)
- Number Theory (10)
- Set Theory (9)
- Analysis (8)
-
- Algebraic Geometry (7)
- Computer Engineering (7)
- Engineering (7)
- Other Computer Engineering (7)
- Computer Sciences (6)
- Other Computer Sciences (6)
- Applied Mathematics (4)
- Arts and Humanities (2)
- Statistics and Probability (2)
- Applied Statistics (1)
- Catholic Studies (1)
- Computational Engineering (1)
- Digital Communications and Networking (1)
- Discrete Mathematics and Combinatorics (1)
- Other Engineering (1)
- Other Physical Sciences and Mathematics (1)
- Other Statistics and Probability (1)
- Philosophy (1)
- Physics (1)
- Religion (1)
- Statistical Theory (1)
- Institution
- Keyword
-
- Neutrosophic logic (6)
- Game theory (3)
- Logic (3)
- Algebraic structures (2)
- George Boole (2)
-
- Nominal sets (2)
- (Self-distributive (1)
- (commutative (1)
- 2-valued Boolean logic (1)
- Algebraic Structures (1)
- Algebraic models (1)
- Anti-bisector (1)
- Anti-height (1)
- Aristotle (1)
- Belnap’s 4-symbol valued logic (1)
- Bol identity (1)
- Borel Complete (1)
- Catholic Intellectual Tradition (1)
- Circle (1)
- Coalgebra (1)
- Coinduction (1)
- Commutative (1)
- Commutative quantale (1)
- Complexity of Isomorphism (1)
- Conjunctive rule (1)
- Corecursion (1)
- Correlation Coefficient of Interval Neutrosophic Set (1)
- Counter-examples to Dempster rule (1)
- Counterexamples to Conjunctive rule (1)
- Cover modality (1)
- Publication
- Publication Type
Articles 1 - 30 of 33
Full-Text Articles in Logic and Foundations
Ancestor Worship In The Logic Of Games. How Foundational Were Aristotle's Contributions?, John Woods
Ancestor Worship In The Logic Of Games. How Foundational Were Aristotle's Contributions?, John Woods
Baltic International Yearbook of Cognition, Logic and Communication
Notwithstanding their technical virtuosity and growing presence in mainstream thinking, game theoretic logics have attracted a sceptical question: "Granted that logic can be done game theoretically, but what would justify the idea that this is the preferred way to do it?'' A recent suggestion is that at least part of the desired support might be found in the Greek dialectical writings. If so, perhaps we could say that those works possess a kind of foundational significance. The relation of being foundational for is interesting in its own right. In this paper, I explore its ancient applicability to relevant, paraconsistent and …
Games And Logic, Gabriel Sandu
Games And Logic, Gabriel Sandu
Baltic International Yearbook of Cognition, Logic and Communication
The idea behind these games is to obtain an alternative characterization of logical notions cherished by logicians such as truth in a model, or provability (in a formal system). We offer a quick survey of Hintikka's evaluation games, which offer an alternative notion of truth in a model for first-order langauges. These are win-lose, extensive games of perfect information. We then consider a variation of these games, IF games, which are win-lose extensive games of imperfect information. Both games presuppose that the meaning of the basic vocabulary of the language is given. To give an account of the linguistic conventions …
Constructive Type Theory And The Dialogical Approach To Meaning, Shahid Rahman, Nicolas Clerbout
Constructive Type Theory And The Dialogical Approach To Meaning, Shahid Rahman, Nicolas Clerbout
Baltic International Yearbook of Cognition, Logic and Communication
In its origins Dialogical logic constituted one part of a new movement called the Erlangen School or Erlangen Constructivism. Its goal was to provide a new start to a general theory of language and of science. According to the Erlangen-School, language is not just a fact that we discover, but a human cultural accomplishment whose construction reason can and should control. The resulting project of intentionally constructing a scientific language was called the Orthosprache-project. Unfortunately, the Orthosprache-project was not further developed and seemed to fade away. It is possible that one of the reasons for this fading away is that …
Ludics, Dialogue And Inferentialism, Alain Lecomte
Ludics, Dialogue And Inferentialism, Alain Lecomte
Baltic International Yearbook of Cognition, Logic and Communication
In this paper, we try to show that Ludics, a (pre-)logical framework invented by J-Y. Girard, enables us to rethink some of the relationships between Philosophy, Semantics and Pragmatics. In particular, Ludics helps to shed light on the nature of dialogue and to articulate features of Brandom's inferentialism.
Argumentation And Inference: A Unified Approach, Christophe Fouqueré, Myriam Quatrini
Argumentation And Inference: A Unified Approach, Christophe Fouqueré, Myriam Quatrini
Baltic International Yearbook of Cognition, Logic and Communication
We propose in this paper to use Ludics as a unified framework for the analysis of dialogue and the reasoning system. Not only is Ludics a logical theory, but it may also be built by means of concepts of game theory. We first present the main concepts of Ludics. A design is an abstraction and a generalization of the concept of proof. Interaction between designs is equivalent to cut elimination or modus ponens in logical theories. It appears to be a natural means for representing dialogues and also for reasoning. A design is a set of sequences of alternate actions …
Antilogic, Benoît Castelnérac, Mathieu Marion
Antilogic, Benoît Castelnérac, Mathieu Marion
Baltic International Yearbook of Cognition, Logic and Communication
This paper is an interim report of joint work begun in (Castelnérac & Marion 2009) on dialectic from Parmenides to Aristotle. In the first part we present rules for dialectical games, understood as a specific form of antilogikê developed by philosophers, and explain some of the key concepts of these dialectical games in terms of ideas from game semantics. In the games we describe, for a thesis A asserted by the answerer, a questioner must elicit the answerer’s assent to further assertions B1, B2,…, Bn, which form a scoreboard from which the questioner seeks …
Trust And Risk In Games Of Partial Information, Robin Clark
Trust And Risk In Games Of Partial Information, Robin Clark
Baltic International Yearbook of Cognition, Logic and Communication
Games of partial information have been used to explicate Gricean implicature; their solution concept has been murky, however. In this paper, I will develop a simple solution concept that can be used to solve games of partial information, depending on the players' mutual trust and tolerance for risk. In addition, I will develop an approach to non-conventional quantity implicatures that relies on "face" (Goffman (1967), Brown and Levinson (1987)).
Relation Between Hilbert Algebras And Be–Algebras, A. Rezaei, A. B. Saeid, R. A. Borzooei
Relation Between Hilbert Algebras And Be–Algebras, A. Rezaei, A. B. Saeid, R. A. Borzooei
Applications and Applied Mathematics: An International Journal (AAM)
Hilbert algebras are introduced for investigations in intuitionistic and other non - classical logics and BE -algebra is a generalization of dual BCK -algebra. In this paper, we investigate the relationship between Hilbert algebras and BE -algebras. In fact, we show that a commutative implicative BE -algebra is equivalent to the commutative self distributive BE -algebra, therefore Hilbert algebras and commutative self distributive BE -algebras are equivalent.
Hyperbolic Geometry And God, Andrew Lazowski
Hyperbolic Geometry And God, Andrew Lazowski
Presidential Seminar on the Catholic Intellectual Tradition
Development of hyperbolic geometry --Fifth axiom is a problem --Model of the divine --Infinite power --Infinite knowledge --Infinite benevolence.
Examples Where The Conjunctive And Dempster’S Rules Are Insensitive, Florentin Smarandache, Jean Dezert, Valeri Kroumov
Examples Where The Conjunctive And Dempster’S Rules Are Insensitive, Florentin Smarandache, Jean Dezert, Valeri Kroumov
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we present several counter-examples to the Conjunctive rule and to Dempster rule of combinations in information fusion.
Borel Complexity Of The Isomorphism Relation For O-Minimal Theories, Davender Singh Sahota '99
Borel Complexity Of The Isomorphism Relation For O-Minimal Theories, Davender Singh Sahota '99
Doctoral Dissertations
In 1988, Mayer published a strong form of Vaught's Conjecture for o-minimal theories (1). She showed Vaught's Conjecture holds, and characterized the number of countable models of an o-minimal theory T if T has fewer than 2K ° countable models. Friedman and Stanley have shown in (2) that several elementary classes are Borel complete. This work addresses the class of countable models of an o-minimal theory T when T has 2N ° countable models, including conditions for when this class is Borel complete. The main result is as follows.
Theorem 1. Let T be an o-minimal theory in a countable …
Relation Lifting, With An Application To The Many-Valued Cover Modality, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jirí Velebil
Relation Lifting, With An Application To The Many-Valued Cover Modality, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jirí Velebil
Engineering Faculty Articles and Research
We introduce basic notions and results about relation liftings on categories enriched in a commutative quantale. We derive two necessary and sufficient conditions for a 2-functor T to admit a functorial relation lifting: one is the existence of a distributive law of T over the “powerset monad” on categories, one is the preservation by T of “exactness” of certain squares. Both characterisations are generalisations of the “classical” results known for set functors: the first characterisation generalises the existence of a distributive law over the genuine powerset monad, the second generalises preservation of weak pullbacks.
The results presented in this paper …
A Reduction Theorem For The Kripke-Joyal Semantics: Forcing Over An Arbitrary Category Can Always Be Replaced By Forcing Over A Complete Heyting Algebra, Imants Barušs, Robert Woodrow
A Reduction Theorem For The Kripke-Joyal Semantics: Forcing Over An Arbitrary Category Can Always Be Replaced By Forcing Over A Complete Heyting Algebra, Imants Barušs, Robert Woodrow
Psychology
No abstract provided.
Fuzzy Neutrosophic Models For Social Scientists, Florentin Smarandache, W.B. Vasantha Kandasamy
Fuzzy Neutrosophic Models For Social Scientists, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book, authors give the notion of different neutrosophic models like, neutrosophic cognitive maps (NCMs), neutrosophic relational maps (NEMs), neutrosophic relational equations (NREs), neutrosophic bidirectional associative memories (NBAMs) and neutrosophic associative memories (NAMs) for socio scientists. This book has six chapters. The first chapter introduces the basic concepts of neutrosophic numbers and notions about neutrosophic graphs which are essential to construct these neutrosophic models. In chapter two we describe the concept of neutrosophic matrices and the essential operations related with them which are used in the study and working of these neutrosophic models. However the reader must be familiar …
Correlation Coefficient Of Interval Neutrosophic Set, Said Broumi, Florentin Smarandache
Correlation Coefficient Of Interval Neutrosophic Set, Said Broumi, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we introduce for the first time the concept of correlation coefficients of interval valued neutrosophic set (INS for short). Respective numerical examples are presented.
Dynamic Sequent Calculus For The Logic Of Epistemic Actions And Knowledge, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano
Dynamic Sequent Calculus For The Logic Of Epistemic Actions And Knowledge, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano
Engineering Faculty Articles and Research
"Dynamic Logics (DLs) form a large family of nonclassical logics, and perhaps the one enjoying the widest range of applications. Indeed, they are designed to formalize change caused by actions of diverse nature: updates on the memory state of a computer, displacements of moving robots in an environment, measurements in models of quantum physics, belief revisions, knowledge updates, etc. In each of these areas, DL-formulas express properties of the model encoding the present state of affairs, as well as the pre- and post-conditions of a given action. Actions are semantically represented as transformations of one model into another, encoding the …
Nominal Regular Expressions For Languages Over Infinite Alphabets, Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto
Nominal Regular Expressions For Languages Over Infinite Alphabets, Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto
Engineering Faculty Articles and Research
We propose regular expressions to abstractly model and study properties of resource-aware computations. Inspired by nominal techniques – as those popular in process calculi – we extend classical regular expressions with names (to model computational resources) and suitable operators (for allocation, deallocation, scoping of, and freshness conditions on resources). We discuss classes of such nominal regular expressions, show how such expressions have natural interpretations in terms of languages over infinite alphabets, and give Kleene theorems to characterise their formal languages in terms of nominal automata.
Nominal Coalgebraic Data Types With Applications To Lambda Calculus, Alexander Kurz, Daniela Petrişan, Paula Severi, Fer-Jan De Vries
Nominal Coalgebraic Data Types With Applications To Lambda Calculus, Alexander Kurz, Daniela Petrişan, Paula Severi, Fer-Jan De Vries
Engineering Faculty Articles and Research
We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.
Nominal Computation Theory (Dagstuhl Seminar 13422), Mikołaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts
Nominal Computation Theory (Dagstuhl Seminar 13422), Mikołaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts
Engineering Faculty Articles and Research
This report documents the program and the outcomes of Dagstuhl Seminar 13422 “Nominal Computation Theory”. The underlying theme of the seminar was nominal sets (also known as sets with atoms or Fraenkel-Mostowski sets) and they role and applications in three distinct research areas: automata over infinite alphabets, program semantics using nominal sets and nominal calculi of concurrent processes.
Epistemic Updates On Algebras, Alexander Kurz, Alessandra Palmigiano
Epistemic Updates On Algebras, Alexander Kurz, Alessandra Palmigiano
Engineering Faculty Articles and Research
We develop the mathematical theory of epistemic updates with the tools of duality theory. We focus on the Logic of Epistemic Actions and Knowledge (EAK), introduced by Baltag-Moss-Solecki, without the common knowledge operator. We dually characterize the product update construction of EAK as a certain construction transforming the complex algebras associated with the given model into the complex algebra associated with the updated model. This dual characterization naturally generalizes to much wider classes of algebras, which include, but are not limited to, arbitrary BAOs and arbitrary modal expansions of Heyting algebras (HAOs). As an application of this dual characterization, we …
Residuated Frames With Applications To Decidability, Nikolaos Galatos, Peter Jipsen
Residuated Frames With Applications To Decidability, Nikolaos Galatos, Peter Jipsen
Mathematics, Physics, and Computer Science Faculty Articles and Research
Residuated frames provide relational semantics for substructural logics and are a natural generalization of Kripke frames in intuitionistic and modal logic, and of phase spaces in linear logic. We explore the connection between Gentzen systems and residuated frames and illustrate how frames provide a uniform treatment for semantic proofs of cut-elimination, the finite model property and the finite embeddability property, which imply the decidability of the equational/universal theories of the associated residuated lattice-ordered groupoids. In particular these techniques allow us to prove that the variety of involutive FL-algebras and several related varieties have the finite model property.
Subset Polynomial Semirings And Subset Matrix Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy
Subset Polynomial Semirings And Subset Matrix Semirings, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors introduce the notion of subset polynomial semirings and subset matrix semirings. The study of algebraic structures using subsets were recently carried out by the authors. Here we define the notion of subset row matrices, subset column matrices and subset m × n matrices. Study of this kind is developed in chapter two of this book. If we use subsets of a set X; say P(X), the power set of the set X....
Hence if P(X) is replaced by a group or a semigroup we get the subset matrix to be only a subset matrix semigroup. If …
Subset Interval Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy
Subset Interval Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
The study of groupoids is meager and we have recently introduced the new notion of subset groupoids and have studied them. It is interesting to keep on record that interval groupoids have been studied by us in 2010. Further when the subsets of a loop are taken they also form only a subset groupoid and not a subset loop. Thus we do not have the concept of subset interval loop they only form a subset interval groupoid. Special elements like subset interval zero divisors, subset interval idempotents and subset interval units are studied. Concept of subset interval groupoid homomorphism is …
Subset Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy
Subset Groupoids, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors introduce the new notion of constructing non associative algebraic structures using subsets of a groupoid. Thus subset groupoids are constructed using groupoids or loops. Even if we use subsets of loops still the algebraic structure we get with it is only a groupoid. However we can get a proper subset of it to be a subset loop which will be isomorphic with the loop which was used in the construction of the subset groupoid. To the best of the authors’ knowledge this is the first time non associative algebraic structures are constructed using subsets. We get …
Algebraic Structures Using [0,N), Florentin Smarandache, Vasantha Kandasamy
Algebraic Structures Using [0,N), Florentin Smarandache, Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors for the first time introduce a new method of building algebraic structures on the interval [0, n). This study is interesting and innovative. However, [0, n) is a semigroup under product, × modulo n and a semigroup under min or max operation. Further [0, n) is a group under addition modulo n. We see [0, n) under both max and min operation is a semiring. [0, n) under + and × is not in general a ring. We define S = {[0, n), +, ×} to be a pseudo special ring as the distributive law is …
Variance On Topics Of Plane Geometry, Florentin Smarandache, Ion Patrascu
Variance On Topics Of Plane Geometry, Florentin Smarandache, Ion Patrascu
Branch Mathematics and Statistics Faculty and Staff Publications
This book contains 21 papers of plane geometry. It deals with various topics, such as: quasi-isogonal cevians, nedians, polar of a point with respect to a circle, anti-bisector, aalsonti-symmedian, anti-height and their isogonal. A nedian is a line segment that has its origin in a triangle’s vertex and divides the opposite side in Q equal segments. The papers also study distances between remarkable points in the 2D-geometry, the circumscribed octagon and the inscribable octagon, the circles adjointly ex-inscribed associated to a triangle, and several classical results such as: Carnot circles, Euler’s line, Desargues theorem, Sondat’s theorem, Dergiades theorem, Stevanovic’s theorem, …
Filters Via Neutrosophic Crisp Sets, A. A. Salama, Florentin Smarandache
Filters Via Neutrosophic Crisp Sets, A. A. Salama, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we introduce the notion of filter on the neutrosophic crisp set, then we consider a generalization of the filter’s studies. Afterwards, we present the important neutrosophic crisp filters. We also study several relations between different neutrosophic crisp filters and neutrosophic topologies. Possible applications to database systems are touched upon.
More On Intuitionistic Neutrosophic Soft Sets, Said Broumi, Florentin Smarandache
More On Intuitionistic Neutrosophic Soft Sets, Said Broumi, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
Intuitionistic Neutrosophic Soft Set theory proposed by S. Broumi and F. Samarandache [28], has been regarded as an effective mathematical tool to deal with uncertainties. In this paper new operations on intuitionistic neutrosophic soft sets have been introduced . Some results relating to the properties of these operations have been established. Moreover ,we illustrate their interconnections between each other.
N-Valued Refined Neutrosophic Logic And Its Applications To Physics, Florentin Smarandache
N-Valued Refined Neutrosophic Logic And Its Applications To Physics, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In this paper we present a short history of logics: from particular cases of 2-symbol or numerical valued logic to the general case of n-symbol or numerical valued logic. We show generalizations of 2-valued Boolean logic to fuzzy logic, also from the Kleene’s and Lukasiewicz’ 3-symbol valued logics or Belnap’s 4-symbol valued logic to the most general n-symbol or numerical valued refined neutrosophic logic. Two classes of neutrosophic norm (n-norm) and neutrosophic conorm (n-conorm) are defined. Examples of applications of neutrosophic logic to physics are listed in the last section. Similar generalizations can be done for n-Valued Refined Neutrosophic Set, …
Subset Non Associative Topological Spaces, Florentin Smarandache, W.B. Vasantha Kandasamy
Subset Non Associative Topological Spaces, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
The concept of non associative topological space is new and innovative. In general topological spaces are defined as union and intersection of subsets of a set X. In this book authors for the first time define non associative topological spaces using subsets of groupoids or subsets of loops or subsets of groupoid rings or subsets of loop rings. This study leads to several interesting results in this direction.
Over hundred problems on non associative topological spaces using of subsets of loops or groupoids is suggested at the end of chapter two. Also conditions for these non associative subset topological spaces …