Results 251 to 260 of about 40,361 (263)

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 Gągolewski, Przemysław Grzegorzewski   +1 more
openaire   +1 more source

A Survey on the Arity Gap

2011 41st IEEE International Symposium on Multiple-Valued Logic, 2011
The arity gap of a function of several variables is defined as the minimum decrease in the number of essential variables when essential variables of the function are identified. We present a brief survey on the research done on the arity gap, from the first studies of this notion up to recent developments.
Miguel Couceiro, Erkko Lehtonen, Tam´s Waldhauser   +2 more
openaire   +1 more source

Concrete Dualities and Essential Arities

2014 IEEE 44th International Symposium on Multiple-Valued Logic, 2014
Many dualities arise in the same way: they are induced by dualizing objects. We show that these dualities are connected to a question occurring in universal algebra. Indeed, they cause a strong interplay between the essential arity of finitary operations in one category and the concrete form of the copowers in the other. We elaborate on this connection
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

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   +2 more sources

arity, n.

2023
openaire   +1 more source

Adaptive High-Arity Logical Activation Functions.

Proposed for presentation at the SIAM Conference on Uncertainty Quantification held April 11-15, 2022 in Atlanta, Georgia., 2022
Jed Duersch, Thomas Catanach, Niladri Das   +2 more
openaire   +1 more source

The arity divide

2020
openaire   +1 more source

Recognising Pluralism and Arity Pluralism

2021
openaire   +1 more source