Related papers: The Pseudofinite Monadic Second Order Theory of Li…
Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…
A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…
According to a theorem of Courcelle monadic second-order logic and guarded second-order logic (where one can also quantify over sets of edges) have the same expressive power over the class of all countable $k$-sparse hypergraphs. In the…
There are many examples of dualities between topological spaces and algebras in the literature. Particularly, many of those examples come from the algebraic counterpart of a logical system, e.g, boolean and heyting algebras, MV-algebras,…
Reasoning with quantifier expressions in natural language combines logical and arithmetical features, transcending strict divides between qualitative and quantitative. Our topic is this cooperation of styles as it occurs in common…
This paper proves that a plactic monoid of any finite rank will have decidable first order theory. This resolves other open decidability problems about the finite rank plactic monoids, such as the Diophantine problem and identity checking.…
We give sufficient conditions for a first order expansion of the real line to define the standard model of the monadic second order theory of one successor. Such an expansion does not satisfy any of the combinatorial tameness properties…
We consider the domino problem on Schreier graphs of self-similar groups, and more generally their monadic second-order logic. On the one hand, we prove that if the group is bounded then the graph's monadic second-order logic is decidable.…
The notion of orbit finite data monoid was recently introduced by Bojanczyk as an algebraic object for defining recognizable languages of data words. Following Buchi's approach, we introduce a variant of monadic second-order logic with data…
We have generalised the notion of categorical theory in model theory to the context of coherent theories. We prove a duality result between the full sub-2-category of pretopoi which are categorical, and the 2-category of profinite monoids.…
Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…
This is an introduction to the theory of disconjugacy for a second order linear differential equation. We give new proofs of some of basic results and obtain new sufficient conditions for disconjugacy (in particular, on the whole real…
We establish a relation between fully extended $2$-dimensional TQFTs and recognisable weighted formal languages, rational biprefix codes and lattice TFTs. We show the equivalence of $2D$ closed TFTs and rational exchangeable series and we…
Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…
Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…
Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…
In this paper, methods of second order and higher order reverse mathematics are applied to versions of a theorem of Banach that extends the Schroeder-Bernstein theorem. Some additional results address statements in higher order arithmetic…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
This paper is devoted to systematic studies of some extensions of first-order G\"odel logic. The first extension is the first-order rational G\"odel logic which is an extension of first-order G\"odel logic, enriched by countably many…
A commutative monoid $M$ is called a linearly orderable monoid if there exists a total order on $M$ that is compatible with the monoid operation. The finitary power monoid of a commutative monoid $M$ is the monoid consisting of all nonempty…