Related papers: An Abstract Approach to Consequence Relations
In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications, in a similar spirit than a set of proof trees. The main…
The intention of the present study is to establish the mathematical fundamentals for automated problem solving essentially targeted for robotics by approaching the task universal algebraically introducing knowledge as realizations of…
In this paper, we introduce the concept of a (lattice) skew Hilbert algebra as a natural generalization of Hilbert algebras. This notion allows a unified treatment of several structures of prominent importance for mathematical logic, e.g.…
Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…
In a previous publication, we introduced an abstract logic via an abstract notion of quantifier. Drawing upon concepts from categorical logic, this abstract logic interprets formulas from context as subobjects in a specific category, e.g.,…
The relational version of the modal interpretation offers both a consistent quantum ontology and solution for quantum paradoxes within the framework of nonrelativistic quantum mechanics. In the present paper this approach is generalized for…
Algebraic effects offer a versatile framework that covers a wide variety of effects. However, the family of operations that delimit scopes are not algebraic and are usually modelled as handlers, thus preventing them from being used freely…
We describe in this note a torsor structure arising on the affine scheme defined by a system of rationnal algebraic relations between polyzetas at roots of unity (values of hyperlogarithmic functions on a fixed finite group of complex roots…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
Discourse relations bind smaller linguistic units into coherent texts. However, automatically identifying discourse relations is difficult, because it requires understanding the semantics of the linked arguments. A more subtle challenge is…
After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…
In these lectures we provide a basic introduction into the topic of dispersion relation and analyticity. The properties of 2-point functions are discussed in some detail from the viewpoint of the K\"all\'en-Lehmann and general dispersion…
Abstract visual reasoning is a characteristically human ability, allowing the identification of relational patterns that are abstracted away from object features, and the systematic generalization of those patterns to unseen problems.…
In this paper we re-examine the traditional problem of connecting the internal fluctuations of a system to its response to external forcings and extend the classical theory in order to be able to encompass also nonlinear processes. With…
We give a systematic treatment to the concept of hypoellipticity, putting it into an abstract form which allows us to deal with several different notions within the same framework. We then investigate when a notion of hypoellipticity…
Let A be an associative algebra over a field, and let M be a finite family of right A-modules. Study of the noncommutative deformation functor of the family M leads to the construction of the algebra of observables and the Generalized…
We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…
In this paper, general logic-systems and a necessary and sufficient algorithm are used to substantiate significant consequence operator properties. It is shown, among other results, that, in certain cases, (1) if the number of steps in a…
We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…
Confluence in abstract parallel category systems is established for net class-rewriting in iterative closed multilevel quotient graph structures with uncountable node arities by multi-dimensional transducer operations in topological metrics…