Related papers: State complexity of catenation combined with boole…

We investigate combinations of structures by families of structures relative to families of unary predicates and equivalence relations. Conditions preserving $\omega$-categoricity and Ehrenfeuchtness under these combinations are…

We generalize the construction of multitildes in the aim to provide multitilde operators for regular languages. We show that the underliying algebraic structure involves the action of some operads. An operad is an algebraic structure that…

Abductive reasoning is a popular non-monotonic paradigm that aims to explain observed symptoms and manifestations. It has many applications, such as diagnosis and planning in artificial intelligence and database updates. In propositional…

This paper is intended to provide an introduction to cut elimination which is accessible to a broad mathematical audience. Gentzen's cut elimination theorem is not as well known as it deserves to be, and it is tied to a lot of interesting…

We propose an analysis of corrections which models some of the requirements corrections place on context. We then show that this analysis naturally extends to the interaction of corrections with pronominal anaphora on the one hand, and…

We construct automata with input(s) in Fibonacci representation (also known as Zeckendorf representation) recognizing some basic arithmetic relations and study their number of states. We also consider some basic operations on…

Modifying an idea of E. Brietzke we give simple proofs for the recurrence relations of some sequences of binomial sums which have previously been obtained by other more complicated methods.

We try to control many cardinal characteristics by working with a notion of orthogonality between two families of forcings. We show that b^+<g is consistent

Quaternion analysis is considered in full details where a new analyticity condition in complete analogy to complex analysis is found. The extension to octonions is also worked out.

This is a survey of some recent applications of Boolean valued models of set theory to order bounded operators in vector lattices.

We present a method, illustrated by several examples, to find explicit counts of permutations containing a given multiset of three letter patterns. The method is recursive, depending on bijections to reduce to the case of a smaller…

After exhaustive inspection of bosonic coherent states appearing in physical literature two of us, Horzela and Szafraniec, came in 2012 to the reasonably general definition which relies exclusively on reproducing kernels. The basic feature…

We study (almost) limited operators in Banach lattices and their relations to L-weakly compact, semi-compact, and Dunford-Pettis operators. Several further related topics are investigated.

We revisit and generalize the concept of composite likelihood as a method to make a probabilistic inference by aggregation of multiple Bayesian agents, thereby defining a class of predictive models which we call composite Bayesian. This…

We investigate commutator operations on compatible uniformities of an algebra. We present a commutator operation for compatible uniformities of an algebra in a congruence-modular variety which extends the commutator on congruences, and…

We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic…

In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…

The behavior of bilinear operators acting on interpolation of Banach spaces for the $\rho$ method in relation to the compactness is analyzed. Similar results of Lions-Peetre, Hayakawa and Person's compactness theorems are obtained for the…

Motivated by an ongoing project on computer aided derivation of asymptotic models governed by partial differential equations, we introduce a class of term transformations that consists of traversal strategies and insertion of contexts. We…

We explore a definition of complexity based on logic functions, which are widely used as compact descriptions of rules in diverse fields of contemporary science. Detailed numerical analysis shows that (i) logic complexity is effective in…