Related papers: Some Closed Classes of Three-Valued Logic Generate…
In sequential logic there is an order in which the atomic propositions in an expression are evaluated. This order allows the same atomic proposition to have different values depending on which atomic propositions have already been…
On objects of a triangulated category with a stability condition, we construct a topology.
The Three Gap Theorem states that for any $\alpha \in \mathbb{R}$ and $N \in \mathbb{N}$, the fractional parts of $\{ 0\alpha, 1\alpha, \dots, (N - 1)\alpha \}$ partition the unit circle into gaps of at most three distinct lengths. We prove…
Admissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of…
Two classes of finite trigonometric sums, each involving only $\sin$'s, are evaluated in closed form. The previous and original proofs arise from Ramanujan's theta functions and modular equations.
We consider the rational linear relations between real numbers whose squared trigonometric functions have rational values, angles we call ``geodetic''. We construct a convenient basis for the vector space over Q generated by these angles.…
We show that over the class of linear orders with additional binary relations satisfying some monotonicity conditions, monadic first-order logic has the three-variable property. This generalizes (and gives a new proof of) several known…
This paper studies algebras arising as algebraic semantics for logics used to model reasoning with incomplete or inconsistent information. In particular we study, in a uniform way, varieties of bilattices equipped with additional…
Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…
A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…
We investigate the relation of countable closed subsets of the reals with respect to continuous monotone embeddability; we show that there are exactly aleph_1 many equivalence classes with respect to this embeddability relation. This is an…
We present closed forms for several functions that are fundamental in number theory and we explain the method used to obtain them. Concretely, we find formulas for the p-adic valuation, the number-of-divisors function, the sum-of-divisors…
We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.
We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to deterministically construct, in…
In this paper, we investigate the many-valued version of coalgebraic modal logic through predicate lifting approach. Coalgebras, understood as generic transition systems, can serve as semantic structures for various kinds of modal logics. A…
The logic of nulls in databases has been subject of investigation since their introduction in Codd's Relational Model, which is the foundation of the SQL standard. We show a logical characterisation of a first-order fragment of SQL with…
Multiple zeta values are real numbers defined by an infinite series generalizing values of the Riemann zeta function at positive integers. Finite truncations of this series are called multiple harmonic sums and are known to have interesting…
It is well-known that the basic modal logic of all topological spaces is $S4$. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal…
Recently, there has been an increasing interest in the bottom-up evaluation of the semantics of logic programs with complex terms. The presence of function symbols in the program may render the ground instantiation infinite, and finiteness…
We establish a one-to-one correspondence between conjugacy classes of any Hecke group and irreducible systems of poles of rational period functions for automorphic integrals on the same group. We use this correspondence to construct…