Related papers: A Cook's Tour of the Finitary Non-Well-Founded Set…
We are interested in proving input-output properties of functions that handle infinite data such as streams or non-wellfounded trees. We provide a finitary refinement type system which is (sound and) complete for Scott-open properties…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…
We prove that the space of dominant/non-constant holomorphic mappings from a product of hyperbolic Riemann surfaces of finite type into certain hyperbolic manifolds with universal cover a bounded domain is a finite set.
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…
For every finite closure space $X$ one can define a finite topological space $\operatorname{Top} X$ together with a natural projection $\operatorname{Top} X\longrightarrow X$. This could allow to apply the techniques of topological…
This monograph is an ongoing revision of "Lectures On A Mathematical Theory of Computation" by Dana Scott. Scott's monograph uses a formulation of domains called neighborhood systems in which finite elements are selected subsets of a master…
Is the universe finite or infinite, and what shape does it have? These fundamental questions, of which relatively little is known, are typically studied within the context of the standard model of cosmology where the universe is assumed to…
We develop a sequential-topological study of rational points of schemes of finite type over local rings typical in higher dimensional number theory and algebraic geometry. These rings are certain types of multidimensional complete fields…
Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory of regular languages and finite automata, including the Myhill-Nerode…
An algebraic scheme is suggested in which discretized spacetime turns out to be a quantum observable. As an example, a toy model producing spacetimes of four points with different topologies is presented. The possibility of incorporating…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
We describe a theory of finite sets, and investigate the analogue of Dedekind's theory of natural number systems (simply infinite systems) in this theory. Unlike the infinitary case, in our theory, natural number systems come in differing…
Let $V$ be a real or complex vector space. The finite topology of $V$ consists of all the subsets $U$ for which the intersection $U \cap F$ is closed in $F$ for every finite-dimensional linear subspace of $V$. It is known that if $V$ has…
In set theory without the axiom of regularity, we consider a game in which two players choose in turn an element of a given set, an element of this element, etc.; a player wins if its adversary cannot make any next move. Sets that are…
Finite elements, which are well-known and studied in the framework of vector lattices, are investigated in $\ell$-algebras, preferably in $f$-algebras, and in product algebras. The additional structure of an associative multiplication leads…
We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
In this paper, a generalized version of the von Neumann universe known as the total universe is proposed to formally introduce non-well-founded sets that include infinitons, semi-infinitons and quasi-infinitons in Russell's paradox. All…