Results 21 to 30 of about 40,361 (263)
The arity gap of polynomial functions over bounded distributive lattices [PDF]
, 2009 Let A and B be arbitrary sets with at least two elements. The arity gap of a function f: A^n \to B is the minimum decrease in its essential arity when essential arguments of f are identified.
Couceiro, Miguel, Lehtonen, Erkko
core +1 more source
On Safety of Unary and Non-unary IFP-operators
Моделирование и анализ информационных систем, 2018 In this paper, we investigate the safety of unary inflationary fixed point operators (IFPoperators). The safety is a computability in finitely many steps.
Sergey Dudakov
doaj +1 more source
Dynamic Complexity of Parity Exists Queries [PDF]
Logical Methods in Computer Science, 2021 Given a graph whose nodes may be coloured red, the parity of the number of red nodes can easily be maintained with first-order update rules in the dynamic complexity framework DynFO of Patnaik and Immerman.
Nils Vortmeier, Thomas Zeume
doaj +1 more source
The Arity Hierarchy in the Polyadic μ-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 The polyadic mu-calculus is a modal fixpoint logic whose formulas define relations of nodes rather than just sets in labelled transition systems. It can express exactly the polynomial-time computable and bisimulation-invariant queries on finite graphs ...
Martin Lange
doaj +1 more source
Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic [PDF]
, 2020 In this paper, we initiate a systematic study of the parametrised complexity in the field of Dependence Logics which finds its origin in the Dependence Logic of V\"a\"an\"anen from 2007.
A Durand +22 more
core +3 more sources
Generalized 5-Point Approximating Subdivision Scheme of Varying Arity
Mathematics, 2020 The Subdivision Schemes (SSs) have been the heart of Computer Aided Geometric Design (CAGD) almost from its origin, and various analyses of SSs have been conducted.
Sardar Muhammad Hussain +5 more
doaj +1 more source
On the Mints Hierarchy in First-Order Intuitionistic Logic [PDF]
Logical Methods in Computer Science, 2017 We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these fragments.
Aleksy Schubert +2 more
doaj +1 more source
Additive decomposability of functions over abelian groups [PDF]
, 2011 Abelian groups are classified by the existence of certain additive decompositions of group-valued functions of several variables with arity gap 2.Comment: 17 ...
ERKKO LEHTONEN +8 more
core +6 more sources
Essential arities in algebras of finite type and arity trees
Discrete Mathematics, 2002 Given an algebra \(A\), \(S(A)\) denotes the set of those nonnegative integers \(n\) for which there is a nontrivial essentially \(n\)-ary term operation on \(A\). In 1965, K. Urbanik characterized the sets \(S\) of integers such that \(S= S(A)\) for some idempotent algebra \(A\).
Kisielewicz, Andrzej, Tomasik, Jerzy
openaire +2 more sources
Polyadic Hopf Algebras and Quantum Groups
East European Journal of Physics, 2021 This article continues the study of concrete algebra-like structures in our polyadic approach, where the arities of all operations are initially taken as arbitrary, but the relations between them, the arity shapes, are to be found from some natural ...
S. Duplij
doaj +1 more source