Related papers: A theory of finite structures
We present in this paper a first-order axiomatization of an extended theory $T$ of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation $\fini(t)$ which enables to distinguish between…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
Feature Structures (FSs) are a widespread tool used for decompositional frameworks of Attribute-Value associations. Even though they thrive in simple systems, they lack a way of representing higher-order entities and relations. This is…
We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…
In this paper we explore some properties of H-structures. We describe a construction of H-structures based on one-dimensional asymptotic classes which preserves pseudo-finiteness. That is, the H-structures we construct are ultraproducts of…
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…
This article is the first of an intended series of works on the model theory of Ultrafinitism. It is roughly divided into two parts. The first one addresses some of the issues related to ultrafinitistic programs, as well as some of the core…
We study the structure of the category of representations of $\mathbf{FA}$, the category of finite sets and all maps, mostly working over a field of characteristic zero. This category is not semi-simple and exhibits interesting features. We…
In this paper we present a new algebraic structure (a super hyperbolic system in our terminology) for finite quantum systems, which is a generalization of the usual one in the two-level system. It fits into the so-called generalized Pauli…
Formalisms based on temporal logics interpreted over finite strict linear orders, known in the literature as finite traces, have been used for temporal specification in automated planning, process modelling, (runtime) verification and…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
A structure theorem is proved for strongly holonomic modules over a quantum torus (a crossed product of a field with a free abelian group in which the field is central). This can be applied to give a structure theorem for finitely presented…
These notes aim to give a gentle account to one approach to the theory of finite sets without making use of the natural numbers. They were written to be used as the basis for a student seminar. There are no real prerequisites except for a…
This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…
We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…
Functionals are an important research subject in Mathematics and Computer Science as well as a challenge in Information Technologies where the current programming paradigm states that only symbolic computations are possible on higher order…
This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the following topics: computable ordinals, satisfaction of computable infinitary formulas, forcing as a construction…
Finite Unified Theories (FUTs) are N=1 supersymmetric Grand Unified Theories that can be made all-loop finite, leading to a severe reduction of the free parameters. We review the investigation of FUTs based on SU(5) in the context 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…