Related papers: Closed nominal rewriting and efficiently computabl…
Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages,…
Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
The calculus of classes and closure operations has proved to be a useful tool in group theory and has led to a deep theory in the study of finite soluble groups. More recently, parallel theories have started to be developed in various…
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in non-deterministic polynomial time. We also explore specializations like nominal letrec-matching for…
Combining a standard proof search method, such as resolution or tableaux, and rewriting is a powerful way to cut off search space in automated theorem proving, but proving the completeness of such combined methods may be challenging. It may…
Deduction systems and graph rewriting systems are compared within a common categorical framework. This leads to an improved deduction method in diagrammatic logics.
In commutative algebra, the theory of Gr\"obner bases enables one to compute in any finitely generated algebra over a given computable field. For non-finitely generated algebras however, other methods have to be pursued. For instance, it…
We study rational Cherednik algebras over an algebraically closed field of positive characteristic. We first prove several general results about category O, and then focus on rational Cherednik algebras associated to the general and special…
We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…
A non-deterministic call-by-need lambda-calculus \calc with case, constructors, letrec and a (non-deterministic) erratic choice, based on rewriting rules is investigated. A standard reduction is defined as a variant of left-most outermost…
Following our previous work, we suggest here a large class of algebras of scalars in which simultaneous and correlated computations can be performed owing to the existence of surjective algebra homomorphisms. This may replace the currently…
In this short paper, we consider a form of higher-order rewriting with a call-by-value evaluation strategy so as to model call-by-value programs. We briefly present a cost-size semantics to call-by-value rewriting: a class of algebraic…
In this paper, a new calculus on sequences is defined. Also, the $\lambda$-derivative and the $\lambda$-integration are investigated. The fundamental theorem of $\lambda$-calculus is included. A suitable function basis for the…
Recently Jenei introduced a new structure called equality algebras which is inspired by ideas of BCK-algebras with meet. These algebras were generalized by Jenei and K\'or\'odi to pseudo equality algebras which are aimed to find a…
We present some lambda calculus with explicit substitutions and named variables. The characteristic feature of this calculus is as follows: renaming of bound variables when performing substitutions is done using special reductions and may…
We establish a novel connection between two research areas in non-classical logics which have been developed independently of each other so far: on the one hand, input/output logic, introduced within a research program developing logical…
This paper presents a novel SHOI tableau calculus which incorporates algebraic reasoning for deciding ontology consistency. Numerical restrictions imposed by nominals, existential and universal restrictions are encoded into a set of linear…
Several general properties, concerning reduction algebras - rings of definition and algorithmic efficiency of the set of ordering relations - are discussed. For the reduction algebras, related to the diagonal embedding of the Lie algebra…