Related papers: Some Closed Classes of Three-Valued Logic Generate…

Polynomial closure is a standard operator which is applied to a class of regular languages. In the paper, we investigate three restrictions called left (LPol), right (RPol) and mixed polynomial closure (MPol). The first two were known while…

Logic rules and inference are fundamental in computer science and have been studied extensively. However, prior semantics of logic languages can have subtle implications and can disagree significantly, on even very simple programs,…

This paper studies which truth-values are most likely to be taken on finite models by arbitrary sentences of a many-valued predicate logic. We obtain generalizations of Fagin's classical zero-one law for any logic with values in a finite…

We show that a proof in multiplicative linear logic can be represented as a decorated surface, such that two proofs are logically equivalent just when their surfaces are geometrically equivalent. This is an extended abstract for…

We study modular forms of some congruence subgroups. In this paper, we treat the cases level is 2-power, 3-power or 5. Structures of graded rings and many identities of infinite sum or infinite product are given. Theory of rational (1/3,…

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

A numerical equivalence class of k-cycles is said to be big if it lies in the interior of the closed cone generated by effective classes. We construct analogues for arbitrary cycle classes of the volume function for divisors which…

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…

An important class of contact 3--manifolds are those that arise as links of rational surface singularities with reduced fundamental cycle. We explicitly describe symplectic caps (concave fillings) of such contact 3--manifolds. As an…

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 notions of metrized categories, and then approximate categorical structures defined by a function of three variables generalizing the notion of $2$-metric space. We prove an embedding theorem giving sufficient conditions for an…

We prove certain polynomial relations between the values of complex irreducible characters of general finite symmetric groups. We use it to find some sets of conjugacy classes such that no finite symmetric group has a complex irreducible…

Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Injectives in several classes of structures associated with logic are characterized. Among the classes considered are residuated lattices, MTL-algebras, IMTL-algebras, BL-algebras, NM-algebras and bounded hoops.

A method of constructing an entire function with given zeros and estimates of growth is suggested. It gives a possibility to describe zero sets of certain classes of entire functions of one and several variables in terms of growth of volume…

Nominal logic is an extension of first-order logic which provides a simple foundation for formalizing and reasoning about abstract syntax modulo consistent renaming of bound names (that is, alpha-equivalence). This article investigates…

We define a class of groups based on parallel computations by pushdown automata. This class generalizes automatic groups. It includes the fundamental groups of all 3-manifolds which obey Thurston' s geometrization conjecture. It also…

Most non-classical logics are subclassical, that is, every inference/theorem they validate is also valid classically. A notable exception is the three-valued propositional Logic of Ordinary Discourse (OL) proposed and extensively motivated…

In this paper, we investigate bounded action theories in the situation calculus. A bounded action theory is one which entails that, in every situation, the number of object tuples in the extension of fluents is bounded by a given constant,…