Results 1 to 10 of about 18,240 (305)
Some of the next articles are maybe not open access.
Global solvability for the degenerate Kirchhoff equation with real analytic data
Inventiones Mathematicae, 1992P D'Ancona
exaly
Solvability of Parametric Interval Linear Systems of Equations and Inequalities
SIAM Journal on Matrix Analysis and Applications, 2015Evgenija D Popova
exaly
Solvability of Equations in Classes of Solvable Groups and Lie Algebras
Algebra and Logic, 2017openaire +2 more sources
Solvability = Typability + Inhabitation [PDF]
Logical Methods in Computer Science, 2021 We extend the classical notion of solvability to a lambda-calculus equipped with pattern matching. We prove that solvability can be characterized by means of typability and inhabitation in an intersection type system P based on non-idempotent types. We show first that the system P characterizes the set of terms having canonical form, i.e.
Antonio Bucciarelli +2 more
openaire +7 more sources
Call-by-value Solvability [PDF]
RAIRO - Theoretical Informatics and Applications, 1999 Summary: The notion of solvability in the call-by-value \(\lambda\)-calculus is defined and completely characterized, both from an operational and a logical point of view. The operational characterization is given through a reduction machine, performing the classical \(\beta\)-reduction, according to an innermost strategy.
Luca Paolini, Simona Ronchi Della Rocca
core +3 more sources
The 3-closure of a solvable permutation group is solvable [PDF]
Journal of Algebra, 2022 Let $m$ be a positive integer and let $Ω$ be a finite set. The $m$-closure of $G\leq\operatorname{Sym}(Ω)$ is the largest permutation group on $Ω$ having the same orbits as $G$ in its induced action on the Cartesian product $Ω^m$. The $1$-closure and $2$-closure of a solvable permutation group need not be solvable.
E.A. O'Brien +3 more
openaire +2 more sources