Related papers: A Cook's Tour of the Finitary Non-Well-Founded Set…
We provide both a general framework for discretizing de Rham sequences of differential forms of high regularity, and some examples of finite element spaces that fit in the framework. The general framework is an extension of the previously…
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute a finite representation of the set of successors of the…
A systematic theory of structural limits for finite models has been developed by Nesetril and Ossona de Mendez. It is based on the insight that the collection of finite structures can be embedded, via a map they call the Stone pairing, in a…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
A ringed finite space is a ringed space whose underlying topological space is finite. The category of ringed finite spaces contains, fully faithfully, the category of finite topological spaces and the category of affine schemes. Any ringed…
NF set theory using intuitionistic logic is called iNF. We develop the theories of finite sets and their power sets and mappings, finite cardinals and their ordering, cardinal exponentiation, addition, and multiplication. We follow Rosser…
Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…
We strengthen the case that the new logical perspective afforded by topos theory is suitable to the task of describing the physical world around us. In exploring some of the aspects of construction of a simple quantum-mechanical system in a…
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…
A systematic theory of structural limits for finite models has been developed by Nesetril and Ossona de Mendez. It is based on the insight that the collection of finite structures can be embedded, via a map they call the Stone pairing, in a…
We consider the equivalence of Lawvere theories and finitary monads on Set from the perspective of Endf(Set)-enriched category theory, where Endf(Set) is the category of finitary endofunctors of Set. We identify finitary monads with…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
In this article, a new and natural topology on the prime spectrum is established which behaves completely as the dual of the Zariski topology. It is called the flat topology. The basic and also some sophisticated properties of the flat…
In domain theory every finite computable object can be represented by a single mathematical object instead of a set of objects, using the notion of finitary-basis. In this article we report on our effort to formalize domain theory in Coq in…
The cumulative hierarchy conception of set, which is based on the conception that sets are inductively generated from "former" sets, is generally considered a good way to create a set conception that seems safe from contradictions. This…
The theory of finitely supported algebraic structures represents a reformulation of Zermelo-Fraenkel set theory in which every construction is finitely supported according to the action of a group of permutations of some basic elements…
Previous work on applications of Abstract Differential Geometry (ADG) to discrete Lorentzian quantum gravity is brought to its categorical climax by organizing the curved finitary spacetime sheaves of quantum causal sets involved therein,…
In this paper, a question due to Heckenberger, Shareshian and Welker on racks in [7] is positively answered. A rack is a set together with a selfdistributive bijective binary operation. We show that the lattice of subracks of every finite…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…