Related papers: Some Closed Classes of Three-Valued Logic Generate…
We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
We determine exactly which positive rational numbers occur as squared edge lengths of regular $d$-simplices with vertices in $\mathbb{Q}^n$. The answer exhibits a sharp stabilization phenomenon: once $n-d\geq 3$, every positive rational…
We give a construction of triangulated categories as quotients of exact categories where the subclass of objects sent to zero is defined by a triple of functors. This includes the cases of homotopy and stable module categories. These…
Complexity classes such as $\#\mathbf{P}$, $\oplus\mathbf{P}$, $\mathbf{GapP}$, $\mathbf{OptP}$, $\mathbf{NPMV}$, or the class of fuzzy languages realised by polynomial-time fuzzy nondeterministic Turing machines, can all be described in…
Colored multiple zeta values are special values of multiple polylogarithms evaluated at Nth roots of unity. In this paper, we define both the finite and the symmetrized versions of these values and show that they both satisfy the double…
The Three Gap Theorem, also known as the Steinhaus Conjecture, is a classical result on the combinatorics of the fractional part function, and has since been generalized in many ways. In this paper, we pose a new problem related to these…
In this work we present additional results related to the property of strong equivalence of logic programs. This property asserts that two programs share the same set of stable models, even under the addition of new rules. As shown in a…
Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…
Several mathematicians, including myself, have studied some unifications in general topological spaces as well as in fuzzy topological spaces. For instance in our earlier works, using operations on topological spaces, we have tried to unify…
Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…
We obtain, by using the Leggett-Williams fixed point theorem, sufficient conditions that ensure the existence of at least three positive solutions to some $p$-Laplacian boundary value problems on time scales.
A correspondence between arbitrary Fourier series and certain analytic functions on the unit disk of the complex plane is established. The expression of the Fourier coefficients is derived from the structure of complex analysis. The…
Closed quantum surfaces of any genus are defined as subalgebras of the Toeplitz algebra by mimicking the classical construction of identifying arcs on the boundary of the (quantum) unit disk. Isomorphism classes obtained from different…
In this paper (propositional) probability logic ($PL$) is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for $\sigma$-additive probability models, and subsequently when this class of…
This paper treats logic programming with three kinds of negation: default, weak and strict negations. A 3-valued logic model theory is discussed for logic programs with three kinds of negation. The procedure is constructed for negations so…
We study rational functions over finite fields under PGL-equivalence. We say that $f, g \in \Bbb F_q(X)$ are \emph{equivalent} if there exist $\psi, \phi \in \Bbb F_q(X)$ of degree one such that $g = \psi \circ f \circ \phi$. Most…
Let $k$ denote an algebraically closed field. We revisit a construction of the author of families of elliptic curves over the rational function field $k(t)$. Combining a combinatorial analysis with a rank formula of Ulmer we prove that, for…
We consider an example of four valued semantics partially inspired by quantum computations and negation-like operations occurred therein. In particular we consider a representation of so called square root of negation within this four…
Nominal logic is a variant of first-order logic that provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any…