Results 261 to 270 of about 2,753 (280)
Some of the next articles are maybe not open access.
Computational aspects of arity hierarchies
1997The 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
The Robinson property and amalgamations of higher arities
Mathematical Logic Quarterly, 2016In 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
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
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
Convergence analysis of Hermite subdivision schemes of any arity
Applied Numerical Mathematics, 2023Hongchan Zheng
exaly
Arbitrary-Arity Tree Automata for QCTL.
We introduce a new class of automata (which we coin EU-automata) running on infinite trees of arbitrary (finite) arity. We develop and study several algorithms to perform classical operations (union, intersection, complement, projection, alternation removal) for those automata, and precisely characterise their complexities.Laroussinie, François, Markey, Nicolas
openaire +2 more sources
The arity gap of order-preserving functions and extensions of pseudo-Boolean functions
Discrete Applied Mathematics, 2012MIGUEL Couceiro +2 more
exaly
Number of wavelengths required in m ‐arity tree networks
Electronics Letters, 2014Nadia Al-Aboody
exaly

