Related papers: The Internal Logic and Finite Colimits
This paper describes a method for converting formulas in finite propositional linear-time temporal logic (Finite LTL) into finite-state automata whose languages are the models of the given formula. Finite LTL differs from traditional LTL in…
We expand the notion of characteristic formula to infinite finitely presentable subdirectly irreducible algebras. We prove that there is a continuum of varieties of Heyting algebras containing infinite finitely presentable subdirectly…
In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's…
In this article we consider alternative definitions-descriptions of a set being Infinite within the primitive Axiomatic System of Zermelo.
We start by presenting a theory of finite sets using the approach which is essentially that taken by Whitehead and Russell in Principia Mathematica}, and which does not involve the natural numbers (or any other infinite set). This theory is…
We open a new field on how one can define means on infinite sets. We investigate many different ways on how such means can be constructed. One method is based on sequences of ideals, other deals with accumulation points, one uses isolated…
In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…
We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…
We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…
We extend the usual internal logic of a (pre)topos to a more general interpretation, called the stack semantics, which allows for "unbounded" quantifiers ranging over the class of objects of the topos. Using well-founded relations inside…
We present some constructions of limits and colimits in pro-categories. These are critical tools in several applications. In particular, certain technical arguments concerning strict pro-maps are essential for a theorem about \'etale…
Inspired by nonstandard analysis, we define and study internal subsets and internal functions in algebras of Colombeau generalized functions. We prove a saturation principle for internal sets and provide applications to Colombeau algebras.
We consider the notion of multiple gap as a finite set of ideals that cannot be separated. We study the different types of such objects that can be found in the Boolean algebra of subsets of the natural numbers modulo finite sets.
A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter…
We define a new class of infinitary logics $\mathscr L^1_{\kappa,\alpha}$ generalizing Shelah's logic $\mathbb L^1_\kappa$ defined in \cite{MR2869022}. If $\kappa=\beth_\kappa$ and $\alpha <\kappa$ is infinite then our logic coincides with…
We investigate the number of sets of words that can be formed from a finite alphabet, counted by the total length of the words in the set. An explicit expression for the counting sequence is derived from the generating function, and…
We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…
For a coherent site we construct a canonically associated enlarged coherent site, such that cohomology of bounded below complexes is preserved by the enlargement. In the topos associated to the enlarged site transfinite compositions of…
Belnap-Dunn logic, also knows as the logic of First-Degree Entailment, is a logic that can serve as the underlying logic of theories that are inconsistent or incomplete. For various reasons, different expansions of Belnap-Dunn logic with…
One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for…