Related papers: Godel Implication on Finite Chains: Truth Tables a…
Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…
In this work, we consider a class of substitutions on infinite alphabets and show that they exhibit a growth behaviour which is impossible for substitutions on finite alphabets. While for both settings the leading term of the tile counting…
A Catalan word $w$ is said to be flattened if the subsequence of $w$ obtained by taking the first letter of each weakly increasing run is nondecreasing. Let $\mathcal{F}_n$ denote the set of flattened Catalan words of length $n$, which has…
We analyze the combinatorics behind the operation of taking the logarithm of the generating function $G_k$ for $k^\text{th}$ generalized Catalan numbers. We provide combinatorial interpretations in terms of lattice paths and in terms of…
In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified…
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 new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…
We construct a finitary additive 2-category whose Grothendieck ring is isomorphic to the semigroup algebra of the monoid of order-decreasing and order-preserving transformations of a finite chain.
In this paper, we provide a complete classification for the first-order Goedel logics concerning the property that the formulas admit logically equivalent prenex normal forms. We show that the only first-order Goedel logics that admit such…
Extended affine Weyl groups are the Weyl groups of extended affine root systems. Finite presentations for extended affine Weyl groups are known only for nullities $\leq 2$, where for nullity 2 there is only one known such presentation. We…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
An order theoretic and algebraic framework for the extended real numbers is established which includes extensions of the usual difference to expressions involving $-\infty$ and/or $+\infty$, so-called residuations. Based on this,…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions…
In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications, in a similar spirit than a set of proof trees. The main…
Large language models solve complex tasks by generating long reasoning chains, achieving higher accuracy at the cost of increased computational cost and reduced ability to isolate functionally relevant reasoning. Prior work on compact…
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…
Let \(A=(A,\star)\) be a finite binary algebra, not necessarily associative. For each \(n\geq 1\), every full binary bracketing on \(x_1,\dots,x_n\) determines an \(n\)-ary term operation on \(A\), and hence an evaluation word obtained by…
Let $G$ be a finitely generated group. Given two length functions $\ell$ and $m$ of irreducible $G$ actions on real trees $A$ and $B$, when is the point-wise sum $\ell + m$ again the length function of an irreducible $G$ action on a real…