Results 231 to 240 of about 1,322 (256)

Monads with arities and their associated theories

Journal of Pure and Applied Algebra, 2012
New introduction; Section 1 shortened and redispatched with Section 2; Subsections on symmetric operads (3.14) and symmetric simplicial sets (4.17) added; Bibliography ...
Mark Weber, Paul-André Melliès, Clemens Berger   +2 more
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Identity and Arity

Abstract Starting from concerns expressed by Hume, Russell, and Wittgenstein, and an analysis of the notion of relational arity, we develop an argument to the effect that any relation between objects that relates every object to itself and no object to any other must be a unary relation, i.e. a property.
Ulrich Pardey, Kai F Wehmeier
openaire   +1 more source

Arity-Monotonic Extended Aggregation Operators

2010
A class of extended aggregation operators, called impact functions, is proposed and their basic properties are examined. Some important classes of functions like generalized ordered weighted averaging (OWA) and ordered weighted maximum (OWMax) operators are considered.
Marek Gagolewski, Przemyslaw Grzegorzewski   +1 more
openaire   +2 more sources

Computational aspects of arity hierarchies

1997
The logics LFP (least fixed point logic), SO (second order logic), and PFP (partial fixed point logic), are known to capture the complexity classes PTIME, PH, and PSPACE respectively. We investigate hierarchies within these logics which emerge from imposing boundaries on the arities of second order variables.
openaire   +3 more sources

The Robinson property and amalgamations of higher arities

Mathematical Logic Quarterly, 2016
In this article we discuss a version of the Robinson property studied recently by Gyenis in , and we present a solution to one of his open problems. We say that a first‐order structure satisfies the Robinson property whenever the union of two non‐trivial partial n‐types over different finite sets is realizable if and only if they are not explicitly ...
openaire   +2 more sources

The Safety of Call Arity.

Arch. Formal Proofs, 2015
We formalize the Call Arity analysis, as implemented in GHC, and prove both functional correctness and, more interestingly, safety (i.e. the transformation does not increase allocation). We use syntax and the denotational semantics from the entry "Launchbury", where we formalized Launchbury's natural semantics for lazy evaluation.
openaire   +1 more source

Expressibility of Fixed-Arity Languages

2012
Chapter 3 studies the expressive power of various classes of valued constraints. It contains several results of the following form: let \(\mathcal{C}\) be a class of valued constraints with functions of unbounded arities; then \(\mathcal{C}\) can be expressed by a subset of \(\mathcal{C}\) consisting of valued constraints with functions of a fixed ...
openaire   +1 more source

On the Arity Gap of Finite Functions: Results and Applications.

J. Multiple Valued Log. Soft Comput., 2008
peer ...
Couceiro, Miguel, Lehtonen, Erkko
openaire   +3 more sources

Arities and Aritizabilities of Group, Monoid and Groupoid Theories

Lobachevskii Journal of Mathematics, 2022
In I Pavlyuk
exaly  

arity, n.

2023
openaire   +1 more source