Related papers: The Internal Logic and Finite Colimits
In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…
Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…
We investigate a recent semantics for intermediate (and modal) logics in terms of polyhedra. The main result is a finite axiomatisation of the intermediate logic of the class of all polytopes -- i.e., compact convex polyhedra -- denoted PL.…
We give topological and algebraic characterizations as well as language theoretic descriptions of the following subclasses of first-order logic FO[<] for omega-languages: Sigma_2, FO^2, the intersection of FO^2 and Sigma_2, and Delta_2 (and…
This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…
Making a linguistic theory is like making a programming language: one typically devises a type system to delineate the acceptable utterances and a denotational semantics to explain observations on their behavior. Via this connection, the…
In this paper we study frame definability in finitely-valued modal logics and establish two main results via suitable translations: (1) in finitely-valued modal logics one cannot define more classes of frames than are already definable in…
Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…
Our aim is to give some insights about how to approach the formal description of situations where one has to conciliate several contradictory statements, rules, laws or ideas. We show that such a conciliation structure can be naturally…
We investigate the problem of characterizing the classes of Grothendieck toposes whose internal logic satisfies a given assertion in the theory of Heyting algebras, and introduce natural analogues of the double negation and De Morgan…
The downward and upward closures of a regular language $L$ are obtained by collecting all the subwords and superwords of its elements, respectively. The downward and upward interiors of $L$ are obtained dually by collecting words having all…
The concepts of exterior and boundary in multiset topological space are introduced. We further established few relationships between the concepts of boundary, closure, exterior and interior of an M- set. These concepts have been pigeonholed…
This paper enlarges classical syllogistic logic with assertions having to do with comparisons between the sizes of sets. So it concerns a logical system whose sentences are of the following forms: {\sf All $x$ are $y$} and {\sf Some $x$ are…
We define a natural topology on the collection of (equivalence classes up to scaling of) locally finite measures on a homogeneous space and prove that in this topology, pushforwards of certain infinite volume orbits equidistribute in the…
We continue the study of how one can define means of infinite sets. We introduce many new properties, investigate their relations to each other and how they can typify a mean. We collect the properties in property groups e.g. for…
We propose a novel topological perspective on data languages recognizable by orbit-finite nominal monoids. For this purpose, we introduce pro-orbit-finite nominal topological spaces. Assuming globally bounded support sizes, they coincide…
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…
This book introduces a temporal type theory, the first of its kind as far as we know. It is based on a standard core, and as such it can be formalized in a proof assistant such as Coq or Lean by adding a number of axioms. Well-known…
We construct a topos in which the Dedekind reals are countable. The topos arises from a new kind of realizability, which we call parameterized realizability, based on partial combinatory algebras whose application depends on a parameter.…