English
Related papers

Related papers: Many-valued coalgebraic logic over semi-primal var…

200 papers

In this paper we produce noncommutative algebras derived equivalent to deformations of schemes with tilting bundles. We do this in two settings, first proving that a tilting bundle on a scheme lifts to a tilting bundle on an infinitesimal…

Algebraic Geometry · Mathematics 2015-05-18 Joseph Karmazyn

A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…

Logic · Mathematics 2026-01-06 Maciej Malicki

For endofunctors of varieties preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper…

Logic in Computer Science · Computer Science 2015-07-01 Jiří Adámek , Stefan Milius , Lawrence S Moss , Lurdes Sousa

A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…

General Mathematics · Mathematics 2011-12-23 Joseph W. Norman

Let A be a modular abelian variety over \Q of arbitrary even dimension. We establish criteria to prevent a given quaternion algebra over a totally real number field to be the endomorphism algebra of A over \bar\Q. We accomplish this by…

Number Theory · Mathematics 2008-04-30 Victor Rotger

Classical Decision Theory provides a normative framework for representing and reasoning about complex preferences. Straightforward application of this theory to automate decision making is difficult due to high elicitation cost. In response…

Artificial Intelligence · Computer Science 2013-01-30 Vu A. Ha , Peter Haddawy

We define varieties of algebras for an arbitrary endofunctor on a cocomplete category using pairs of natural transformations. This approach is proved to be equivalent to the one of equational classes defined by equation arrows. Free…

Category Theory · Mathematics 2009-04-13 Jan Pavlík

A formal context consists of objects, properties, and the incidence relation between them. Various notions of concepts defined with respect to formal contexts and their associated algebraic structures have been studied extensively,…

Logic · Mathematics 2025-01-14 Prosenjit Howlader , Churn-Jung Liau

We formulate a framework for describing behaviour of effectful higher-order recursive programs. Examples of effects are implemented using effect operations, and include: execution cost, nondeterminism, global store and interaction with a…

Logic in Computer Science · Computer Science 2021-12-30 Niccolò Veltri , Niels F. W. Voorneveld

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,…

Number Theory · Mathematics 2020-09-01 Suda Tomohiko

Involutive Stone algebras (or {\bf S}--algebras) were introduced by R. Cignoli and M. Sagastume in connection to the theory of $n$-valued \L ukasiewicz--Moisil algebras. In this work we focus on the logic that preserves degrees of truth…

Logic · Mathematics 2023-04-25 Liliana M. Cantú , Martín Figallo

Possibilistic logic offers a qualitative framework for representing pieces of information associated with levels of uncertainty of priority. The fusion of multiple sources information is discussed in this setting. Different classes of…

Artificial Intelligence · Computer Science 2013-01-18 Salem Benferhat , Didier Dubois , Souhila Kaci , Henri Prade

We define and study LNL polycategories, which abstract the judgmental structure of classical linear logic with exponentials. Many existing structures can be represented as LNL polycategories, including LNL adjunctions, linear exponential…

Category Theory · Mathematics 2024-02-14 Michael Shulman

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…

Logic in Computer Science · Computer Science 2020-07-10 Yuichi Nishiwaki , Toshiya Asai

We apply an idea originated in the theory of programming languages - monadic meta-language with a distinction between values and computations - in the design of a calculus of cut-elimination for classical logic. The cut-elimination calculus…

Logic in Computer Science · Computer Science 2014-09-12 José Espírito Santo , Ralph Matthes , Koji Nakazawa , Luís Pinto

We take a new look at dilation theory for nonself-adjoint operator algebras. Among the extremal (co)extensions of a representation, there is a special property of being fully extremal. This allows a refinement of some of the classical…

Operator Algebras · Mathematics 2011-09-02 Kenneth R. Davidson , Elias G. Katsoulis

This paper is a review of concepts from graded commutative algebra with specific attention given to length and multiplicity. The author's motivation for this paper comes from the study of equivariant cohomology in algebraic topology where…

Algebraic Topology · Mathematics 2020-07-16 Mark Blumstein

In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…

Logic in Computer Science · Computer Science 2021-10-20 Samson Abramsky , Dan Marsden

In sequential logic there is an order in which the atomic propositions in an expression are evaluated. This order allows the same atomic proposition to have different values depending on which atomic propositions have already been…

Logic in Computer Science · Computer Science 2011-01-18 Chris Regenboog

We investigate mathematical structures that provide natural semantics for families of (quantified) non-classical logics featuring special unary connectives, known as recovery operators, that allow us to 'recover' the properties of classical…

Logic in Computer Science · Computer Science 2023-07-25 David Fuenmayor