Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Coalgebra (2)
- Modal logic (2)
- Algebraic theories (1)
- Big data (1)
- Categorical Semantics (1)
-
- Category Theory (1)
- Coalgebras (1)
- Completeness (1)
- Computational and artificial intelligence (1)
- Computer science (1)
- Conflict in Wikipedia (1)
- Contradictory problems (1)
- Cover modality (1)
- Extension engineering (1)
- Extentics (1)
- Graph clustering (1)
- Graph theory (1)
- Hadoop (1)
- Map reduce (1)
- Maximum cut (1)
- Modal Logic (1)
- Presentation of functors (1)
- Presentations by generators and relations (1)
- Relation lifting (1)
- Sifted colimits (1)
- Stochastic Logic (1)
- Stone duality (1)
- Wikipedia (1)
Articles 1 - 5 of 5
Full-Text Articles in Other Mathematics
Characterizing Conflict In Wikipedia, Nathaniel Miller
Characterizing Conflict In Wikipedia, Nathaniel Miller
Mathematics, Statistics, and Computer Science Honors Projects
Wikipedia serves as the Internet's most widely viewed reference. In order to ensure its success, editors who create and maintain articles must resolve conflicts over appropriate article content. Previous research has measured Wikipedia conflict at two levels: single articles and categories of pages. I observe conflicts within small groups of articles, identifying their frequency, size, and intensity. Additionally, I identify individual conflicts spanning multiple articles and effects of conflict upon users' editing habits. I analyze cross-article conflict in three stages. First, I cluster a group of 1.4 million Wikipedia articles. Next, I find individual user conflicts within each article cluster …
Applications Of Extenics To 2d-Space And 3d-Space, Florentin Smarandache, Victor Vladareanu
Applications Of Extenics To 2d-Space And 3d-Space, Florentin Smarandache, Victor Vladareanu
Branch Mathematics and Statistics Faculty and Staff Publications
In this article one proposes several numerical examples for applying the extension set to 2D- and 3D-spaces. While rectangular and prism geometrical figures can easily be decomposed from 2D and 3D into 1D linear problems, similarly for the circle and the sphere, it is not possible in general to do the same for other geometrical figures.
Strongly Complete Logics For Coalgebras, Alexander Kurz, Jiří Rosický
Strongly Complete Logics For Coalgebras, Alexander Kurz, Jiří Rosický
Engineering Faculty Articles and Research
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary set-functor is given and proven to be strongly complete under additional assumptions. We proceed in three parts.
Part I argues that sifted colimit preserving functors are those functors that preserve universal algebraic structure. Our main theorem here states that a functor preserves sifted colimits if and only if it has a finitary presentation by operations and equations. Moreover, the presentation of the …
Coalgebraic Logics (Dagstuhl Seminar 12411), Ernst-Erich Doberkat, Alexander Kurz
Coalgebraic Logics (Dagstuhl Seminar 12411), Ernst-Erich Doberkat, Alexander Kurz
Engineering Faculty Articles and Research
This report documents the program and the outcomes of Dagstuhl Seminar 12411 “Coalgebraic Logics”. The seminar deals with recent developments in the area of coalgebraic logic, a branch of logics which combines modal logics with coalgebraic semantics. Modal logic finds its uses when reasoning about behavioural and temporal properties of computation and communication, coalgebras have evolved into a general theory of systems. Consequently, it is natural to combine both areas for a mathematical description of system specification. Coalgebraic logics are closely related to the broader categories semantics/formal methods and verification/logic.
Completeness For The Coalgebraic Cover Modality, Clemens Kupke, Alexander Kurz, Yde Venema
Completeness For The Coalgebraic Cover Modality, Clemens Kupke, Alexander Kurz, Yde Venema
Engineering Faculty Articles and Research
We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical propositional logic with a so-called coalgebraic cover modality depending on the type functor. Its semantics is defined in terms of a categorically defined relation lifting operation.
As the main contributions of our paper we introduce a derivation system, and prove that it provides a sound and complete axiomatization for the collection of coalgebraically valid inequalities. Our soundness and completeness proof is algebraic, …