Related papers: Characteristic Formulas 50 Years Later (An Algebra…
In the first part of this paper we analyzed finite non-deterministic matrix semantics for propositional non-normal modal logics as an alternative to the standard Kripke's possible world semantics. This kind of modal systems characterized by…
Type III methods, introduced by SAS in 1976, formulate estimable functions that substitute, somehow, for classical ANOVA effects in multiple linear regression models. They have been controversial since, provoking wide use and satisfied…
In a 1983 paper the author has established a (decategorified) Satake equivalence for affine Hecke algebras. In this paper we give new proofs for some results of that paper, one based on the theory of J-rings and one based on the known…
We initiate the study of finite characterizations and exact learnability of modal languages. A finite characterization of a modal formula w.r.t. a set of formulas is a finite set of finite models (labelled either positive or negative) which…
In this short note we relate some known properties of propositional calculus to purely algebraic considerations of a Boolean algebra. Classes of formulas of propositional calculus are considered as elements of a Boolean algebra. As such…
The theory of newforms, due to Atkin and Lehner, provides a powerful method for decomposing spaces of modular forms. However, many problems occur when trying to generalise this theory to characteristic $p$. Recently, Deo and Medvedovsky…
The notion of class is ubiquitous in computer science and is central in many formalisms for the representation of structured knowledge used both in knowledge representation and in databases. In this paper we study the basic issues…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
Algebraic characterizations of the computational aspects of functions defined over the real numbers provide very effective tool to understand what computability and complexity over the reals, and generally over continuous spaces, mean. This…
Diagrammatic logics were introduced in 2002, with emphasis on the notions of specifications and models. In this paper we improve the description of the inference process, which is seen as a Yoneda functor on a bicategory of fractions. A…
The main theorem (2.2) consists in two characterizations of isomorphisms of factorial domains in terms of prime or primary rings elements, and unramified, flat or weakly injective affine schemes morphisms. In order to apply this theorem to…
In a recent paper a class of infinite Jacobi matrices with discrete character of spectra has been introduced. With each Jacobi matrix from this class an analytic function is associated, called the characteristic function, whose zero set…
The thesis of this paper is that truth-relevant logic is a better foundation for mathematics than classical logic. It is a system proposed by Richard Diaz in 1981. In a certain sense t-relevant logic is based on Kleene strong tables. These…
Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…
This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of `maximal formula', `segment' and `maximal segment' suitable to the system, and gives…
In 1837, Dirichlet proved that there are infinitely many primes in any arithmetic progression in which the terms do not all share a common factor. We survey implicit and explicit uses of Dirichlet characters in presentations of Dirichlet's…
Henkin, Monk and Tarski gave a compositional semantics for first-order predicate logic. We extend this work by including function symbols in the language and by giving the denotation of the atomic formula as a composition of the denotations…
The Jacobi-Trudi formula implies some interesting quadratic identities for characters of representations of $gl_n$. Earlier work of Kirillov and Reshetikhin proposed a generalization of these identities to the other classical Lie algebras,…
In 1936, Stanislaw Ja\'skowski gave a construction of an interesting sequence of what he called "matrices", which we would today call "finite Heyting Algebras". He then gave a very brief sketch of a proof that if a propositional formula…
We investigate the extent to which Linear Temporal Logic (LTL) formulas can be uniquely characterized by a finite set of labeled examples. We consider different types of examples, ranging from finite words to transfinite words, as well as…