Related papers: Comparing material and structural set theories
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
Deep learning, despite its remarkable achievements, is still a young field. Like the early stages of many scientific disciplines, it is marked by the discovery of new phenomena, ad-hoc design decisions, and the lack of a uniform and…
Alternative set theory (AST) may be suitable for the ones who try to capture objects or phenomenons with some kind of indefiniteness of a border. While AST provides various notions for advanced mathematical studies, correspondence of them…
Induction is the process by which we obtain predictive laws or theories or models of the world. We consider the structural aspect of induction. We answer the question as to whether we can find a finite and minmalistic set of operations on…
Native type systems are those in which type constructors are derived from term constructors, as well as the constructors of predicate logic and intuitionistic type theory. We present a method to construct native type systems for a broad…
We study and describe possibilities for arities of elementary theories and of their expansions. Links for arities with respect to Boolean algebras, to disjoint unions and to compositions of structures are shown. The dynamics for arities of…
Tableaux originate as a decision method for a logical language. They can also be extended to obtain a structure that spells out all the information in a set of sentences in terms of truth value assignments to atomic formulas that appear in…
Those articles (versions) explore a non conventional pregeometrical model encompassing quantics and geometrodynamics (a stochastic graph relational theory). Some key points are : 1) the use of simple boolean atom-like far subquantum…
Restriction categories were established to handle maps that are partially defined with respect to composition. Tensor topology realises that monoidal categories have an intrinsic notion of space, and deals with objects and maps that are…
This short expository text is for readers who are confident in basic category theory but know little or nothing about toposes. It is based on some impromptu talks given to a small group of category theorists.
In this paper we provide a detailed construction of an equivalence between the category of Lawvere theories and the category of relative monads on the obvious functor $Jf:F\rightarrow Sets$ where $F$ is the category with the set of objects…
We provides some new equivalent forms of collection principle over some very weak set theories after reviewing the existing ones.
We introduce the theory of generalised ultracategories, these are relational extensions to ultracategories as defined by Lurie. An essential example of generalised ultracategories are topological spaces, and these play a fundamental role in…
Standard methods of using categorical variables as predictors either endow them with an ordinal structure or assume they have no structure at all. However, categorical variables often possess structure that is more complicated than a linear…
In a category $\mathcal{C}$ with a proper $(\mathcal{E}, \mathcal{M})$-factorization system, we study the notions of strict, co-strict, initial and final morphisms with respect to a topogenous order. Besides showing that they allow…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
In this paper, we continue the study of linear sets with complementary weights. We find criteria to determine the set of points of any fixed weight and use this to present particular linear sets with few points of weight more than one. We…
We present here an abstract notion of structure consisting of propositions and realizers (which we call PR-structures) giving rise to set based contravariant functors taking values in the category of sets endowed with binary relations. We…
Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…
In this note we characterize, within the framework of the theory of finite set, those categories of graphs that are {\em algebraic universal} in the sense that every concrete category embeds in them. The proof of the characterization is…