Related papers: Fracterm Calculus for Partial Meadows
Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…
In this paper, we review the set of rules specific to the calculation of the imaginary part of a Green's function at finite temperature in the real-time formalisms. Emphasis is put on the clarification of a recent controversy concerning…
The theory of fractional calculus in the complex plane was not built with a specific application in mind. The main obstacle to application was the difficulty with obtaining analytic continuations of fractional derivatives and integrals. It…
In this paper, we revisit Moggi's celebrated calculus of computational effects from the perspective of logic of monoidal action (actegory). Our development takes the following steps. Firstly, we perform proof-theoretic reconstruction of…
The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable formulas. Surprisingly, this logic is constructive and so…
We introduce two classes of algebras coming from partial triangulations of marked surfaces. The first one, called frozen algebra of a partial triangulation, is generally of infinite rank and contains frozen Jacobian algebras of…
We develop a stochastic calculus that makes it easy to capture a variety of predictable transformations of semimartingales such as changes of variables, stochastic integrals, and their compositions. The framework offers a unified treatment…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
In this paper we define future-time branching temporal logics evaluated over forests, that is, ordered tuples of ordered, but unranked, finite trees. We associate a rich class FL[$\mathcal{L}$] of temporal logics to each set L of (regular)…
Program slicing has been mainly studied in the context of imperative languages, where it has been applied to a wide variety of software engineering tasks, like program understanding, maintenance, debugging, testing, code reuse, etc. This…
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…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
Left-sequential logics provide a means for reasoning about (closed) propositional terms with atomic propositions that may have side effects and that are evaluated sequentially from left to right. Such propositional terms are commonly used…
Semantics of logic programs has been given by proof theory, model theory and by fixpoint of the immediate-consequence operator. If clausal logic is a programming language, then it should also have a compositional semantics. Compositional…
Algorithmic fractal dimensions -- constructs of computability theory -- have recently been used to answer open questions in classical geometric measure theory, questions of mathematical analysis whose statements do not involve computability…
These are the lecture notes for a course at the Summer School on "Applied Analysis" at the Technical University Chemnitz in September 2011. We start with the definition of a fractal algebra and show that the fractal property is enormously…
It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type…
We analyse abstract data types that model numerical structures with a concept of error. Specifically, we focus on arithmetic data types that contain an error value $\bot$ whose main purpose is to always return a value for division. To rings…
Fractional calculus represents a natural tool for describing relativistic phenomena in pseudo-Euclidean space-time. In this study, Fractional modified special relativity is presented. We obtain fractional generalized relation for the time…
We investigate the possibilities to calculate vector partition functions by means of iterated partial fraction decomposition, as suggested by Beck (2004). Particularly, for an important type of families of rational functions, we describe an…